mersenneforum.org N congruent to 2^2^n mod(2^2^n+1)
 Register FAQ Search Today's Posts Mark Forums Read

 2020-02-12, 15:03 #1 enzocreti   Mar 2018 20F16 Posts N congruent to 2^2^n mod(2^2^n+1) 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?
2020-02-12, 15:13   #2
retina
Undefined

"The unspeakable one"
Jun 2006
My evil lair

22·19·79 Posts

Quote:
 Originally Posted by enzocreti 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?
Of course there are.

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

 2020-02-12, 15:14 #3 enzocreti   Mar 2018 17·31 Posts ok ok nevermind

 Similar Threads Thread Thread Starter Forum Replies Last Post enzocreti enzocreti 0 2020-01-26 19:19 enzocreti enzocreti 0 2020-01-09 11:56 enzocreti enzocreti 0 2019-06-27 12:31 smslca Math 2 2012-01-29 11:30

All times are UTC. The time now is 19:38.

Sun Jan 24 19:38:18 UTC 2021 up 52 days, 15:49, 0 users, load averages: 2.40, 2.50, 2.38