Timeline for The number of representations of the positive integer $n$ as $a^{2}+b^{2}+p^{2}c^{2}$
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 10, 2014 at 19:22 | comment | added | Will Jagy | I see. I've seen Bateman, never used it for anything. For the kind of thing I use, the restriction amounts to class number one, meaning $p=3$ only. I have no idea what happens if you completely re-do Bateman's proof for your cases of interest. | |
| Sep 10, 2014 at 19:16 | comment | added | user50965 | Will Jagy, Bateman's formula gives the number of representations of any integer as the sum of three squares. It is not so easy to compute $K(-4n)$ in this formula, but one can use it to make some efficient computations. I ask if there is a similar formula giving the number of representations of an integer as follows $a^{2}+b^{2}+p^{2}c^{2}$? | |
| Sep 10, 2014 at 17:28 | comment | added | Will Jagy | What makes you think there is a formula for the number of representations as the sum of three squares? mathoverflow.net/questions/3596/… | |
| Sep 10, 2014 at 5:33 | history | asked | user50965 | CC BY-SA 3.0 |