As I commented in A153352, Sun's result gives a (weak) lower bound on the density (for a slightly stronger version of the problem). Charles Greathouse Analyst/Programmer Case Western Reserve University On Fri, Mar 29, 2013 at 3:05 PM, Warren D Smith <warren.wds@gmail.com>wrote:
Tao proves that the proportion of n-bit primes (n sufficiently large) in which "every bit matters" is bounded between two constants in (0,1).
--sorry, I should have said (0,1] not (0,1).
The conjecture that the proportion of "every bit matters" primes is strictly below 100%, apparently is still open (albeit undoubtably true).
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun