0

For a Carmichael number $n$, and $p$ a prime that divides $n$, show that $p-1$ divides $\dfrac{n}{p}-1$. I'm not sure on where to start for this proof, so any help would be appreciated!

1 Answers1

0

If $\ n = pk\ $ then $\ n\!-\!1 = (p\!-\!1)k + k\!-\!1\ $ so $\,p\!-\!1\mid n\!-\!1 \iff p\!-\!1\mid k\!-\!1 = \frac{n}p\!-\!1$

Remark $\ $ A complete proof of Korselt's Criterion is in this answer.

Bill Dubuque
  • 272,048