Alternative proof of $gcd(a,b)midtext{lcm}(a,b)$
up vote
1
down vote
favorite
I proved this problem using the theorem $gcd(a,b)text{lcm}(a,b)=ab$ Let $d=gcd(a,b)$. Then $dmid a$ and $dmid b$. Thus, $a=dr$ and $b=ds$ for some integer $r$ and $s$. Then
$$d(text{lcm}(a,b))=abRightarrow text{lcm}(a,b)=frac{ab}{d}Rightarrow text{lcm}(a,b)=frac{d^2rs}{d}Rightarrow text{lcm}(a,b)=drsRightarrow dmid text{lcm}(a,b)$$
as required.
Is my alternative proof for this problem correct?
number-theory elementary-number-theory proof-verification
add a comment |
up vote
1
down vote
favorite
I proved this problem using the theorem $gcd(a,b)text{lcm}(a,b)=ab$ Let $d=gcd(a,b)$. Then $dmid a$ and $dmid b$. Thus, $a=dr$ and $b=ds$ for some integer $r$ and $s$. Then
$$d(text{lcm}(a,b))=abRightarrow text{lcm}(a,b)=frac{ab}{d}Rightarrow text{lcm}(a,b)=frac{d^2rs}{d}Rightarrow text{lcm}(a,b)=drsRightarrow dmid text{lcm}(a,b)$$
as required.
Is my alternative proof for this problem correct?
number-theory elementary-number-theory proof-verification
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I proved this problem using the theorem $gcd(a,b)text{lcm}(a,b)=ab$ Let $d=gcd(a,b)$. Then $dmid a$ and $dmid b$. Thus, $a=dr$ and $b=ds$ for some integer $r$ and $s$. Then
$$d(text{lcm}(a,b))=abRightarrow text{lcm}(a,b)=frac{ab}{d}Rightarrow text{lcm}(a,b)=frac{d^2rs}{d}Rightarrow text{lcm}(a,b)=drsRightarrow dmid text{lcm}(a,b)$$
as required.
Is my alternative proof for this problem correct?
number-theory elementary-number-theory proof-verification
I proved this problem using the theorem $gcd(a,b)text{lcm}(a,b)=ab$ Let $d=gcd(a,b)$. Then $dmid a$ and $dmid b$. Thus, $a=dr$ and $b=ds$ for some integer $r$ and $s$. Then
$$d(text{lcm}(a,b))=abRightarrow text{lcm}(a,b)=frac{ab}{d}Rightarrow text{lcm}(a,b)=frac{d^2rs}{d}Rightarrow text{lcm}(a,b)=drsRightarrow dmid text{lcm}(a,b)$$
as required.
Is my alternative proof for this problem correct?
number-theory elementary-number-theory proof-verification
number-theory elementary-number-theory proof-verification
edited 5 hours ago
Tianlalu
2,180631
2,180631
asked 6 hours ago
Ling Min Hao
34418
34418
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago
add a comment |
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago
add a comment |
2 Answers
2
active
oldest
votes
up vote
1
down vote
Your alternate proof is correct, but you don't need to do all this, you can directly say d|a and a|lcm(a,b).
Hope it helps
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
add a comment |
up vote
-1
down vote
$gcd(a,b)cdottext{lcm}(a,b)=acdot b=>$
$$
\frac{text{lcm}(a,b)}{gcd(a,b)}=frac{a}{gcd(a,b)}cdotfrac{b}{gcd(a, b)}inmathbb N
$$
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Your alternate proof is correct, but you don't need to do all this, you can directly say d|a and a|lcm(a,b).
Hope it helps
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
add a comment |
up vote
1
down vote
Your alternate proof is correct, but you don't need to do all this, you can directly say d|a and a|lcm(a,b).
Hope it helps
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
add a comment |
up vote
1
down vote
up vote
1
down vote
Your alternate proof is correct, but you don't need to do all this, you can directly say d|a and a|lcm(a,b).
Hope it helps
Your alternate proof is correct, but you don't need to do all this, you can directly say d|a and a|lcm(a,b).
Hope it helps
answered 6 hours ago
Crazy for maths
4486
4486
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
add a comment |
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
Yes, I do know this proof. I am just worried my proof might reach to circular reasoning so I want to verify at here. Thanks anyway.
– Ling Min Hao
6 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
he literally says "alternate proof", so the second part of your answer seems pointless
– mathworker21
5 hours ago
add a comment |
up vote
-1
down vote
$gcd(a,b)cdottext{lcm}(a,b)=acdot b=>$
$$
\frac{text{lcm}(a,b)}{gcd(a,b)}=frac{a}{gcd(a,b)}cdotfrac{b}{gcd(a, b)}inmathbb N
$$
add a comment |
up vote
-1
down vote
$gcd(a,b)cdottext{lcm}(a,b)=acdot b=>$
$$
\frac{text{lcm}(a,b)}{gcd(a,b)}=frac{a}{gcd(a,b)}cdotfrac{b}{gcd(a, b)}inmathbb N
$$
add a comment |
up vote
-1
down vote
up vote
-1
down vote
$gcd(a,b)cdottext{lcm}(a,b)=acdot b=>$
$$
\frac{text{lcm}(a,b)}{gcd(a,b)}=frac{a}{gcd(a,b)}cdotfrac{b}{gcd(a, b)}inmathbb N
$$
$gcd(a,b)cdottext{lcm}(a,b)=acdot b=>$
$$
\frac{text{lcm}(a,b)}{gcd(a,b)}=frac{a}{gcd(a,b)}cdotfrac{b}{gcd(a, b)}inmathbb N
$$
answered 3 hours ago
Samvel Safaryan
37710
37710
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997908%2falternative-proof-of-gcda-b-mid-textlcma-b%23new-answer', 'question_page');
}
);
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
math.stackexchange.com/questions/349858/…
– 1ENİGMA1
5 hours ago