We have $$\frac{a^n+b^n}{a+b}=\sum_{j=0}^{n-1}a^j(-b)^{n-1-j}\equiv \sum_{j=0}^{n-1}a^ja^{n-1-j}=na^{n-1}\mod a+b$$ for every odd $n$
Hence if $n$ is an odd prime and $q\
e n$ a prime dividing both $a+b$ and $\frac{a^n+b^n}{a+b}$, we get $$0\equiv \frac{a^n+b^n}{a+b}\equiv na^{n-1}\mod q$$ hence $q$ must didvide $a$ and because $q$ divides $a+b$, $q$ must also divide $b$. But $a$ and $b$ are coprime, we get a contradiction.
In the case $n=2$, we have $a^2+b^2=(a+b)^2-2ab$, hence if $q\
e 2$ divides both $\frac{a^2+b^2}{a+b}$ (and therfore $a^2+b^2$) and $a+b$, it divides $2ab$ and therefore $a$ or $b$ and therefore $a$ and $b$. We get a contradiction again.