Question. Proof of divides - 2 approaches












2












$begingroup$


Suppose $n$ is an integer. If 3|n then 3|$n^2$. Prove.



So I'm wondering if both approaches here are ok.



$1^{st}$:



3|n so $n=3a$ a in integers



$n^2=9a^2$



$n^2=3(3a^2)$



$2^{nd}$:



$n=3a$



(both cases we have 3 times an integer) Thanks



$n^2=3an$










share|cite|improve this question











$endgroup$








  • 5




    $begingroup$
    Both approaches are valid, yeah.
    $endgroup$
    – Eevee Trainer
    Dec 4 '18 at 22:10










  • $begingroup$
    I wouldn't say there is really any difference between these two approaches.
    $endgroup$
    – Morgan Rodgers
    Dec 4 '18 at 23:24
















2












$begingroup$


Suppose $n$ is an integer. If 3|n then 3|$n^2$. Prove.



So I'm wondering if both approaches here are ok.



$1^{st}$:



3|n so $n=3a$ a in integers



$n^2=9a^2$



$n^2=3(3a^2)$



$2^{nd}$:



$n=3a$



(both cases we have 3 times an integer) Thanks



$n^2=3an$










share|cite|improve this question











$endgroup$








  • 5




    $begingroup$
    Both approaches are valid, yeah.
    $endgroup$
    – Eevee Trainer
    Dec 4 '18 at 22:10










  • $begingroup$
    I wouldn't say there is really any difference between these two approaches.
    $endgroup$
    – Morgan Rodgers
    Dec 4 '18 at 23:24














2












2








2





$begingroup$


Suppose $n$ is an integer. If 3|n then 3|$n^2$. Prove.



So I'm wondering if both approaches here are ok.



$1^{st}$:



3|n so $n=3a$ a in integers



$n^2=9a^2$



$n^2=3(3a^2)$



$2^{nd}$:



$n=3a$



(both cases we have 3 times an integer) Thanks



$n^2=3an$










share|cite|improve this question











$endgroup$




Suppose $n$ is an integer. If 3|n then 3|$n^2$. Prove.



So I'm wondering if both approaches here are ok.



$1^{st}$:



3|n so $n=3a$ a in integers



$n^2=9a^2$



$n^2=3(3a^2)$



$2^{nd}$:



$n=3a$



(both cases we have 3 times an integer) Thanks



$n^2=3an$







proof-writing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 4 '18 at 23:10









Crabzmatic

302214




302214










asked Dec 4 '18 at 22:09









HarryHarry

253




253








  • 5




    $begingroup$
    Both approaches are valid, yeah.
    $endgroup$
    – Eevee Trainer
    Dec 4 '18 at 22:10










  • $begingroup$
    I wouldn't say there is really any difference between these two approaches.
    $endgroup$
    – Morgan Rodgers
    Dec 4 '18 at 23:24














  • 5




    $begingroup$
    Both approaches are valid, yeah.
    $endgroup$
    – Eevee Trainer
    Dec 4 '18 at 22:10










  • $begingroup$
    I wouldn't say there is really any difference between these two approaches.
    $endgroup$
    – Morgan Rodgers
    Dec 4 '18 at 23:24








5




5




$begingroup$
Both approaches are valid, yeah.
$endgroup$
– Eevee Trainer
Dec 4 '18 at 22:10




$begingroup$
Both approaches are valid, yeah.
$endgroup$
– Eevee Trainer
Dec 4 '18 at 22:10












$begingroup$
I wouldn't say there is really any difference between these two approaches.
$endgroup$
– Morgan Rodgers
Dec 4 '18 at 23:24




$begingroup$
I wouldn't say there is really any difference between these two approaches.
$endgroup$
– Morgan Rodgers
Dec 4 '18 at 23:24










1 Answer
1






active

oldest

votes


















0












$begingroup$

Both are correct. The 2nd is essentially $ 3mid nmid nm,Rightarrow,3mid nm $ by transitivity of "divides" (OP is case $,m = n)$. Thus the set $,3Bbb Z,$ of multiples of $3$ is closed under multiplication by any integer $m$. Similarly you can show it is closed under addition (so also subtraction by $,a-b = a+(-1)b,]$. Therefore $, 3mid m,n,Rightarrow, 3mid j m + k n,$ for all integers $,j,k. $ Ditto if we replace $3$ by any integer.






share|cite|improve this answer











$endgroup$













    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',
    autoActivateHeartbeat: false,
    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%2f3026250%2fquestion-proof-of-divides-2-approaches%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    Both are correct. The 2nd is essentially $ 3mid nmid nm,Rightarrow,3mid nm $ by transitivity of "divides" (OP is case $,m = n)$. Thus the set $,3Bbb Z,$ of multiples of $3$ is closed under multiplication by any integer $m$. Similarly you can show it is closed under addition (so also subtraction by $,a-b = a+(-1)b,]$. Therefore $, 3mid m,n,Rightarrow, 3mid j m + k n,$ for all integers $,j,k. $ Ditto if we replace $3$ by any integer.






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      Both are correct. The 2nd is essentially $ 3mid nmid nm,Rightarrow,3mid nm $ by transitivity of "divides" (OP is case $,m = n)$. Thus the set $,3Bbb Z,$ of multiples of $3$ is closed under multiplication by any integer $m$. Similarly you can show it is closed under addition (so also subtraction by $,a-b = a+(-1)b,]$. Therefore $, 3mid m,n,Rightarrow, 3mid j m + k n,$ for all integers $,j,k. $ Ditto if we replace $3$ by any integer.






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        Both are correct. The 2nd is essentially $ 3mid nmid nm,Rightarrow,3mid nm $ by transitivity of "divides" (OP is case $,m = n)$. Thus the set $,3Bbb Z,$ of multiples of $3$ is closed under multiplication by any integer $m$. Similarly you can show it is closed under addition (so also subtraction by $,a-b = a+(-1)b,]$. Therefore $, 3mid m,n,Rightarrow, 3mid j m + k n,$ for all integers $,j,k. $ Ditto if we replace $3$ by any integer.






        share|cite|improve this answer











        $endgroup$



        Both are correct. The 2nd is essentially $ 3mid nmid nm,Rightarrow,3mid nm $ by transitivity of "divides" (OP is case $,m = n)$. Thus the set $,3Bbb Z,$ of multiples of $3$ is closed under multiplication by any integer $m$. Similarly you can show it is closed under addition (so also subtraction by $,a-b = a+(-1)b,]$. Therefore $, 3mid m,n,Rightarrow, 3mid j m + k n,$ for all integers $,j,k. $ Ditto if we replace $3$ by any integer.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 4 '18 at 22:38

























        answered Dec 4 '18 at 22:33









        Bill DubuqueBill Dubuque

        209k29190632




        209k29190632






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026250%2fquestion-proof-of-divides-2-approaches%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            To store a contact into the json file from server.js file using a class in NodeJS

            Marschland

            Redirect URL with Chrome Remote Debugging Android Devices