Timeline for The Chebotarev Density Theorem and the representation of infinitely many numbers by forms
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2018 at 10:47 | comment | added | Watson | See also "NORM FORMS REPRESENT FEW INTEGERS BUT RELATIVELY MANY PRIMES" by DANIEL GLASSCOCK. | |
| Dec 3, 2018 at 10:45 | comment | added | Watson | Related: mathoverflow.net/questions/28280. The proof using Chebotarev is in Cox's book, theorem 9.12. | |
| Jul 2, 2014 at 3:01 | review | First posts | |||
| Jul 2, 2014 at 4:21 | |||||
| Jun 22, 2014 at 16:24 | comment | added | Will Jagy | @GHfromMO, see mathoverflow.net/questions/144544/… where the 1954 proof by Briggs really is elementary, uses results of Selberg developed for the Prime Number Theorem | |
| Jun 22, 2014 at 11:52 | answer | added | Jeremy Rouse | timeline score: 8 | |
| Jun 22, 2014 at 9:37 | comment | added | Daniel Loughran | I would recommend reading Heath-Brown's article "Primes Represented by $x^3 + 2y^3$" if you have not do so already. I have not gone through enough of the 76 pages to see whether he uses the Chebotarev density theorem, but I would be surprised if he did not. When there are many variables one usually uses the circle method, rather than the Chebotarev density theorem, to show that a homogeneous polynomial represents infinitely many primes. | |
| Jun 22, 2014 at 7:53 | comment | added | GH from MO | Where can we find the elementary proof? | |
| Jun 22, 2014 at 6:19 | history | asked | user50965 | CC BY-SA 3.0 |