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

Is it true that there are infinitely many nonprime integers $n$ such that $3^{n-1} - 2^{n-1}$ is a multiple of $n$?

share|cite|improve this question
I believe this follows from the existence of infinitely many Carmichael numbers, but maybe there is a more elementary proof. – Qiaochu Yuan Jul 29 '10 at 6:54
I was just writing to refer to pseudoprimes :-) – mau Jul 29 '10 at 8:38
up vote 11 down vote accepted

I think I know how to prove it without using of Carmichael numbers.

Take $n = 3^{2^k} - 2^{2^k}$. Then it's not hard to prove by induction on $k$ that $2^k | n - 1$. Hence $3^{2^k} - 2^{2^k} | 3^{n-1} - 2^{n-1}$ (that's true because $a - b | a^r - b^r$ for any natural $a, b$ and $k$).

share|cite|improve this answer

as Qiaochu Yuan pointed out, take a Carmichael number q; by definition, 3q-1 and 2q-1 are both congruent to 1 mod q, so their difference is a multiple of q. Since Carmichael numbers are infinite, you are done.

share|cite|improve this answer
If q is relatively prime to 3. I don't know if this occurs infinitely often. – Qiaochu Yuan Jul 29 '10 at 17:18

It is true for all n such that $(n,2)=(n,3)=1$ and for which the order of 2 & 3 modulo n is same.

share|cite|improve this answer

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.