Let k be a positive integer such that are all prime numbers, and put

Show that

Deduce that if then .

Conclude that if that is, that m is a Carmichael number.

I am stumped...

Printable View

- December 15th 2009, 01:34 PMcomssaproof with carmichael numbers
Let k be a positive integer such that are all prime numbers, and put

Show that

Deduce that if then .

Conclude that if that is, that m is a Carmichael number.

I am stumped... - December 15th 2009, 05:06 PMiknowwhatyoudidlastsummer
Maybe you should have gone to Norin's office hours?

- December 15th 2009, 05:31 PMBruno J.
(Rofl)

That's pretty funny. Now stop stalking each other, guys. - December 15th 2009, 07:28 PMchiph588@

It's easy to see that , , .

by Fermat's Little Theorem.

From above we now know .

Therefore .

since we have an integer cubed.

Therefore .

i.e. .