mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2020-02-12, 15:03   #1
enzocreti
 
Mar 2018

17·31 Posts
Default 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?
enzocreti is offline   Reply With Quote
Old 2020-02-12, 15:13   #2
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

59×103 Posts
Default

Quote:
Originally Posted by enzocreti View Post
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
retina is offline   Reply With Quote
Old 2020-02-12, 15:14   #3
enzocreti
 
Mar 2018

17×31 Posts
Default ok

ok nevermind
enzocreti is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
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

All times are UTC. The time now is 13:33.

Sat Feb 27 13:33:19 UTC 2021 up 86 days, 9:44, 0 users, load averages: 1.68, 1.71, 1.60

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.