Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I would like to show that Fermat's Little Theorem doesn't hold when p is not prime.

I'm assuming this would be a proof by contradiction that Fermat's Theorem only works with prime numbers, but I'm not sure how to go about writing such a proof. Would we need to show that if p isn't prime, then a to any power less than p may share a common factor with p?

share|cite|improve this question
just find one counterexample. – user51427 Dec 9 '12 at 3:01
You might want to run a search on "pseudoprime". – Gerry Myerson Dec 9 '12 at 5:48
It’s not clear to me just what your quest is. Is it to find a single counterexample, as @sunflower says, or is it to show that for every nonprime, say $P$, Fermat’s Little fails for $P$? If the latter, take @Gerry’s suggestion, or look up “Carmichael numbers”. – Lubin Dec 11 '12 at 1:34
Partly depends on how you write Fermat's Theorem. if we use the $x^p\equiv x\pmod{p}$ version, it does hold for some non-primes. Take for example $p=4$. – André Nicolas Dec 11 '12 at 2:07

$a^{p-1} \equiv 1 \bmod p $

let $a = 2$, $p =4$

$2^3 = 8 \bmod 4 =0$

share|cite|improve this answer
But $a=2$ is also a counterexample for $p=2$. It's a little harder to find a counterexample if you insist on $\gcd(a,p)=1$ in your statement of Fermat. . – Gerry Myerson Dec 11 '12 at 3:09
@GerryMyerson, he is from my class, I'm pretty sure this counterexample is enough for the grader to give him full point. – xiamx Dec 11 '12 at 3:19
Fine, but he's missing out on the interesting stuff. (Aside: Jillian is a he?) – Gerry Myerson Dec 11 '12 at 3:20

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.