Pls help understand what this theorem is saying
here is the definition of pseudo prime a composite integer \(n\) is called a pseudo prime if \( 2^n \equiv 2 (\mod{n}) \)
A pseudoprime is a number that fulfills Fermat's Little Theorem but is not a prime.
yes, i get the definition of pseudo prime. i have difficulty in understanding what the statement of theorem is saying :|
M stands for Mersenne
i have circled it red in the attached snapshot...
what does it mean a larger one ?
a larger pseudoprime
im not getting it :( is it saying, if n is a pseudo prime, then 2^n-1 is a larger pseudo prime... ? this statement is hard to comprehend to me still
That means, \(\Large2^{n-1}\equiv1(\mod n)\rightarrow2^{2^n-1}\equiv1(\mod2^n-1)\)
Or, if \(n\) is a pseudoprime, then \(2^n-1\) is also a pseudoprime
yeah, if the statement was like that, it makes much more sense. the phrase : "...is a larger one " is completely throwing me off
Where are you from? :)
are you freakin kidding me you're ganeshie8?! why? you're banned?
...
why
was reviewing number theory and got stuck on this for a while
simply... ;)
xD
close it?
Join our real-time social learning platform and learn together with your friends!