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!
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!
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$$