Let k be a positive integer such that are all prime numbers, and put
Deduce that if then .
Conclude that if that is, that m is a Carmichael number.
I am stumped...
Follow Math Help Forum on Facebook and Google+
Maybe you should have gone to Norin's office hours?
That's pretty funny. Now stop stalking each other, guys.
It's easy to see that , , . by Fermat's Little Theorem.
From above we now know .
Therefore . since we have an integer cubed.
Last edited by chiph588@; January 19th 2010 at 02:14 PM.
View Tag Cloud