Timeline for Can every integer be written as a sum of squares of primes?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12 at 6:08 | comment | converted from answer | Anant vinayak Tiwari | Yes this is possible atleast for even numbers | |
| Nov 14, 2023 at 17:18 | comment | added | GH from MO | See also my comment below the response of gnasher729. | |
| Nov 14, 2023 at 15:15 | answer | added | gnasher729 | timeline score: 1 | |
| Nov 9, 2023 at 21:06 | comment | added | GH from MO | @TimothyChow Yes. Hua showed the 5 prime square result under this congruence condition. Sorry for being sloppy. | |
| Nov 9, 2023 at 19:30 | comment | added | Timothy Chow | @GHfromMO There's some congruence condition, isn't there? Hua's result (Some results in the additive prime-number theory) is that every sufficiently large integer $n\equiv 5 \pmod{24}$ is the sum of five squares of primes. | |
| Nov 9, 2023 at 17:44 | vote | accept | Sayan Dutta | ||
| Nov 9, 2023 at 14:49 | comment | added | GH from MO | @F2Andy The point is that $k$ is independent of $n$. For example, it is known that every sufficiently large $n$ is a sum of $5$ prime squares. | |
| Nov 9, 2023 at 13:32 | comment | added | F2Andy | Can you use a prime more than once? I guess not, given the equation provided, and if you can it is trivially easy just using 1. And in that case the answer is no because it does not work for n = 2, 3, 6, 7, 8. I guess I am missing something here - I am not a mathematician - and I would be curious to know what. | |
| Nov 9, 2023 at 1:48 | history | became hot network question | |||
| Nov 8, 2023 at 18:08 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
added 38 characters in body
|
| Nov 8, 2023 at 18:00 | history | edited | GH from MO |
edited tags
|
|
| Nov 8, 2023 at 17:59 | answer | added | GH from MO | timeline score: 19 | |
| Nov 8, 2023 at 17:48 | history | asked | Sayan Dutta | CC BY-SA 4.0 |