If $p=a^2+b^2$ prove these consequences about $big(!frac{a}{p}!big)$












5














Suppose odd prime $p=a^2+b^2$, and $a$ is odd and $b$ is even. Prove that if $bequiv2pmod4$, then $left(dfrac bpright)=-1$ and if $bequiv0pmod4$, then $left(dfrac bpright)=1$.



What I have got is that $pequiv 1 pmod4$. I have tried factoring $b$ and splitting up the Legendre symbols. However, I am not sure this gets anywhere because you cannot say much about those. I have also observed that $b equiv 0 pmod 4$ when $pequiv 1 pmod 8$ and $b equiv 2 pmod 4$ when $pequiv 5 pmod 8$ if that helps.










share|cite|improve this question
























  • @twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
    – reuns
    Dec 1 '18 at 6:27










  • @reuns is right, my proposed solution has some errors. I deleted them.
    – twnly
    Dec 1 '18 at 6:27












  • is there some reason to expect there is no much simpler solution ?
    – reuns
    Dec 1 '18 at 6:31
















5














Suppose odd prime $p=a^2+b^2$, and $a$ is odd and $b$ is even. Prove that if $bequiv2pmod4$, then $left(dfrac bpright)=-1$ and if $bequiv0pmod4$, then $left(dfrac bpright)=1$.



What I have got is that $pequiv 1 pmod4$. I have tried factoring $b$ and splitting up the Legendre symbols. However, I am not sure this gets anywhere because you cannot say much about those. I have also observed that $b equiv 0 pmod 4$ when $pequiv 1 pmod 8$ and $b equiv 2 pmod 4$ when $pequiv 5 pmod 8$ if that helps.










share|cite|improve this question
























  • @twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
    – reuns
    Dec 1 '18 at 6:27










  • @reuns is right, my proposed solution has some errors. I deleted them.
    – twnly
    Dec 1 '18 at 6:27












  • is there some reason to expect there is no much simpler solution ?
    – reuns
    Dec 1 '18 at 6:31














5












5








5







Suppose odd prime $p=a^2+b^2$, and $a$ is odd and $b$ is even. Prove that if $bequiv2pmod4$, then $left(dfrac bpright)=-1$ and if $bequiv0pmod4$, then $left(dfrac bpright)=1$.



What I have got is that $pequiv 1 pmod4$. I have tried factoring $b$ and splitting up the Legendre symbols. However, I am not sure this gets anywhere because you cannot say much about those. I have also observed that $b equiv 0 pmod 4$ when $pequiv 1 pmod 8$ and $b equiv 2 pmod 4$ when $pequiv 5 pmod 8$ if that helps.










share|cite|improve this question















Suppose odd prime $p=a^2+b^2$, and $a$ is odd and $b$ is even. Prove that if $bequiv2pmod4$, then $left(dfrac bpright)=-1$ and if $bequiv0pmod4$, then $left(dfrac bpright)=1$.



What I have got is that $pequiv 1 pmod4$. I have tried factoring $b$ and splitting up the Legendre symbols. However, I am not sure this gets anywhere because you cannot say much about those. I have also observed that $b equiv 0 pmod 4$ when $pequiv 1 pmod 8$ and $b equiv 2 pmod 4$ when $pequiv 5 pmod 8$ if that helps.







number-theory prime-numbers legendre-symbol






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 1 '18 at 6:47









Henning Makholm

239k16303540




239k16303540










asked Dec 1 '18 at 5:07









Brian LiuBrian Liu

513




513












  • @twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
    – reuns
    Dec 1 '18 at 6:27










  • @reuns is right, my proposed solution has some errors. I deleted them.
    – twnly
    Dec 1 '18 at 6:27












  • is there some reason to expect there is no much simpler solution ?
    – reuns
    Dec 1 '18 at 6:31


















  • @twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
    – reuns
    Dec 1 '18 at 6:27










  • @reuns is right, my proposed solution has some errors. I deleted them.
    – twnly
    Dec 1 '18 at 6:27












  • is there some reason to expect there is no much simpler solution ?
    – reuns
    Dec 1 '18 at 6:31
















@twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
– reuns
Dec 1 '18 at 6:27




@twnly so "for each $q | b, p $ is a square $bmod q$, then use quadratic reciprocity on $prod_j (frac{q_j}{p})^{e_j}$
– reuns
Dec 1 '18 at 6:27












@reuns is right, my proposed solution has some errors. I deleted them.
– twnly
Dec 1 '18 at 6:27






@reuns is right, my proposed solution has some errors. I deleted them.
– twnly
Dec 1 '18 at 6:27














is there some reason to expect there is no much simpler solution ?
– reuns
Dec 1 '18 at 6:31




is there some reason to expect there is no much simpler solution ?
– reuns
Dec 1 '18 at 6:31










1 Answer
1






active

oldest

votes


















2














Write $b=2^rc$ with $c$ odd. Then $p=a^2+b^2equiv a^2pmod c$ and so
$left(frac pcright)=1$ (this is a Jacobi symbol). As $pequiv1
pmod 4$
then $left(frac cpright)=1$ (quadratic reciprocity for
Jacobi symbols).



When $pequiv1pmod8$ then $left(frac 2pright)=1$ and so $left(frac bpright)=left(frac 2pright)^rleft(frac cpright)=1$. When $pequiv5pmod8$ then $left(frac 2pright)=-1$ and also
$r=1$. Therefore $left(frac bpright)=left(frac 2pright)left(frac cpright)=-1$.






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%2f3021011%2fif-p-a2b2-prove-these-consequences-about-big-fracap-big%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









    2














    Write $b=2^rc$ with $c$ odd. Then $p=a^2+b^2equiv a^2pmod c$ and so
    $left(frac pcright)=1$ (this is a Jacobi symbol). As $pequiv1
    pmod 4$
    then $left(frac cpright)=1$ (quadratic reciprocity for
    Jacobi symbols).



    When $pequiv1pmod8$ then $left(frac 2pright)=1$ and so $left(frac bpright)=left(frac 2pright)^rleft(frac cpright)=1$. When $pequiv5pmod8$ then $left(frac 2pright)=-1$ and also
    $r=1$. Therefore $left(frac bpright)=left(frac 2pright)left(frac cpright)=-1$.






    share|cite|improve this answer


























      2














      Write $b=2^rc$ with $c$ odd. Then $p=a^2+b^2equiv a^2pmod c$ and so
      $left(frac pcright)=1$ (this is a Jacobi symbol). As $pequiv1
      pmod 4$
      then $left(frac cpright)=1$ (quadratic reciprocity for
      Jacobi symbols).



      When $pequiv1pmod8$ then $left(frac 2pright)=1$ and so $left(frac bpright)=left(frac 2pright)^rleft(frac cpright)=1$. When $pequiv5pmod8$ then $left(frac 2pright)=-1$ and also
      $r=1$. Therefore $left(frac bpright)=left(frac 2pright)left(frac cpright)=-1$.






      share|cite|improve this answer
























        2












        2








        2






        Write $b=2^rc$ with $c$ odd. Then $p=a^2+b^2equiv a^2pmod c$ and so
        $left(frac pcright)=1$ (this is a Jacobi symbol). As $pequiv1
        pmod 4$
        then $left(frac cpright)=1$ (quadratic reciprocity for
        Jacobi symbols).



        When $pequiv1pmod8$ then $left(frac 2pright)=1$ and so $left(frac bpright)=left(frac 2pright)^rleft(frac cpright)=1$. When $pequiv5pmod8$ then $left(frac 2pright)=-1$ and also
        $r=1$. Therefore $left(frac bpright)=left(frac 2pright)left(frac cpright)=-1$.






        share|cite|improve this answer












        Write $b=2^rc$ with $c$ odd. Then $p=a^2+b^2equiv a^2pmod c$ and so
        $left(frac pcright)=1$ (this is a Jacobi symbol). As $pequiv1
        pmod 4$
        then $left(frac cpright)=1$ (quadratic reciprocity for
        Jacobi symbols).



        When $pequiv1pmod8$ then $left(frac 2pright)=1$ and so $left(frac bpright)=left(frac 2pright)^rleft(frac cpright)=1$. When $pequiv5pmod8$ then $left(frac 2pright)=-1$ and also
        $r=1$. Therefore $left(frac bpright)=left(frac 2pright)left(frac cpright)=-1$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 1 '18 at 6:33









        Lord Shark the UnknownLord Shark the Unknown

        102k959132




        102k959132






























            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%2f3021011%2fif-p-a2b2-prove-these-consequences-about-big-fracap-big%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

            How do I know what Microsoft account the skydrive app is syncing to?

            When does type information flow backwards in C++?

            Grease: Live!