Given that $n,a,b \in \mathbb{N}$ and $n\mid(a^n-b^n)$ , can we prove or disprove $n\mid(a-b)$ ?

Using Fermat's little theorem, we can prove the case when n is a prime number. What about the case when n is a composite number?
I also know that $(a-b)\mid(a^n-b^n)$ .

  • 2
    $\begingroup$ For composite $n$ the claim is not necessarily true. Check $n=4,a=3,b=1$ as an example. $\endgroup$ – Brian Cheung Jun 28 '16 at 10:15
  • $\begingroup$ @Linear, you should approve suggested title. $\endgroup$ – Mithlesh Upadhyay Jun 28 '16 at 10:51
  • $\begingroup$ @MithleshUpadhyay I don't want to repeat the sentence in the content. We can still search the question with the text in the content. $\endgroup$ – Linear Jun 28 '16 at 10:53
  • $\begingroup$ @Linear, That's valid edit to right click. $\endgroup$ – Mithlesh Upadhyay Jun 28 '16 at 10:56

We can prove $$8|(p^2-q^2)$$ where $p,q$ are odd

But we can easily choose $p\not\equiv q\pmod 8$

  • $\begingroup$ And hence $8\mid (p^8-q^8).$ $\endgroup$ – awllower Jun 28 '16 at 10:16
  • $\begingroup$ See also : math.stackexchange.com/questions/525947/… $\endgroup$ – lab bhattacharjee Jun 28 '16 at 10:17
  • $\begingroup$ @awllower, Yes as $$(p^2)^4-(q^2)^4$$ is divisible by $p^2-q^2$ $\endgroup$ – lab bhattacharjee Jun 28 '16 at 10:18
  • 1
    $\begingroup$ I just commented as a complement. :D $\endgroup$ – awllower Jun 28 '16 at 10:19
  • 2
    $\begingroup$ @awllower, I just added the explanation :) $\endgroup$ – lab bhattacharjee Jun 28 '16 at 10:20

We have $$a^n-b^n = (a-b)\left(a^{n-1} + a^{n-2}b+a^{n-3}b^2+\dots+ab^{n-2} + b^{n-1}\right)$$ So, if $n|(a^n-b^n)$, it is not necessarily true that $n|(a-b)$.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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