Sunday, December 1, 2019

elementary number theory - Prove that for every pair of coprime positive integers p,q, (xpq1)(x1) is divisible by (xp1)(xq1).




Prove that for every pair of coprime positive integers p,q the expression (xpq1)(x1) is divisible by (xp1)(xq1).



My attempts:


xpq1=(xp)q1 which is divisible by xp1


again, xpq1=(xq)p1 which is divisible by xq1.


But how to prove that it is divisible by their products? Just now an idea struck me. Can I consider gcd of xp1 and xq1 as x1 ?. 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(xm1,xn1)=xgcd(m,n)1,

from which you can deduce that (xmn1)(xgcd(m,n)1) is divisible by (xm1)(xn1).


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...