Proof of n^m - n Divisible by m for Positive Integers

  • Thread starter Thread starter JasonJo
  • Start date Start date
JasonJo
Messages
425
Reaction score
2
My teacher posed this as an extra credit problem on an exam, i couldn't quite prove it. I'm wondering if you guys could help me, i would really like to see the proof even though i already took the exam:

Prove that if n and m are positive integers, then n^m - n is divisible by m.

I took a few approaches:

I tried to pose the problem in mod m. so if n^m - n is divisible by m, then it'll be congruent to 0 mod m. so then i tried to induction on n, but i got stuck on the (k+1)^m expansion. I don't believe this is the correct way.

Another way I tried was to break it up into cases:
Case #1: m|n, then it must divide n^m - n
Case #2: m does not divide n. so then n = mq + r, where r is greater than zero and less than q. then I'm still stuck with a binomial expansion.

any help guys?
 
Physics news on Phys.org
That's wrong as you've stated it. For example, 6 does not divide 2^6-2=62. But it looks similar to Fermat's little theorem, and you might get something valid if you changed some of the conditions on n and m.
 
Prove $$\int\limits_0^{\sqrt2/4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx = \frac{\pi^2}{8}.$$ Let $$I = \int\limits_0^{\sqrt 2 / 4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx. \tag{1}$$ The representation integral of ##\arcsin## is $$\arcsin u = \int\limits_{0}^{1} \frac{\mathrm dt}{\sqrt{1-t^2}}, \qquad 0 \leqslant u \leqslant 1.$$ Plugging identity above into ##(1)## with ##u...
Back
Top