Proof involving congruence of integers with a biconditional











up vote
0
down vote

favorite












For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6



I think I have one half of the biconditional right but I am very stuck on where how to complete it




If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then



$x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24




using 6k = a I have




-48k -24 = 24 (2k+1) (-1)




So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)



Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6



I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6



    I think I have one half of the biconditional right but I am very stuck on where how to complete it




    If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then



    $x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24




    using 6k = a I have




    -48k -24 = 24 (2k+1) (-1)




    So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)



    Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6



    I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6



      I think I have one half of the biconditional right but I am very stuck on where how to complete it




      If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then



      $x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24




      using 6k = a I have




      -48k -24 = 24 (2k+1) (-1)




      So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)



      Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6



      I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated










      share|cite|improve this question













      For any set S = {a, a+1, ..., a+5} where 6|a, 24|($x^2$ - $y^2$) for distinct odd integer x and y in set S if and only if one of x and y is congruent to 1 modulo 6 and the other is congruent to 5 modulo 6



      I think I have one half of the biconditional right but I am very stuck on where how to complete it




      If one of x and y is congruent to 1 mod 6 and the other to 5 mod 6 then



      $x^2 - y^2$ = $(a+1)^2 - (a+5)^2 = a^2+2a+1 - (a^2 +10a + 25)$ = -8a - 24




      using 6k = a I have




      -48k -24 = 24 (2k+1) (-1)




      So, if one of x and y is congruent to 1 mod6 and the other to 5 mod6, 24|($x^2 - y^2$)



      Next I know I need to show the reverse that if 24|($x^2 - y^2$)then x and y must be congruent to 1 mod 6 and 5 mod 6



      I'm pretty sure I need a few cases but I'm stuck. After getting the first part the second should come to me and its something I should know but I just can't come up with it. Any hints are appreciated







      modular-arithmetic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 18 at 23:29









      T. Joe

      62




      62






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote













          Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$



          Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$



          Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.






          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%2f3004282%2fproof-involving-congruence-of-integers-with-a-biconditional%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
            0
            down vote













            Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$



            Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$



            Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.






            share|cite|improve this answer



























              up vote
              0
              down vote













              Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$



              Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$



              Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.






              share|cite|improve this answer

























                up vote
                0
                down vote










                up vote
                0
                down vote









                Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$



                Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$



                Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.






                share|cite|improve this answer














                Hint $,x,y$ odd $,Rightarrow,bmod 6!: x,y equiv 1,3,5,,$ and the only distinct pair with equal square is $1^2equiv 5^2$



                Remark $ $ Alternatively $bmod 8!: {rm odd}^2equiv {pm1,pm3}^2equiv 1,$ so $,x,y,$ odd $,Rightarrow,x^2!-!y^2equiv 1-1equiv 0,$



                Therefore $,8mid x^2-y^2, $ hence $ 24mid x^2-y^2iff 6mid x^2-y^2, $ which is true as in the hint.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Nov 19 at 0:25

























                answered Nov 18 at 23:41









                Bill Dubuque

                207k29189624




                207k29189624






























                    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%2f3004282%2fproof-involving-congruence-of-integers-with-a-biconditional%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

                    Aardman Animations

                    Are they similar matrix

                    “minimization” problem in Euclidean space related to orthonormal basis