Timeline for Infinitely many primes of the form $2^n+c$ as $n$ varies?
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2021 at 11:45 | comment | added | Max Alekseyev | Another suitable $k$ is 128100173, which is constructed from the smallest known Sierpinki number - see mathoverflow.net/a/337610 | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jan 15, 2017 at 9:21 | history | edited | Kevin Buzzard | CC BY-SA 3.0 |
Fixed a slip in Pomerance's slides
|
| Jan 15, 2017 at 9:15 | comment | added | Kevin Buzzard | Unbelievable: this answer has been here over 6 years and nobody thought to check. FWIW the Pomerance slides give some congruences for which the correct solution (if I got it right) is $k=1518781$. | |
| Dec 30, 2016 at 10:34 | comment | added | Fedor Petrov | I think, we may (and probably should) replace modulo $p-1$ to the modulo [multiplicative order of 2 modulo $p-1$]. | |
| Nov 13, 2009 at 18:14 | history | edited | Kim Morrison | CC BY-SA 2.5 |
added 43 characters in body
|
| Nov 13, 2009 at 16:38 | comment | added | Kevin Buzzard | Finally I'll remark that it was Swinnerton-Dyer that has caused all this trouble. I had a couple of pints of cider with him once and then he let fly about conjectures these days not being worth anything, and how he remembered the good old days (by which I think he meant the sixties) when conjectures were things that were most certainly true, and everything else was just a question. Since that conversation I've been much more reluctant to conjecture anything! | |
| Nov 13, 2009 at 16:36 | comment | added | Kevin Buzzard | @FC: aah, thanks. I deleted the comment containing the misunderstanding, thus throwing the comments into some sort of minor chaos. | |
| Nov 13, 2009 at 16:21 | comment | added | Harrison Brown | @buzzard: FC is right. And I agree that Q1 isn't fully answered, although of course that's wiiiide open. It's still nice to see some pointers to relevant literature, though. | |
| Nov 13, 2009 at 16:07 | comment | added | Kevin Buzzard | As an example of what is left: is there any $c$ other than $c=-1$ for which it is sensible to conjecture that $2^n+c$ is prime infinitely often? | |
| Nov 13, 2009 at 15:42 | comment | added | Harrison Brown | @buzzard: it happens to the best of us, even Serre and Poincare. | |
| Nov 13, 2009 at 15:41 | comment | added | Kevin Buzzard | Actually, looking at 2339 I see you've accused me of making a conjecture there too, whereas if I look at the source I again see that I only asked a question :-) | |
| Nov 13, 2009 at 15:38 | vote | accept | Kevin Buzzard | ||
| Nov 13, 2009 at 15:38 | comment | added | Kevin Buzzard | I didn't make a conjecture---I asked a question ;-) Fabulous post FC; thanks. | |
| Nov 13, 2009 at 15:11 | history | answered | user631 | CC BY-SA 2.5 |