Show that $forall_{n,m,kin mathbb{N}}(k|nm$ and gcd$(n,k)=1 Rightarrow k|m)$











up vote
1
down vote

favorite












Please help me



Definitons



gcd := greatest common divisor



Let $k,nin mathbb{Z}$ One says that $k$ divides $n$, in symbols $k|n$ if there exists a $l in mathbb{Z}$ s.t. $n=kl$



For two natural numbers $m,n in mathbb{N}$ the greatest common divisior is defined (symblolic gcd$(k,n)$), the biggest natural number $k$ with $k|m$ and $k|n$










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    Please help me



    Definitons



    gcd := greatest common divisor



    Let $k,nin mathbb{Z}$ One says that $k$ divides $n$, in symbols $k|n$ if there exists a $l in mathbb{Z}$ s.t. $n=kl$



    For two natural numbers $m,n in mathbb{N}$ the greatest common divisior is defined (symblolic gcd$(k,n)$), the biggest natural number $k$ with $k|m$ and $k|n$










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Please help me



      Definitons



      gcd := greatest common divisor



      Let $k,nin mathbb{Z}$ One says that $k$ divides $n$, in symbols $k|n$ if there exists a $l in mathbb{Z}$ s.t. $n=kl$



      For two natural numbers $m,n in mathbb{N}$ the greatest common divisior is defined (symblolic gcd$(k,n)$), the biggest natural number $k$ with $k|m$ and $k|n$










      share|cite|improve this question













      Please help me



      Definitons



      gcd := greatest common divisor



      Let $k,nin mathbb{Z}$ One says that $k$ divides $n$, in symbols $k|n$ if there exists a $l in mathbb{Z}$ s.t. $n=kl$



      For two natural numbers $m,n in mathbb{N}$ the greatest common divisior is defined (symblolic gcd$(k,n)$), the biggest natural number $k$ with $k|m$ and $k|n$







      algebra-precalculus prime-numbers






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 21 at 11:15









      RM777

      1528




      1528






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          If $m = 0$ the implication is obvious


          If $m ne 0$

          Then we calculate $gcd(nm,km) = m*gcd(n,k) = m$ becquse $gcd(n,k) = 1$

          We know thqt $k|nm$ and $k|km$ thus $k|gcd(nm,km)$

          And $gcd(mn,mk) = m$
          $$implies k|m$$






          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%2f3007576%2fshow-that-forall-n-m-k-in-mathbbnknm-and-gcdn-k-1-rightarrow-km%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








            up vote
            2
            down vote



            accepted










            If $m = 0$ the implication is obvious


            If $m ne 0$

            Then we calculate $gcd(nm,km) = m*gcd(n,k) = m$ becquse $gcd(n,k) = 1$

            We know thqt $k|nm$ and $k|km$ thus $k|gcd(nm,km)$

            And $gcd(mn,mk) = m$
            $$implies k|m$$






            share|cite|improve this answer

























              up vote
              2
              down vote



              accepted










              If $m = 0$ the implication is obvious


              If $m ne 0$

              Then we calculate $gcd(nm,km) = m*gcd(n,k) = m$ becquse $gcd(n,k) = 1$

              We know thqt $k|nm$ and $k|km$ thus $k|gcd(nm,km)$

              And $gcd(mn,mk) = m$
              $$implies k|m$$






              share|cite|improve this answer























                up vote
                2
                down vote



                accepted







                up vote
                2
                down vote



                accepted






                If $m = 0$ the implication is obvious


                If $m ne 0$

                Then we calculate $gcd(nm,km) = m*gcd(n,k) = m$ becquse $gcd(n,k) = 1$

                We know thqt $k|nm$ and $k|km$ thus $k|gcd(nm,km)$

                And $gcd(mn,mk) = m$
                $$implies k|m$$






                share|cite|improve this answer












                If $m = 0$ the implication is obvious


                If $m ne 0$

                Then we calculate $gcd(nm,km) = m*gcd(n,k) = m$ becquse $gcd(n,k) = 1$

                We know thqt $k|nm$ and $k|km$ thus $k|gcd(nm,km)$

                And $gcd(mn,mk) = m$
                $$implies k|m$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 21 at 12:39









                TheD0ubleT

                37718




                37718






























                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2f3007576%2fshow-that-forall-n-m-k-in-mathbbnknm-and-gcdn-k-1-rightarrow-km%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

                    Ellipse (mathématiques)

                    Quarter-circle Tiles

                    Mont Emei