# If $a,b$ are positive integers such that $a^{n}+n$ divides $b^{n}+n$ for every $n$, then $a=b$ [closed]

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!

## closed as off-topic by Siong Thye Goh, user26857, Jendrik Stelzner, Nosrati, NamasteAug 28 '18 at 12:28

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Siong Thye Goh, user26857, Jendrik Stelzner, Nosrati, Namaste
If this question can be reworded to fit the rules in the help center, please edit the question.

• You could try something along the lines of choosing $n$ such that $n$ is a prime not in the prime factorization of either of $a$ or $b$. Then use the fundamental theorem (arithmetic) to show $a=b$ is a necessary condition. – LPenguin Aug 28 '18 at 4:01
• Thanks LPenguin. $a^p+p$ divides $b^p+p$, p prime, $gcd(a,p)=gcd(b,p)=1$ – Kai Aug 28 '18 at 4:44
• That means $k(a^p+p)=b^p+p$ – Kai Aug 28 '18 at 4:45
• For k is a natural number, k>1. (I am trying to prove by contradiction) – Kai Aug 28 '18 at 4:46
• Therefore $ka^{p}+kp=b^p+p$ – Kai Aug 28 '18 at 4:52

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