Timeline for Function that produces primes
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2022 at 23:57 | comment | added | Joachim König | Very useful observation, both for sake of computation (almost instantly verifiable that the conjecture holds beyond $10^6$) and heuristic argument: if $x_m$ above remains composite, a jump should occur at least around $\sqrt{n}$ times (and probably indeed much for frequently), whereas if things behave randomly, a prime would tend to come up after around $\log(n)$ jumps. | |
| Mar 16, 2022 at 18:51 | history | answered | Sean Eberhard | CC BY-SA 4.0 |