PDA

View Full Version : hard gcd problems


lordy12
Apr10-07, 07:35 PM
1. If d|ab and gcd(a,b)=1, prove that d=d1d2 where d1|a and d2|b and gcd(d1,d2) = 1



2. Relevant equations



3. Let d1 = gcd(d,a). Thats all I know

Data
Apr10-07, 09:14 PM
Write down prime decompositions for a, b, and ab, and see if that helps you out. :smile: