Timeline for Primes of the form $(2m+1)^2-2^{2s+1}$
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Oct 15, 2015 at 9:06 | comment | added | few_reps | @GHfromMO ... hmmm yes, from that point of view, my hopes don't seem realistic ... | |
Oct 14, 2015 at 22:22 | comment | added | GH from MO | I think proving this would be a fantastic achievement. Compare it with the $x^2+y^4$ result of Friedlander-Iwaniec, and note that there are much more fourth powers than powers of two. | |
Oct 14, 2015 at 22:20 | history | edited | GH from MO |
edited tags
|
|
Oct 14, 2015 at 22:02 | comment | added | few_reps | @StefanKohl : definitely not ! The point is that these primes furnish interesting real quadratic extensions. | |
Oct 14, 2015 at 21:53 | comment | added | few_reps | @JeppeStigNielsen : Right ... as far as I know, Euler had already asked this very question. | |
Oct 14, 2015 at 20:12 | comment | added | Stefan Kohl♦ | Do you also count negative prime values of your expression $(2m+1)^2 - 2^{2s+1}$? | |
Oct 14, 2015 at 19:19 | comment | added | Jeppe Stig Nielsen | The conjecture that there are infinitely many primes of form $(2m)^2+1$ is still open (and was listed as one of Landau's four problems more than 100 years ago), so maybe this is another indication your question could be hard? | |
Oct 14, 2015 at 16:31 | history | edited | user9072 | CC BY-SA 3.0 |
replaced MathJax used for formatting
|
Oct 14, 2015 at 16:26 | history | asked | few_reps | CC BY-SA 3.0 |