For any prime $p$ not a divisor of $ab$, prove that $ax^2 + by^2 equiv с pmod{p}$ is solvable.












0












$begingroup$


Given any integers $a,b,c$ and any prime $p$ not a divisor of $ab$, prove that $ax^2 + by^2
equiv с pmod{p} $ is solvable.
$p$ does not divide $ab$ implies $p$ does not divide both $a$ and $b$. But from here how can I show that the aforesaid equation is solvable?






elementary-number-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
    $endgroup$
    – Will Jagy
    Nov 24 '18 at 1:28






  • 2




    $begingroup$
    You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
    $endgroup$
    – i707107
    Nov 24 '18 at 2:00
















0












$begingroup$


Given any integers $a,b,c$ and any prime $p$ not a divisor of $ab$, prove that $ax^2 + by^2
equiv с pmod{p} $ is solvable.
$p$ does not divide $ab$ implies $p$ does not divide both $a$ and $b$. But from here how can I show that the aforesaid equation is solvable?






elementary-number-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
    $endgroup$
    – Will Jagy
    Nov 24 '18 at 1:28






  • 2




    $begingroup$
    You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
    $endgroup$
    – i707107
    Nov 24 '18 at 2:00














0












0








0





$begingroup$


Given any integers $a,b,c$ and any prime $p$ not a divisor of $ab$, prove that $ax^2 + by^2
equiv с pmod{p} $ is solvable.
$p$ does not divide $ab$ implies $p$ does not divide both $a$ and $b$. But from here how can I show that the aforesaid equation is solvable?






elementary-number-theory







share|cite|improve this question











$endgroup$




Given any integers $a,b,c$ and any prime $p$ not a divisor of $ab$, prove that $ax^2 + by^2
equiv с pmod{p} $ is solvable.
$p$ does not divide $ab$ implies $p$ does not divide both $a$ and $b$. But from here how can I show that the aforesaid equation is solvable?






elementary-number-theory




elementary-number-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 24 '18 at 1:53









Ricardo Largaespada

563213




563213










asked Nov 23 '18 at 23:03









abcdmathabcdmath

317110




317110












  • $begingroup$
    pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
    $endgroup$
    – Will Jagy
    Nov 24 '18 at 1:28






  • 2




    $begingroup$
    You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
    $endgroup$
    – i707107
    Nov 24 '18 at 2:00


















  • $begingroup$
    pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
    $endgroup$
    – Will Jagy
    Nov 24 '18 at 1:28






  • 2




    $begingroup$
    You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
    $endgroup$
    – i707107
    Nov 24 '18 at 2:00
















$begingroup$
pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
$endgroup$
– Will Jagy
Nov 24 '18 at 1:28




$begingroup$
pigeonhole principle: there are, including $0,$ exactly $frac{p+1}{2}$ distinct values of $t^2 pmod p ; $ ( this is for odd prime $p$ ). There are $frac{p+1}{2}$ distinct values of $a x^2 pmod p ; $ and $frac{p+1}{2}$ distinct values of $c-b y^2 pmod p , ; $ so there is an overlap.
$endgroup$
– Will Jagy
Nov 24 '18 at 1:28




2




2




$begingroup$
You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
$endgroup$
– i707107
Nov 24 '18 at 2:00




$begingroup$
You can apply the method in one of my answer, and obtain a formula for the number of solutions to your equation: math.stackexchange.com/questions/398200/…
$endgroup$
– i707107
Nov 24 '18 at 2:00










1 Answer
1






active

oldest

votes


















0












$begingroup$

I might be over simplifying your problem a bit. Let $x,y in mathbb{Z}$. Therefore $x^{2}$ and $y^{2}$ is equal to some integer $q_{1}$ and $q_{2}$ respectively. This is due to the property of multiplicative closure of integers. The left hand side of the equation can now be rewritten as $aq_{1}+bq_{2}$. Once again we can say that $aq_{1}$ is some integer due to integer closure, and $bq_{2}$ is, likewise, an integer by the same argument. By integer closure under addition the two integer products can be rewritten as a single integer called $m$.



Now we can rewrite the equation as follows: $m=c mod(p)$. Which states that there is an integer $m$ that can be rewritten as a distinct congruence class $c$. This can also be rewritten as $m=pq_{3}+c$, for $c<p$ and $q_{3}in mathbb{Z}$



I hope this helps some. Sorry if it was a bit long, I am not sure what direction you wanted to go in.






share|cite|improve this answer









$endgroup$













    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%2f3010949%2ffor-any-prime-p-not-a-divisor-of-ab-prove-that-ax2-by2-equiv-%25d1%2581-pmod%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









    0












    $begingroup$

    I might be over simplifying your problem a bit. Let $x,y in mathbb{Z}$. Therefore $x^{2}$ and $y^{2}$ is equal to some integer $q_{1}$ and $q_{2}$ respectively. This is due to the property of multiplicative closure of integers. The left hand side of the equation can now be rewritten as $aq_{1}+bq_{2}$. Once again we can say that $aq_{1}$ is some integer due to integer closure, and $bq_{2}$ is, likewise, an integer by the same argument. By integer closure under addition the two integer products can be rewritten as a single integer called $m$.



    Now we can rewrite the equation as follows: $m=c mod(p)$. Which states that there is an integer $m$ that can be rewritten as a distinct congruence class $c$. This can also be rewritten as $m=pq_{3}+c$, for $c<p$ and $q_{3}in mathbb{Z}$



    I hope this helps some. Sorry if it was a bit long, I am not sure what direction you wanted to go in.






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      I might be over simplifying your problem a bit. Let $x,y in mathbb{Z}$. Therefore $x^{2}$ and $y^{2}$ is equal to some integer $q_{1}$ and $q_{2}$ respectively. This is due to the property of multiplicative closure of integers. The left hand side of the equation can now be rewritten as $aq_{1}+bq_{2}$. Once again we can say that $aq_{1}$ is some integer due to integer closure, and $bq_{2}$ is, likewise, an integer by the same argument. By integer closure under addition the two integer products can be rewritten as a single integer called $m$.



      Now we can rewrite the equation as follows: $m=c mod(p)$. Which states that there is an integer $m$ that can be rewritten as a distinct congruence class $c$. This can also be rewritten as $m=pq_{3}+c$, for $c<p$ and $q_{3}in mathbb{Z}$



      I hope this helps some. Sorry if it was a bit long, I am not sure what direction you wanted to go in.






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        I might be over simplifying your problem a bit. Let $x,y in mathbb{Z}$. Therefore $x^{2}$ and $y^{2}$ is equal to some integer $q_{1}$ and $q_{2}$ respectively. This is due to the property of multiplicative closure of integers. The left hand side of the equation can now be rewritten as $aq_{1}+bq_{2}$. Once again we can say that $aq_{1}$ is some integer due to integer closure, and $bq_{2}$ is, likewise, an integer by the same argument. By integer closure under addition the two integer products can be rewritten as a single integer called $m$.



        Now we can rewrite the equation as follows: $m=c mod(p)$. Which states that there is an integer $m$ that can be rewritten as a distinct congruence class $c$. This can also be rewritten as $m=pq_{3}+c$, for $c<p$ and $q_{3}in mathbb{Z}$



        I hope this helps some. Sorry if it was a bit long, I am not sure what direction you wanted to go in.






        share|cite|improve this answer









        $endgroup$



        I might be over simplifying your problem a bit. Let $x,y in mathbb{Z}$. Therefore $x^{2}$ and $y^{2}$ is equal to some integer $q_{1}$ and $q_{2}$ respectively. This is due to the property of multiplicative closure of integers. The left hand side of the equation can now be rewritten as $aq_{1}+bq_{2}$. Once again we can say that $aq_{1}$ is some integer due to integer closure, and $bq_{2}$ is, likewise, an integer by the same argument. By integer closure under addition the two integer products can be rewritten as a single integer called $m$.



        Now we can rewrite the equation as follows: $m=c mod(p)$. Which states that there is an integer $m$ that can be rewritten as a distinct congruence class $c$. This can also be rewritten as $m=pq_{3}+c$, for $c<p$ and $q_{3}in mathbb{Z}$



        I hope this helps some. Sorry if it was a bit long, I am not sure what direction you wanted to go in.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 24 '18 at 3:35









        multicuspmulticusp

        211




        211






























            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%2f3010949%2ffor-any-prime-p-not-a-divisor-of-ab-prove-that-ax2-by2-equiv-%25d1%2581-pmod%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 to change which sound is reproduced for terminal bell?

            Image
            3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question
            Read more

            Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

            Image
            up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx
            Read more

            Can I use Tabulator js library in my java Spring + Thymeleaf project?

            Image
            0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"
            Read more