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:
Prove $$\int\limits_0^{\sqrt2/4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx = \frac{\pi^2}{8}.$$ Let $$I = \int\limits_0^{\sqrt 2 / 4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx. \tag{1}$$ The representation integral of ##\arcsin## is $$\arcsin u = \int\limits_{0}^{1} \frac{\mathrm dt}{\sqrt{1-t^2}}, \qquad 0 \leqslant u \leqslant 1.$$ Plugging identity above into ##(1)## with ##u...
Back
Top