Ask your own question, for FREE!
Mathematics 19 Online
OpenStudy (anonymous):

Pls help understand what this theorem is saying

OpenStudy (anonymous):

OpenStudy (anonymous):

here is the definition of pseudo prime a composite integer \(n\) is called a pseudo prime if \( 2^n \equiv 2 (\mod{n}) \)

OpenStudy (kc_kennylau):

A pseudoprime is a number that fulfills Fermat's Little Theorem but is not a prime.

OpenStudy (anonymous):

yes, i get the definition of pseudo prime. i have difficulty in understanding what the statement of theorem is saying :|

OpenStudy (kc_kennylau):

M stands for Mersenne

OpenStudy (anonymous):

i have circled it red in the attached snapshot...

OpenStudy (anonymous):

what does it mean a larger one ?

OpenStudy (kc_kennylau):

https://en.wikipedia.org/wiki/Mersenne_prime

OpenStudy (kc_kennylau):

a larger pseudoprime

OpenStudy (kc_kennylau):

http://mathworld.wolfram.com/FermatPseudoprime.html

OpenStudy (anonymous):

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

OpenStudy (kc_kennylau):

That means, \(\Large2^{n-1}\equiv1(\mod n)\rightarrow2^{2^n-1}\equiv1(\mod2^n-1)\)

OpenStudy (kc_kennylau):

Or, if \(n\) is a pseudoprime, then \(2^n-1\) is also a pseudoprime

OpenStudy (anonymous):

yeah, if the statement was like that, it makes much more sense. the phrase : "...is a larger one " is completely throwing me off

OpenStudy (kc_kennylau):

Where are you from? :)

OpenStudy (kc_kennylau):

are you freakin kidding me you're ganeshie8?! why? you're banned?

OpenStudy (kc_kennylau):

...

OpenStudy (kc_kennylau):

why

OpenStudy (anonymous):

was reviewing number theory and got stuck on this for a while

OpenStudy (anonymous):

simply... ;)

OpenStudy (kc_kennylau):

xD

OpenStudy (kc_kennylau):

close it?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!