Assume $A+B \mid A^5$ and $A+B \mid B^5$, while all the variables are integers expect zero.
Can we prove that $A=B$?
This is my idea of the proof:
For every prime $p$ that $p\mid A+B$ there is $p \mid A$ and $p \mid B$.
Let $\gcd(A,B)=P$, so $A=Pw$ and $B=Pv$ such that $w$ and $v$ have no common factors with $P$. Then if $q\ne 1$, such that $q$ and $P$ are coprime, and $q\mid A+B$ then $q\mid w+v$, and hence $q$ divides both $A$ and $B$, and this is not possible.
Hence $A=P$ and $B=P$.
In this proof, I did not use the exponent $5$ at all. So I feel there is something wrong with the proof. Is there any thoerem that can be used here?