Timeline for Infinitely many primes of the form $2^n+c$ as $n$ varies?

8 events

when toggle format	what		by	license	comment
S Dec 30, 2016 at 7:02	history	edited	Arturo Magidin	CC BY-SA 3.0	improved formatting
S Dec 30, 2016 at 7:02	history	suggested	user57432	CC BY-SA 3.0	improved formatting
Dec 30, 2016 at 6:34	review	Suggested edits
S Dec 30, 2016 at 7:02
Jul 9, 2013 at 22:22	history	edited	Ricardo Andrade	CC BY-SA 3.0	fixed math displays
Nov 13, 2009 at 14:39	history	edited	Harrison Brown	CC BY-SA 2.5	added 520 characters in body
Nov 13, 2009 at 14:00	history	edited	Harrison Brown	CC BY-SA 2.5	added 1403 characters in body
Nov 13, 2009 at 12:25	comment	added	Kevin Buzzard		Yes. Indeed Anton's comment in 5191 gives another example (c=3,d=5) where there's a (similar-looking but slightly harder) proof that they can both only be prime finitely often. I also agree that probably the local conditions won't always save you (again follow Anton's idea and find explicit n,c,d such that 2^n+c and 2^n+d aren't prime but only have nice juicy prime factors of size > 10^6). So now we need some sensible heuristics to continue, if there are any sensible heuristics on these matters. I guess it's also worth remarking that no-one has said anything about Q1 yet.
Nov 13, 2009 at 12:15	history	answered	Harrison Brown	CC BY-SA 2.5