If $gcd(a,b)=1$ then $gcd\big(\frac{a^{p}+b^{p}}{a+b},a+b\big)=1$ unless $p|a+b$

64 Views Asked by At

If $\gcd(a,b)=1$ then $$\gcd\left(\frac{a^{p}+b^{p}}{a+b},a+b\right)=1$$ unless $p|(a+b)$ Where $p$ is any prime. Use of modular arithmetic is restricted. Can you prove it just using basic divisiblity and definition of gcd ?