Prove that for every pair of coprime positive integers p,q the expression (xpq−1)(x−1) is divisible by (xp−1)(xq−1).
My attempts:
xpq−1=(xp)q−1 which is divisible by xp−1
again, xpq−1=(xq)p−1 which is divisible by xq−1.
But how to prove that it is divisible by their products? Just now an idea struck me. Can I consider gcd of xp−1 and xq−1 as x−1 ?. If yes, then we are done!
Answer
To answer your question, if the exponents are not coprime, you can try to prove the general formula: gcd(xm−1,xn−1)=xgcd(m,n)−1,
from which you can deduce that (xmn−1)(xgcd(m,n)−1) is divisible by (xm−1)(xn−1).
No comments:
Post a Comment