Proof that $5$ is a quadratic residue $(mod p)$ with $p$ odd prime iif $p equiv pm 1 mod 10$












3














Here I present the following proof in order to receive corrections or any kind of suggestion to improve my handling/knowledge of modular arithmetic:




Prove that $5$ is a quadratic residue $(mod p)$ with $p$ odd prime
iif $p equiv pm 1 mod 10$ ; prove also that $5$ is NOT a quadratic residue $(mod p)$
iif $p equiv pm 3 mod 10$.




Dim:



To check if $5$ is a quadratic residue $(mod p)$ I write the equivalent Legendre symbol with the condition:



$(5/p) = 1$



So I have for quadratic reciprocity $(5/p) = (p/5)(-1)^{{(p-1)(5-1)}over 4}=(p/5)(-1)^{(p-1)}$



$bullet$ The exponent $(p-1)$ must be $(mod2)$



$bullet$ $(p/5)$ means to find $p$ : $p(mod5)$ $rightarrow$ the choices are $1,3(mod5)$ because $p$ is prime



The moduli are coprime $(2,5)=1$ so I can study for the two final cases $(mod5times 2)=(mod10)$



Case $1(mod10)$:



Here $(1/5)=1$ and for the exponent $p=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=1$ for $p=1(mod10)$ but also for $p=-1(mod10)$



Case $3(mod10)$:



Here $(3/5)=-1$ because it's not a quadratic residue, and for the exponent $p=3(mod2)=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=(-1)(1)=-1$ for $p=3(mod10)$ but also for $p=-3(mod10)$



$Box$



I appreciate any kind of critics and corrections.



Thank you






elementary-number-theory modular-arithmetic legendre-symbol







share|cite|improve this question




















  • 1




    There are more cases. A prime can be $2$ or $4 pmod{5}.$.
    – B. Goddard
    Nov 30 '18 at 12:42










  • I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
    – Alessar
    Nov 30 '18 at 13:08






  • 1




    Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
    – B. Goddard
    Nov 30 '18 at 13:31










  • Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
    – Alessar
    Dec 1 '18 at 11:28
















3














Here I present the following proof in order to receive corrections or any kind of suggestion to improve my handling/knowledge of modular arithmetic:




Prove that $5$ is a quadratic residue $(mod p)$ with $p$ odd prime
iif $p equiv pm 1 mod 10$ ; prove also that $5$ is NOT a quadratic residue $(mod p)$
iif $p equiv pm 3 mod 10$.




Dim:



To check if $5$ is a quadratic residue $(mod p)$ I write the equivalent Legendre symbol with the condition:



$(5/p) = 1$



So I have for quadratic reciprocity $(5/p) = (p/5)(-1)^{{(p-1)(5-1)}over 4}=(p/5)(-1)^{(p-1)}$



$bullet$ The exponent $(p-1)$ must be $(mod2)$



$bullet$ $(p/5)$ means to find $p$ : $p(mod5)$ $rightarrow$ the choices are $1,3(mod5)$ because $p$ is prime



The moduli are coprime $(2,5)=1$ so I can study for the two final cases $(mod5times 2)=(mod10)$



Case $1(mod10)$:



Here $(1/5)=1$ and for the exponent $p=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=1$ for $p=1(mod10)$ but also for $p=-1(mod10)$



Case $3(mod10)$:



Here $(3/5)=-1$ because it's not a quadratic residue, and for the exponent $p=3(mod2)=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=(-1)(1)=-1$ for $p=3(mod10)$ but also for $p=-3(mod10)$



$Box$



I appreciate any kind of critics and corrections.



Thank you






elementary-number-theory modular-arithmetic legendre-symbol







share|cite|improve this question




















  • 1




    There are more cases. A prime can be $2$ or $4 pmod{5}.$.
    – B. Goddard
    Nov 30 '18 at 12:42










  • I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
    – Alessar
    Nov 30 '18 at 13:08






  • 1




    Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
    – B. Goddard
    Nov 30 '18 at 13:31










  • Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
    – Alessar
    Dec 1 '18 at 11:28














3












3








3







Here I present the following proof in order to receive corrections or any kind of suggestion to improve my handling/knowledge of modular arithmetic:




Prove that $5$ is a quadratic residue $(mod p)$ with $p$ odd prime
iif $p equiv pm 1 mod 10$ ; prove also that $5$ is NOT a quadratic residue $(mod p)$
iif $p equiv pm 3 mod 10$.




Dim:



To check if $5$ is a quadratic residue $(mod p)$ I write the equivalent Legendre symbol with the condition:



$(5/p) = 1$



So I have for quadratic reciprocity $(5/p) = (p/5)(-1)^{{(p-1)(5-1)}over 4}=(p/5)(-1)^{(p-1)}$



$bullet$ The exponent $(p-1)$ must be $(mod2)$



$bullet$ $(p/5)$ means to find $p$ : $p(mod5)$ $rightarrow$ the choices are $1,3(mod5)$ because $p$ is prime



The moduli are coprime $(2,5)=1$ so I can study for the two final cases $(mod5times 2)=(mod10)$



Case $1(mod10)$:



Here $(1/5)=1$ and for the exponent $p=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=1$ for $p=1(mod10)$ but also for $p=-1(mod10)$



Case $3(mod10)$:



Here $(3/5)=-1$ because it's not a quadratic residue, and for the exponent $p=3(mod2)=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=(-1)(1)=-1$ for $p=3(mod10)$ but also for $p=-3(mod10)$



$Box$



I appreciate any kind of critics and corrections.



Thank you






elementary-number-theory modular-arithmetic legendre-symbol







share|cite|improve this question















Here I present the following proof in order to receive corrections or any kind of suggestion to improve my handling/knowledge of modular arithmetic:




Prove that $5$ is a quadratic residue $(mod p)$ with $p$ odd prime
iif $p equiv pm 1 mod 10$ ; prove also that $5$ is NOT a quadratic residue $(mod p)$
iif $p equiv pm 3 mod 10$.




Dim:



To check if $5$ is a quadratic residue $(mod p)$ I write the equivalent Legendre symbol with the condition:



$(5/p) = 1$



So I have for quadratic reciprocity $(5/p) = (p/5)(-1)^{{(p-1)(5-1)}over 4}=(p/5)(-1)^{(p-1)}$



$bullet$ The exponent $(p-1)$ must be $(mod2)$



$bullet$ $(p/5)$ means to find $p$ : $p(mod5)$ $rightarrow$ the choices are $1,3(mod5)$ because $p$ is prime



The moduli are coprime $(2,5)=1$ so I can study for the two final cases $(mod5times 2)=(mod10)$



Case $1(mod10)$:



Here $(1/5)=1$ and for the exponent $p=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=1$ for $p=1(mod10)$ but also for $p=-1(mod10)$



Case $3(mod10)$:



Here $(3/5)=-1$ because it's not a quadratic residue, and for the exponent $p=3(mod2)=1(mod2)$ so the exponent $(p-1)$ must be even. So $(5/p)=(-1)(1)=-1$ for $p=3(mod10)$ but also for $p=-3(mod10)$



$Box$



I appreciate any kind of critics and corrections.



Thank you






elementary-number-theory modular-arithmetic legendre-symbol




elementary-number-theory modular-arithmetic legendre-symbol






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 '18 at 15:17

























asked Nov 29 '18 at 14:41









Alessar

21113




21113








  • 1




    There are more cases. A prime can be $2$ or $4 pmod{5}.$.
    – B. Goddard
    Nov 30 '18 at 12:42










  • I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
    – Alessar
    Nov 30 '18 at 13:08






  • 1




    Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
    – B. Goddard
    Nov 30 '18 at 13:31










  • Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
    – Alessar
    Dec 1 '18 at 11:28














  • 1




    There are more cases. A prime can be $2$ or $4 pmod{5}.$.
    – B. Goddard
    Nov 30 '18 at 12:42










  • I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
    – Alessar
    Nov 30 '18 at 13:08






  • 1




    Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
    – B. Goddard
    Nov 30 '18 at 13:31










  • Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
    – Alessar
    Dec 1 '18 at 11:28








1




1




There are more cases. A prime can be $2$ or $4 pmod{5}.$.
– B. Goddard
Nov 30 '18 at 12:42




There are more cases. A prime can be $2$ or $4 pmod{5}.$.
– B. Goddard
Nov 30 '18 at 12:42












I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
– Alessar
Nov 30 '18 at 13:08




I've excluded 2 and 4 because p must be prime and odd; is it formally wrong to exclude them in this way a-priori?
– Alessar
Nov 30 '18 at 13:08




1




1




Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
– B. Goddard
Nov 30 '18 at 13:31




Notice that $7 equiv 2 pmod{5}$ and $19equiv 4 pmod{5}$.
– B. Goddard
Nov 30 '18 at 13:31












Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
– Alessar
Dec 1 '18 at 11:28




Thanks for the tip, I'll review the proof with your suggestions, I hope to edit it for the final version
– Alessar
Dec 1 '18 at 11:28










1 Answer
1






active

oldest

votes


















1














See my other post use Gauss lemma to find $(frac{n}{p})$:



$(frac{5}{p}) = 1 iff p equiv pm 1 mod 5$






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',
    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%2f3018706%2fproof-that-5-is-a-quadratic-residue-mod-p-with-p-odd-prime-iif-p-equi%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









    1














    See my other post use Gauss lemma to find $(frac{n}{p})$:



    $(frac{5}{p}) = 1 iff p equiv pm 1 mod 5$






    share|cite|improve this answer


























      1














      See my other post use Gauss lemma to find $(frac{n}{p})$:



      $(frac{5}{p}) = 1 iff p equiv pm 1 mod 5$






      share|cite|improve this answer
























        1












        1








        1






        See my other post use Gauss lemma to find $(frac{n}{p})$:



        $(frac{5}{p}) = 1 iff p equiv pm 1 mod 5$






        share|cite|improve this answer












        See my other post use Gauss lemma to find $(frac{n}{p})$:



        $(frac{5}{p}) = 1 iff p equiv pm 1 mod 5$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered yesterday









        Maestro13

        1,131622




        1,131622






























            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%2f3018706%2fproof-that-5-is-a-quadratic-residue-mod-p-with-p-odd-prime-iif-p-equi%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

            1300-talet

            Image
            Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
            Read more

            1300-talet

            Image
            Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
            Read more

            Display a custom attribute below product name in the front-end Magento 1.9.3.8

            Image
            0 I need to display a custom attribute bellow the product name and I don't know how can I call this attribute. I am editing the file /app/design/frontend/templatemela/MAG100219_1/template/catalog/product/view.phtml But how can I call this attribute in php? I tried calling a string echo with the name I put in the attribute, but it didn't work. Code is as below: <div class="page-title product-title"> <h1><?php echo $_helper->productAttribute($_product, $_product->getName(), 'name') ?></h1> </div> <div class="codigoinmetro"> <h2><?php echo $_helper->productAttribute($_product, $_product->getName(), 'registroinmetro') ?></h2> </div> php attrib...
            Read more