modular tetration
modular tetration

the title is pretty clear.

we know alot about modular aritmetic.

but what about tetration ?

what do we know about e.g. a^^b mod p where p is a large odd prime and a and b are odd composites ?

or how do we solve for the smallest b satisifying

a^^b = c^^d mod p

how about cryptography ?

how about fixpoints ? or theorems ? conjectures ?

are there special kinds of primes p such that " equation mod p " is made easier ?

did i ask this before on this forum ?



Possibly Related Threads…
Thread Author Replies Views Last Post
Question Continuously Iterating Modular Arithmetic Catullus 17 1,544 07/22/2022, 02:16 AM
Last Post: MphLee
  [Video] From modular forms to elliptic curves - The Langlands Program MphLee 1 377 06/19/2022, 08:40 PM
Last Post: JmsNxn
  Trying to get Kneser from beta; the modular argument JmsNxn 2 843 03/29/2022, 06:34 AM
Last Post: JmsNxn
  [rule 30] Is it possible to easily rewrite rule 30 in terms of modular arithmetic ? tommy1729 0 3,355 07/24/2014, 11:09 PM
Last Post: tommy1729
  Tetration and modular arithmetic. tommy1729 0 4,013 01/12/2014, 05:07 AM
Last Post: tommy1729
  Modular arithmetic Stereotomy 3 10,062 04/03/2010, 12:00 PM
Last Post: bo198214

Users browsing this thread: 1 Guest(s)