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?










share|cite|improve this question
























  • math.stackexchange.com/questions/349858/…
    – 1ENİGMA1
    5 hours ago















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?










share|cite|improve this question
























  • math.stackexchange.com/questions/349858/…
    – 1ENİGMA1
    5 hours ago













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?










share|cite|improve this question















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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








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


















  • 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










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






share|cite|improve this answer





















  • 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


















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
$$






share|cite|improve this answer





















    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














     

    draft saved


    draft discarded


















    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
































    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






    share|cite|improve this answer





















    • 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















    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






    share|cite|improve this answer





















    • 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













    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






    share|cite|improve this answer












    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







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    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


















    • 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










    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
    $$






    share|cite|improve this answer

























      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
      $$






      share|cite|improve this answer























        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
        $$






        share|cite|improve this answer












        $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
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 3 hours ago









        Samvel Safaryan

        37710




        37710






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            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




















































































            Popular posts from this blog

            Plaza Victoria

            Puebla de Zaragoza

            Musa