Timeline for Could computing the next prime in a finite Euler product be made rigorous?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 11, 2020 at 15:01 | vote | accept | Agno | ||
| Jul 11, 2020 at 1:22 | answer | added | Andreas Weingartner | timeline score: 15 | |
| Jul 10, 2020 at 23:44 | comment | added | Andreas Weingartner | It's not too difficult to show that $k=p_N$ works, and that we need $k\ge c p_N$ for some positive constant $c$ in case $p_{N+2}=p_{N+1}+2$. | |
| Jul 10, 2020 at 17:20 | comment | added | Sidharth Ghoshal | this is cool. its like an analytic approach to finding primes | |
| Jul 10, 2020 at 16:37 | history | asked | Agno | CC BY-SA 4.0 |