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


Possibly Related Threads…
Thread Author Replies Views Last Post
  Evaluating Arithmetic Functions In The Complex Plane Caleb 6 1,793 02/20/2023, 12:16 AM
Last Post: tommy1729
Question Continuously Iterating Modular Arithmetic Catullus 17 4,719 07/22/2022, 02:16 AM
Last Post: MphLee
  [Video] From modular forms to elliptic curves - The Langlands Program MphLee 1 919 06/19/2022, 08:40 PM
Last Post: JmsNxn
  Trying to get Kneser from beta; the modular argument JmsNxn 2 1,594 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,779 07/24/2014, 11:09 PM
Last Post: tommy1729
  modular tetration tommy1729 0 4,596 12/26/2010, 10:11 PM
Last Post: tommy1729
  Modular arithmetic Stereotomy 3 11,152 04/03/2010, 12:00 PM
Last Post: bo198214
  Arithmetic in the height-parameter (sums, series) Gottfried 7 22,395 02/06/2010, 12:52 AM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)