If $2$ numbers are co-prime, does it imply that their difference is also prime to those numbers?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
6
down vote

favorite
1












Let $q$ and $p$ be coprime. And without loss of generality, as $p$ and $q$ are interchangeable, let $p>q$, $p=q+d$.



If $p$ and $q$ are coprime, the fraction cannot be simplified. Therefore, we can rewrite $p/q$ as $(q+d)/q$, and we obtain $1+d/q$. As the fraction for $p/q$ cannot be simplified, $d/q$ can also not be simplified, therefore $d$ is also prime to $q$. [We can do same arguement for $p$ too]. Is this correct?







share|cite|improve this question

















  • 1




    Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
    – DanielWainfleet
    Aug 6 at 20:27















up vote
6
down vote

favorite
1












Let $q$ and $p$ be coprime. And without loss of generality, as $p$ and $q$ are interchangeable, let $p>q$, $p=q+d$.



If $p$ and $q$ are coprime, the fraction cannot be simplified. Therefore, we can rewrite $p/q$ as $(q+d)/q$, and we obtain $1+d/q$. As the fraction for $p/q$ cannot be simplified, $d/q$ can also not be simplified, therefore $d$ is also prime to $q$. [We can do same arguement for $p$ too]. Is this correct?







share|cite|improve this question

















  • 1




    Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
    – DanielWainfleet
    Aug 6 at 20:27













up vote
6
down vote

favorite
1









up vote
6
down vote

favorite
1






1





Let $q$ and $p$ be coprime. And without loss of generality, as $p$ and $q$ are interchangeable, let $p>q$, $p=q+d$.



If $p$ and $q$ are coprime, the fraction cannot be simplified. Therefore, we can rewrite $p/q$ as $(q+d)/q$, and we obtain $1+d/q$. As the fraction for $p/q$ cannot be simplified, $d/q$ can also not be simplified, therefore $d$ is also prime to $q$. [We can do same arguement for $p$ too]. Is this correct?







share|cite|improve this question













Let $q$ and $p$ be coprime. And without loss of generality, as $p$ and $q$ are interchangeable, let $p>q$, $p=q+d$.



If $p$ and $q$ are coprime, the fraction cannot be simplified. Therefore, we can rewrite $p/q$ as $(q+d)/q$, and we obtain $1+d/q$. As the fraction for $p/q$ cannot be simplified, $d/q$ can also not be simplified, therefore $d$ is also prime to $q$. [We can do same arguement for $p$ too]. Is this correct?









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Aug 7 at 0:21









Daniel Buck

2,3041623




2,3041623









asked Aug 6 at 18:15









Dean Yang

1115




1115







  • 1




    Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
    – DanielWainfleet
    Aug 6 at 20:27













  • 1




    Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
    – DanielWainfleet
    Aug 6 at 20:27








1




1




Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
– DanielWainfleet
Aug 6 at 20:27





Yes but perhaps you should explain why: If $d/q$ $could $ be simplified to $d'/q'$ with $|q'|<|q|$, then $p/q=(q'+d')/q' $ is a simplification of $p/q$.... In general if $p,q$ are co-prime then $p, pm (pn+q)$ are co-prime for any $nin Bbb Z.$
– DanielWainfleet
Aug 6 at 20:27











2 Answers
2






active

oldest

votes

















up vote
16
down vote













Yes, if $d$ and $q$ had a common factor, it would also be a factor of $d+q=p$. This is the heart of the Euclidean algorithm for greatest common divisor.






share|cite|improve this answer





















  • Alright, thanks :)
    – Dean Yang
    Aug 6 at 18:20

















up vote
4
down vote













Of course it is. If $q$ and $d$ have a common factor $f$:



$q = Qf$

$d = Df$



then



$p = q + d = (Q +D)f$



and more generally



$kqpm md = (kQ pm mD)f$



will have that factor, too.






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: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2874176%2fif-2-numbers-are-co-prime-does-it-imply-that-their-difference-is-also-prime-t%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
    16
    down vote













    Yes, if $d$ and $q$ had a common factor, it would also be a factor of $d+q=p$. This is the heart of the Euclidean algorithm for greatest common divisor.






    share|cite|improve this answer





















    • Alright, thanks :)
      – Dean Yang
      Aug 6 at 18:20














    up vote
    16
    down vote













    Yes, if $d$ and $q$ had a common factor, it would also be a factor of $d+q=p$. This is the heart of the Euclidean algorithm for greatest common divisor.






    share|cite|improve this answer





















    • Alright, thanks :)
      – Dean Yang
      Aug 6 at 18:20












    up vote
    16
    down vote










    up vote
    16
    down vote









    Yes, if $d$ and $q$ had a common factor, it would also be a factor of $d+q=p$. This is the heart of the Euclidean algorithm for greatest common divisor.






    share|cite|improve this answer













    Yes, if $d$ and $q$ had a common factor, it would also be a factor of $d+q=p$. This is the heart of the Euclidean algorithm for greatest common divisor.







    share|cite|improve this answer













    share|cite|improve this answer



    share|cite|improve this answer











    answered Aug 6 at 18:19









    Ross Millikan

    275k21186351




    275k21186351











    • Alright, thanks :)
      – Dean Yang
      Aug 6 at 18:20
















    • Alright, thanks :)
      – Dean Yang
      Aug 6 at 18:20















    Alright, thanks :)
    – Dean Yang
    Aug 6 at 18:20




    Alright, thanks :)
    – Dean Yang
    Aug 6 at 18:20










    up vote
    4
    down vote













    Of course it is. If $q$ and $d$ have a common factor $f$:



    $q = Qf$

    $d = Df$



    then



    $p = q + d = (Q +D)f$



    and more generally



    $kqpm md = (kQ pm mD)f$



    will have that factor, too.






    share|cite|improve this answer



























      up vote
      4
      down vote













      Of course it is. If $q$ and $d$ have a common factor $f$:



      $q = Qf$

      $d = Df$



      then



      $p = q + d = (Q +D)f$



      and more generally



      $kqpm md = (kQ pm mD)f$



      will have that factor, too.






      share|cite|improve this answer

























        up vote
        4
        down vote










        up vote
        4
        down vote









        Of course it is. If $q$ and $d$ have a common factor $f$:



        $q = Qf$

        $d = Df$



        then



        $p = q + d = (Q +D)f$



        and more generally



        $kqpm md = (kQ pm mD)f$



        will have that factor, too.






        share|cite|improve this answer















        Of course it is. If $q$ and $d$ have a common factor $f$:



        $q = Qf$

        $d = Df$



        then



        $p = q + d = (Q +D)f$



        and more generally



        $kqpm md = (kQ pm mD)f$



        will have that factor, too.







        share|cite|improve this answer















        share|cite|improve this answer



        share|cite|improve this answer








        edited Aug 8 at 10:25


























        answered Aug 6 at 18:21









        CiaPan

        9,85311044




        9,85311044






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2874176%2fif-2-numbers-are-co-prime-does-it-imply-that-their-difference-is-also-prime-t%23new-answer', 'question_page');

            );

            Post as a guest













































































            Popular posts from this blog

            Chat program with C++ and SFML

            Function to Return a JSON Like Objects Using VBA Collections and Arrays

            Will my employers contract hold up in court?