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
  [rule 30] Is it possible to easily rewrite rule 30 in terms of modular arithmetic ? tommy1729 0 1,457 07/24/2014, 11:09 PM
Last Post: tommy1729
  Generalized arithmetic operator hixidom 16 12,289 06/11/2014, 05:10 PM
Last Post: hixidom
  modular tetration tommy1729 0 2,451 12/26/2010, 10:11 PM
Last Post: tommy1729
  Modular arithmetic Stereotomy 3 5,473 04/03/2010, 12:00 PM
Last Post: bo198214
  Arithmetic in the height-parameter (sums, series) Gottfried 7 9,872 02/06/2010, 12:52 AM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)