Solve Hard GCD Problems: Prove d=d1d2 with d1|a and d2|b

  • Thread starter Thread starter lordy12
  • Start date Start date
  • Tags Tags
    Gcd Hard
lordy12
Messages
36
Reaction score
0
1. If d|ab and gcd(a,b)=1, prove that d=d1d2 where d1|a and d2|b and gcd(d1,d2) = 1



Homework Equations





3. Let d1 = gcd(d,a). Thats all I know
 
Physics news on Phys.org
Write down prime decompositions for a, b, and ab, and see if that helps you out. :smile:
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
8
Views
3K
Replies
1
Views
1K
Replies
2
Views
2K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
18
Views
2K
Back
Top