Timeline for On primes of specified length and bit pattern
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 5, 2021 at 3:59 | history | edited | Turbo |
edited tags; edited tags
|
|
| May 5, 2021 at 3:58 | comment | added | Turbo | @StevenStadnicki I am asking if there is a Riemann Hypothesis for it and not a complete answer. | |
| May 5, 2021 at 3:47 | history | edited | Turbo | CC BY-SA 4.0 |
added 487 characters in body
|
| May 5, 2021 at 2:48 | comment | added | Steven Stadnicki | The number of 1s in the expansion of a number is generally known as Hamming weight, and while getting that tight of a bound seems unlikely especially at the extremes of $k$, there are in fact things known about them: mathoverflow.net/questions/22629/… | |
| May 5, 2021 at 1:17 | history | edited | Turbo |
edited tags
|
|
| May 1, 2021 at 11:25 | history | asked | Turbo | CC BY-SA 4.0 |