![]() |
|
Tetration and modular arithmetic. - Printable Version +- Tetration Forum (https://tetrationforum.org) +-- Forum: Tetration and Related Topics (https://tetrationforum.org/forumdisplay.php?fid=1) +--- Forum: Mathematical and General Discussion (https://tetrationforum.org/forumdisplay.php?fid=3) +--- Thread: Tetration and modular arithmetic. (/showthread.php?tid=833) |
Tetration and modular arithmetic. - tommy1729 - 01/12/2014 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 |