Thread Rating:
  • 1 Vote(s) - 5 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Tetration and modular arithmetic.
#1
Let p be a prime larger than 100.
Let 0 < n < p.

How many residue classes does 2^^n mod p have ?

Lets define R(f(n),p) as the number of residue classes for f(n) mod p.

Conjecture : R(2^^n,p) < p - log(p) - slog(p)

where the log and slog are base 2.

regards

tommy1729
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
Question Continuously Iterating Modular Arithmetic Catullus 17 848 07/22/2022, 02:16 AM
Last Post: MphLee
  [Video] From modular forms to elliptic curves - The Langlands Program MphLee 1 214 06/19/2022, 08:40 PM
Last Post: JmsNxn
  Trying to get Kneser from beta; the modular argument JmsNxn 2 634 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,253 07/24/2014, 11:09 PM
Last Post: tommy1729
  modular tetration tommy1729 0 4,084 12/26/2010, 10:11 PM
Last Post: tommy1729
  Modular arithmetic Stereotomy 3 9,782 04/03/2010, 12:00 PM
Last Post: bo198214
  Arithmetic in the height-parameter (sums, series) Gottfried 7 19,461 02/06/2010, 12:52 AM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)