Easy way to prove that 341 is a psuedo prime

Posted on April 30, 2018 by Sumant Sumant

The fermat’s little theorem says that a number p is a prime if for all n, p divides n^p-n. Now 341 = 31 \times 11. So we have 2^{341}-2 = 2(2^{340}-1)=2(2^{(10)(34)}-1^{340})=2(2^{10}-1)(\cdots) = 2(1023)(\cdots)=2(341)(3)(\cdots). Hence proved

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Number Theory, Proof, Trick and tagged . Bookmark the permalink.

Leave a comment