How to Prove Common Divisors Divide the G.C.D.?

lifeonfire
Messages
12
Reaction score
0

Homework Statement



Prove that for two integers m,n: all the common divisors divides the g.c.d.(m,n).

Homework Equations





The Attempt at a Solution



g.c.d = aA +bB ; where a, b are the integers

and let d be a common divisor, then:
d|a and d|b.

After this I have no clue where to go.
 
Physics news on Phys.org
Do you know the formula for gcd involving lcm? Try using that.
 
u can even try having a look at how gcd of 2 numbers is obtained http://en.wikipedia.org/wiki/Euclidean_algorithm"
 
Last edited by a moderator:
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...
Back
Top