![]() |
![]() |
#1 |
Mar 2018
10000011112 Posts |
![]()
92020 is congruent to 2^(2^2) mod (2^(2^2)+1) where 2^(2^2)+1 is a Fermat prime
Are there infinitely many numbers N congruent to (2^(2^n)) mod (2^(2n)+1) where (2^(2n)+1) is a Fermat prime? |
![]() |
![]() |
![]() |
#2 | |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
7×11×79 Posts |
![]() Quote:
16 mod 17 = 16 33 mod 17 = 16 50 mod 17 = 16 ... So what. Last fiddled with by retina on 2020-02-12 at 15:14 |
|
![]() |
![]() |
![]() |
#3 |
Mar 2018
17·31 Posts |
![]()
ok nevermind
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Pg primes pg(k) with k congruent to 10^n mod 41 | enzocreti | enzocreti | 0 | 2020-01-26 19:19 |
Congruent to 10^n mod 41 | enzocreti | enzocreti | 0 | 2020-01-09 11:56 |
Pg primes congruent to 1111 mod 42^2 | enzocreti | enzocreti | 0 | 2019-06-27 12:31 |
((my) mod n ) congruent to n-1 | smslca | Math | 2 | 2012-01-29 11:30 |