About the equation $x^2+y^2+z^2+2t^2=n$












2












$begingroup$


The question



The final goal (for this stage of my project) is to get an explicit form for $phi(n)$. This last one is the number of integer solutions to $x^2+y^2+z^2+2t^2=n$. You may find this $phi(n)$ on OEIS or you can find the first several numbers by pasting the following code into something like mathematica:



CoefficientList[(1 + 2 Sum[q^(2(j)^2), {j, 10}] ) *(1 + 2 Sum[q^((j)^2), {j, 10}] )^3 , q]



The question is what's an explicit form for $phi(n)?$




Exposition



I would like to get an explicit formula for $phi(n)$. Let me tell you what I know so far. It looks like $phi(n)$ is well-behaved on odd $n$ and on powers of $2$.



$chi(x)= sqrt{2}sin(frac{pi}{4}x+pi)=begin{cases} 1 hspace{1 cm} text{when }x equiv 1,7 mod 8
\ -1 hspace{1 cm} text{when }x equiv 3,5 mod 8 end{cases}$



For $nequiv 1, 7 mod 8$ we have



$$phi(n)=6sum_{d|n} {chi(d)}d$$



For example, $33$ is congruent to $1 mod 8$ and indeed $phi(33)=6times(1-3-11+33)=120$



For $n equiv 3,5 mod 8$ we have



$$phi(n)=-10sum_{d|n} {chi(d)}d$$



For powers of $2$ we have $phi(2^alpha)=2^{alpha+3}-2$



I am using as a type of template here Joseph Liouville's Sur La Forme $x^2+y^2+z^2+3t^2$ and Sur La Forme $x^2+y^2+z^2+5t^2$. I am not able to complete the characterization and I am not $100 %$ sure that Liouville does this for the forms above either(though I suspect he does) because I don't speak/read French very well (though math is math and this I can read). I can't find anything Liouville wrote on $x^2+y^2+z^2+2t^2$. If anyone knows that he surely did and can point me to the right spot I would appreciate it. Also if this is in Grosswald's text (which I don't own) I would definitely reconsider purchasing it. It's not clear to me from the TOC whether this is the right place to look. Also (and I sincerely doubt this one)... you know if Liouville is one of these mathematicians where everything has already been translated and I can find it English that would be amazing.



How do I finish the job and complete this characterization?



Motivations!
What I think would be very cool would be to argue that $ sum_{n=1}^R phi(n)$ is approximately the interior volume of $x^2+y^2+z^2+2t^2=R$ and thereby win a series of rational numbers that converges to the volume in the interior of $x^2+y^2+z^2+2t^2=1$ (which I would guess should be $frac{pi^2}{2sqrt{2}}$? Correct me if I am wrong but this is kind of a minor detail.) I have explained that technique (perhaps ad nauseam) over here.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    @dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:29








  • 2




    $begingroup$
    Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
    $endgroup$
    – Gerry Myerson
    Dec 29 '18 at 14:40






  • 1




    $begingroup$
    @GerryMyerson. Yay! Thanks so much.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:41












  • $begingroup$
    @Mason, you are right, I misunderstand your phrase.:)
    $endgroup$
    – dmtri
    Dec 29 '18 at 15:16






  • 1




    $begingroup$
    @GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
    $endgroup$
    – Mason
    Dec 30 '18 at 3:32


















2












$begingroup$


The question



The final goal (for this stage of my project) is to get an explicit form for $phi(n)$. This last one is the number of integer solutions to $x^2+y^2+z^2+2t^2=n$. You may find this $phi(n)$ on OEIS or you can find the first several numbers by pasting the following code into something like mathematica:



CoefficientList[(1 + 2 Sum[q^(2(j)^2), {j, 10}] ) *(1 + 2 Sum[q^((j)^2), {j, 10}] )^3 , q]



The question is what's an explicit form for $phi(n)?$




Exposition



I would like to get an explicit formula for $phi(n)$. Let me tell you what I know so far. It looks like $phi(n)$ is well-behaved on odd $n$ and on powers of $2$.



$chi(x)= sqrt{2}sin(frac{pi}{4}x+pi)=begin{cases} 1 hspace{1 cm} text{when }x equiv 1,7 mod 8
\ -1 hspace{1 cm} text{when }x equiv 3,5 mod 8 end{cases}$



For $nequiv 1, 7 mod 8$ we have



$$phi(n)=6sum_{d|n} {chi(d)}d$$



For example, $33$ is congruent to $1 mod 8$ and indeed $phi(33)=6times(1-3-11+33)=120$



For $n equiv 3,5 mod 8$ we have



$$phi(n)=-10sum_{d|n} {chi(d)}d$$



For powers of $2$ we have $phi(2^alpha)=2^{alpha+3}-2$



I am using as a type of template here Joseph Liouville's Sur La Forme $x^2+y^2+z^2+3t^2$ and Sur La Forme $x^2+y^2+z^2+5t^2$. I am not able to complete the characterization and I am not $100 %$ sure that Liouville does this for the forms above either(though I suspect he does) because I don't speak/read French very well (though math is math and this I can read). I can't find anything Liouville wrote on $x^2+y^2+z^2+2t^2$. If anyone knows that he surely did and can point me to the right spot I would appreciate it. Also if this is in Grosswald's text (which I don't own) I would definitely reconsider purchasing it. It's not clear to me from the TOC whether this is the right place to look. Also (and I sincerely doubt this one)... you know if Liouville is one of these mathematicians where everything has already been translated and I can find it English that would be amazing.



How do I finish the job and complete this characterization?



Motivations!
What I think would be very cool would be to argue that $ sum_{n=1}^R phi(n)$ is approximately the interior volume of $x^2+y^2+z^2+2t^2=R$ and thereby win a series of rational numbers that converges to the volume in the interior of $x^2+y^2+z^2+2t^2=1$ (which I would guess should be $frac{pi^2}{2sqrt{2}}$? Correct me if I am wrong but this is kind of a minor detail.) I have explained that technique (perhaps ad nauseam) over here.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    @dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:29








  • 2




    $begingroup$
    Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
    $endgroup$
    – Gerry Myerson
    Dec 29 '18 at 14:40






  • 1




    $begingroup$
    @GerryMyerson. Yay! Thanks so much.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:41












  • $begingroup$
    @Mason, you are right, I misunderstand your phrase.:)
    $endgroup$
    – dmtri
    Dec 29 '18 at 15:16






  • 1




    $begingroup$
    @GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
    $endgroup$
    – Mason
    Dec 30 '18 at 3:32
















2












2








2





$begingroup$


The question



The final goal (for this stage of my project) is to get an explicit form for $phi(n)$. This last one is the number of integer solutions to $x^2+y^2+z^2+2t^2=n$. You may find this $phi(n)$ on OEIS or you can find the first several numbers by pasting the following code into something like mathematica:



CoefficientList[(1 + 2 Sum[q^(2(j)^2), {j, 10}] ) *(1 + 2 Sum[q^((j)^2), {j, 10}] )^3 , q]



The question is what's an explicit form for $phi(n)?$




Exposition



I would like to get an explicit formula for $phi(n)$. Let me tell you what I know so far. It looks like $phi(n)$ is well-behaved on odd $n$ and on powers of $2$.



$chi(x)= sqrt{2}sin(frac{pi}{4}x+pi)=begin{cases} 1 hspace{1 cm} text{when }x equiv 1,7 mod 8
\ -1 hspace{1 cm} text{when }x equiv 3,5 mod 8 end{cases}$



For $nequiv 1, 7 mod 8$ we have



$$phi(n)=6sum_{d|n} {chi(d)}d$$



For example, $33$ is congruent to $1 mod 8$ and indeed $phi(33)=6times(1-3-11+33)=120$



For $n equiv 3,5 mod 8$ we have



$$phi(n)=-10sum_{d|n} {chi(d)}d$$



For powers of $2$ we have $phi(2^alpha)=2^{alpha+3}-2$



I am using as a type of template here Joseph Liouville's Sur La Forme $x^2+y^2+z^2+3t^2$ and Sur La Forme $x^2+y^2+z^2+5t^2$. I am not able to complete the characterization and I am not $100 %$ sure that Liouville does this for the forms above either(though I suspect he does) because I don't speak/read French very well (though math is math and this I can read). I can't find anything Liouville wrote on $x^2+y^2+z^2+2t^2$. If anyone knows that he surely did and can point me to the right spot I would appreciate it. Also if this is in Grosswald's text (which I don't own) I would definitely reconsider purchasing it. It's not clear to me from the TOC whether this is the right place to look. Also (and I sincerely doubt this one)... you know if Liouville is one of these mathematicians where everything has already been translated and I can find it English that would be amazing.



How do I finish the job and complete this characterization?



Motivations!
What I think would be very cool would be to argue that $ sum_{n=1}^R phi(n)$ is approximately the interior volume of $x^2+y^2+z^2+2t^2=R$ and thereby win a series of rational numbers that converges to the volume in the interior of $x^2+y^2+z^2+2t^2=1$ (which I would guess should be $frac{pi^2}{2sqrt{2}}$? Correct me if I am wrong but this is kind of a minor detail.) I have explained that technique (perhaps ad nauseam) over here.










share|cite|improve this question











$endgroup$




The question



The final goal (for this stage of my project) is to get an explicit form for $phi(n)$. This last one is the number of integer solutions to $x^2+y^2+z^2+2t^2=n$. You may find this $phi(n)$ on OEIS or you can find the first several numbers by pasting the following code into something like mathematica:



CoefficientList[(1 + 2 Sum[q^(2(j)^2), {j, 10}] ) *(1 + 2 Sum[q^((j)^2), {j, 10}] )^3 , q]



The question is what's an explicit form for $phi(n)?$




Exposition



I would like to get an explicit formula for $phi(n)$. Let me tell you what I know so far. It looks like $phi(n)$ is well-behaved on odd $n$ and on powers of $2$.



$chi(x)= sqrt{2}sin(frac{pi}{4}x+pi)=begin{cases} 1 hspace{1 cm} text{when }x equiv 1,7 mod 8
\ -1 hspace{1 cm} text{when }x equiv 3,5 mod 8 end{cases}$



For $nequiv 1, 7 mod 8$ we have



$$phi(n)=6sum_{d|n} {chi(d)}d$$



For example, $33$ is congruent to $1 mod 8$ and indeed $phi(33)=6times(1-3-11+33)=120$



For $n equiv 3,5 mod 8$ we have



$$phi(n)=-10sum_{d|n} {chi(d)}d$$



For powers of $2$ we have $phi(2^alpha)=2^{alpha+3}-2$



I am using as a type of template here Joseph Liouville's Sur La Forme $x^2+y^2+z^2+3t^2$ and Sur La Forme $x^2+y^2+z^2+5t^2$. I am not able to complete the characterization and I am not $100 %$ sure that Liouville does this for the forms above either(though I suspect he does) because I don't speak/read French very well (though math is math and this I can read). I can't find anything Liouville wrote on $x^2+y^2+z^2+2t^2$. If anyone knows that he surely did and can point me to the right spot I would appreciate it. Also if this is in Grosswald's text (which I don't own) I would definitely reconsider purchasing it. It's not clear to me from the TOC whether this is the right place to look. Also (and I sincerely doubt this one)... you know if Liouville is one of these mathematicians where everything has already been translated and I can find it English that would be amazing.



How do I finish the job and complete this characterization?



Motivations!
What I think would be very cool would be to argue that $ sum_{n=1}^R phi(n)$ is approximately the interior volume of $x^2+y^2+z^2+2t^2=R$ and thereby win a series of rational numbers that converges to the volume in the interior of $x^2+y^2+z^2+2t^2=1$ (which I would guess should be $frac{pi^2}{2sqrt{2}}$? Correct me if I am wrong but this is kind of a minor detail.) I have explained that technique (perhaps ad nauseam) over here.







asymptotics diophantine-equations divisor-sum translation-request






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 29 '18 at 14:33







Mason

















asked Dec 29 '18 at 12:46









MasonMason

1,7951630




1,7951630








  • 1




    $begingroup$
    @dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:29








  • 2




    $begingroup$
    Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
    $endgroup$
    – Gerry Myerson
    Dec 29 '18 at 14:40






  • 1




    $begingroup$
    @GerryMyerson. Yay! Thanks so much.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:41












  • $begingroup$
    @Mason, you are right, I misunderstand your phrase.:)
    $endgroup$
    – dmtri
    Dec 29 '18 at 15:16






  • 1




    $begingroup$
    @GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
    $endgroup$
    – Mason
    Dec 30 '18 at 3:32
















  • 1




    $begingroup$
    @dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:29








  • 2




    $begingroup$
    Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
    $endgroup$
    – Gerry Myerson
    Dec 29 '18 at 14:40






  • 1




    $begingroup$
    @GerryMyerson. Yay! Thanks so much.
    $endgroup$
    – Mason
    Dec 29 '18 at 14:41












  • $begingroup$
    @Mason, you are right, I misunderstand your phrase.:)
    $endgroup$
    – dmtri
    Dec 29 '18 at 15:16






  • 1




    $begingroup$
    @GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
    $endgroup$
    – Mason
    Dec 30 '18 at 3:32










1




1




$begingroup$
@dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
$endgroup$
– Mason
Dec 29 '18 at 14:29






$begingroup$
@dmtri. I prefer something with mathematica over like mathematica. Can you explain why "like" is superior? Maybe: "by running the following code in mathematica:" is better? Otherwise, I really appreciate the edit. Thank you.
$endgroup$
– Mason
Dec 29 '18 at 14:29






2




2




$begingroup$
Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
$endgroup$
– Gerry Myerson
Dec 29 '18 at 14:40




$begingroup$
Ken Williams, Number Theory in the Spirit of Liouville, cambridge.org/core/books/… has a chapter on your equation.
$endgroup$
– Gerry Myerson
Dec 29 '18 at 14:40




1




1




$begingroup$
@GerryMyerson. Yay! Thanks so much.
$endgroup$
– Mason
Dec 29 '18 at 14:41






$begingroup$
@GerryMyerson. Yay! Thanks so much.
$endgroup$
– Mason
Dec 29 '18 at 14:41














$begingroup$
@Mason, you are right, I misunderstand your phrase.:)
$endgroup$
– dmtri
Dec 29 '18 at 15:16




$begingroup$
@Mason, you are right, I misunderstand your phrase.:)
$endgroup$
– dmtri
Dec 29 '18 at 15:16




1




1




$begingroup$
@GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
$endgroup$
– Mason
Dec 30 '18 at 3:32






$begingroup$
@GerryMyerson. Absolutely. I am trying my best to wiggle through the paywalls. I am cheap/poor so if I can get this information by visiting UMD which isn't too far and not paying $60 I will but anyway: I appreciate the lead. I probably won't get back to this project for another couple weeks. Winter Break allows for some play time but this is not a small project for me and I want to do good time-budgeting.
$endgroup$
– Mason
Dec 30 '18 at 3:32












1 Answer
1






active

oldest

votes


















0












$begingroup$

Letting $phi(n)$ denote the number of integer solutions to $x^2+y^2+z^2+2t^2$, with $n=2^{alpha}N$ where $N$ is odd we have
$$phi(n)=2bigg( 2^{alpha+2}bigg( frac{ 8}{N} bigg)-1 bigg) sum_{d|N} bigg( frac{ 8}{d} bigg)d$$



Where above appears Legendre-Jacobi-Kronecker symbols. In particular,



$$bigg( frac{8}{x} bigg) = cases{ hspace{0.32 cm} 0 text{ if } x equiv 0 hspace{.44 cm} (mod 2) \hspace{0.32 cm} 1 text{ if } x equiv 1,7 (mod 8) \ -1 text{ if } x equiv 3,5 (mod 8)}$$



An elementary proof can be found here.



So the next step in this process is to look for the asymptotic behavior of $sum_{n=1}^x phi(n)$ and see whether we can apply something like Abel's Summation here.






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%2f3055815%2fabout-the-equation-x2y2z22t2-n%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$

    Letting $phi(n)$ denote the number of integer solutions to $x^2+y^2+z^2+2t^2$, with $n=2^{alpha}N$ where $N$ is odd we have
    $$phi(n)=2bigg( 2^{alpha+2}bigg( frac{ 8}{N} bigg)-1 bigg) sum_{d|N} bigg( frac{ 8}{d} bigg)d$$



    Where above appears Legendre-Jacobi-Kronecker symbols. In particular,



    $$bigg( frac{8}{x} bigg) = cases{ hspace{0.32 cm} 0 text{ if } x equiv 0 hspace{.44 cm} (mod 2) \hspace{0.32 cm} 1 text{ if } x equiv 1,7 (mod 8) \ -1 text{ if } x equiv 3,5 (mod 8)}$$



    An elementary proof can be found here.



    So the next step in this process is to look for the asymptotic behavior of $sum_{n=1}^x phi(n)$ and see whether we can apply something like Abel's Summation here.






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      Letting $phi(n)$ denote the number of integer solutions to $x^2+y^2+z^2+2t^2$, with $n=2^{alpha}N$ where $N$ is odd we have
      $$phi(n)=2bigg( 2^{alpha+2}bigg( frac{ 8}{N} bigg)-1 bigg) sum_{d|N} bigg( frac{ 8}{d} bigg)d$$



      Where above appears Legendre-Jacobi-Kronecker symbols. In particular,



      $$bigg( frac{8}{x} bigg) = cases{ hspace{0.32 cm} 0 text{ if } x equiv 0 hspace{.44 cm} (mod 2) \hspace{0.32 cm} 1 text{ if } x equiv 1,7 (mod 8) \ -1 text{ if } x equiv 3,5 (mod 8)}$$



      An elementary proof can be found here.



      So the next step in this process is to look for the asymptotic behavior of $sum_{n=1}^x phi(n)$ and see whether we can apply something like Abel's Summation here.






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        Letting $phi(n)$ denote the number of integer solutions to $x^2+y^2+z^2+2t^2$, with $n=2^{alpha}N$ where $N$ is odd we have
        $$phi(n)=2bigg( 2^{alpha+2}bigg( frac{ 8}{N} bigg)-1 bigg) sum_{d|N} bigg( frac{ 8}{d} bigg)d$$



        Where above appears Legendre-Jacobi-Kronecker symbols. In particular,



        $$bigg( frac{8}{x} bigg) = cases{ hspace{0.32 cm} 0 text{ if } x equiv 0 hspace{.44 cm} (mod 2) \hspace{0.32 cm} 1 text{ if } x equiv 1,7 (mod 8) \ -1 text{ if } x equiv 3,5 (mod 8)}$$



        An elementary proof can be found here.



        So the next step in this process is to look for the asymptotic behavior of $sum_{n=1}^x phi(n)$ and see whether we can apply something like Abel's Summation here.






        share|cite|improve this answer











        $endgroup$



        Letting $phi(n)$ denote the number of integer solutions to $x^2+y^2+z^2+2t^2$, with $n=2^{alpha}N$ where $N$ is odd we have
        $$phi(n)=2bigg( 2^{alpha+2}bigg( frac{ 8}{N} bigg)-1 bigg) sum_{d|N} bigg( frac{ 8}{d} bigg)d$$



        Where above appears Legendre-Jacobi-Kronecker symbols. In particular,



        $$bigg( frac{8}{x} bigg) = cases{ hspace{0.32 cm} 0 text{ if } x equiv 0 hspace{.44 cm} (mod 2) \hspace{0.32 cm} 1 text{ if } x equiv 1,7 (mod 8) \ -1 text{ if } x equiv 3,5 (mod 8)}$$



        An elementary proof can be found here.



        So the next step in this process is to look for the asymptotic behavior of $sum_{n=1}^x phi(n)$ and see whether we can apply something like Abel's Summation here.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 9 at 17:35

























        answered Jan 9 at 17:28









        MasonMason

        1,7951630




        1,7951630






























            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%2f3055815%2fabout-the-equation-x2y2z22t2-n%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

            Wiesbaden

            Marschland

            Dieringhausen