Timeline for On the sum of digits of primes in binary form [duplicate]
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2016 at 14:18 | comment | added | მამუკა ჯიბლაძე | @GerryMyerson wow thanks, I would never reach $2^{4583176}$ on my pc :D | |
| Jan 25, 2016 at 12:42 | comment | added | Gerry Myerson | See en.wikipedia.org/wiki/… | |
| Jan 25, 2016 at 12:32 | comment | added | მამუკა ჯიბლაძე | @GerryMyerson Thanks, very interesting! The counterexample at your link is quite big, actually I was unsuccessfully looking for $k$ with $2131+2^k$ prime, I wonder what happens with it... | |
| Jan 25, 2016 at 11:58 | history | closed | Gerry Myerson nt.number-theory Users with the nt.number-theory badge or a synonym can single-handedly close nt.number-theory questions as duplicates and reopen them as needed. | Duplicate of Are there primes of every Hamming weight? | |
| Jan 25, 2016 at 11:44 | comment | added | Gerry Myerson | Erdos showed that there are arithmetical progressions of odd numbers $n$ such that there is no $k$ with $n+2^k$ prime. These arithmetical progressions satisfy the conditions of Dirichlet's Theorem, so there are prime numbers $p$ such that $p+2^k$ is never prime. See, e.g., math.dartmouth.edu/~carlp/PDF/covertalkunder.pdf | |
| Jan 25, 2016 at 11:18 | comment | added | მამუკა ჯიბლაძე | Is there actually an obvious counterexample to the statement that for any odd prime $p$ there is a $2^k>p$ with $p+2^k$ prime too? | |
| Jan 25, 2016 at 10:45 | history | asked | Konstantinos Gaitanas | CC BY-SA 3.0 |