4

I need help with this question.

Let $a$ and $b$ be positive integers such that $a^{n}+n$ divides $b^{n}+n$ for every natural number $n$. Show that $a=b$.

Any help would be appreciated! Thanks!

Kai
  • 894

1 Answers1

4

The main idea came to me when I have solved this problem is that, if we can show that any number which is greater than $b-a$ divides $b-a$, then we will have $b=a$. Let $p$ is a prime satisfies $\gcd(a,p)=1$ , $\gcd(b,p)=1$ and $p>b-a$. Consider $k$, any positive integer such that $p\mid k-a$. As, it is true for any natural number, consider a $n=k(p-1)+p$. Fermat's Little Theorem gives $$a^n \equiv a\equiv -k(p-1)\pmod{p} \implies p\mid a^n+n \mid b^n+n \\ \implies a^n \equiv b^n\pmod{p} \implies a \equiv b\pmod{p} \implies a=b$$

tarit goswami
  • 3,047
  • 1
  • 13
  • 27
  • 1
    I figured out another solution. Let p be prime, and a divide p and let b not divide p. This way $a^p+p$ is divisible by p, but $b^p+p$ is not. Contradiction. – Kai Aug 28 '18 at 17:51
  • I came up with this two hours after I asked. – Kai Aug 28 '18 at 17:52
  • @Kai Well done, please accept the answer if this one fulfills what u have wanted, otherwise it will be treated as unanswered question and will come back to the top of question queue again and again! – tarit goswami Aug 28 '18 at 17:55
  • 1
    Well I think my answer is right. I got it. It is an answered question. – Kai Aug 28 '18 at 18:21
  • @Kai You have posted some comments about your approach, it will be better to write then in the problem. – tarit goswami Aug 28 '18 at 18:25