Re: [math-fun] How often does every bit matter?

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).