Timeline for Hamming distance to primes
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 1, 2021 at 6:17 | comment | added | domotorp | I think this question has already been asked in a slightly different form and answered here: mathoverflow.net/questions/316867/… | |
| Jun 15, 2020 at 22:43 | comment | added | srossd | Thanks very much for your answer, I wasn't aware of the (dual) Sierpiński numbers. I'll go ahead and add this to the OEIS. | |
| Jun 15, 2020 at 21:33 | vote | accept | srossd | ||
| Jun 15, 2020 at 7:37 | history | became hot network question | |||
| Jun 15, 2020 at 2:17 | answer | added | Robert Israel | timeline score: 24 | |
| Jun 15, 2020 at 1:55 | comment | added | Robert Israel | The sequence "least prime with Hamming distance 1 from the k'th odd integer" starts $3, 2, 7, 3, 11, 3, 5, 7, 19, 3, 5, 7, 17, \ldots$. It doesn't seem to be in the OEIS yet, but should be. Are you interested in contributing it? If you don't wish to, I can (with a link to this question). | |
| Jun 14, 2020 at 23:55 | history | edited | YCor | CC BY-SA 4.0 |
edited title
|
| Jun 14, 2020 at 23:49 | comment | added | Will Sawin | The sum from $n$ to infinity of the one over the log of $2^n+m$ is infinite, but I can't imagine trying to prove the existence of such primes with current technology. Even getting density 1 seems impossible to me - you would need to look to $n$ exponentially large in $m$. | |
| Jun 14, 2020 at 23:41 | review | First posts | |||
| Jun 14, 2020 at 23:51 | |||||
| Jun 14, 2020 at 23:37 | history | asked | srossd | CC BY-SA 4.0 |