Timeline for Could computing the next prime in a finite Euler product be made rigorous?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2020 at 15:38 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
added 353 characters in body
|
| Jul 11, 2020 at 16:00 | comment | added | Andreas Weingartner | Yes, the last display of my answer shows that $x<q=p_{N+1}$. Using the ceiling instead of rounding will always work if $2k \ge 0.71 \, p_N$, but will fail at twin primes if $2k\le 0.38 \, p_N$. | |
| Jul 11, 2020 at 15:48 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
added 1 character in body
|
| Jul 11, 2020 at 15:42 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
added 1 character in body
|
| Jul 11, 2020 at 15:01 | vote | accept | Agno | ||
| Jul 11, 2020 at 14:59 | comment | added | Agno | Many thanks, Andreas! One more observation that could maybe help sharpening these bounds. Numerical evidence suggests (I have no proof) that when $k$ increases, $x$ always approaches $p_{N+1}$ from 'below'. So, if this is true, could using the ceiling instead of rounding $x$ improve the bound by a factor $2$? | |
| Jul 11, 2020 at 4:56 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
added 18 characters in body
|
| Jul 11, 2020 at 4:27 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
deleted 50 characters in body
|
| Jul 11, 2020 at 4:09 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
deleted 34 characters in body
|
| Jul 11, 2020 at 1:29 | history | edited | Andreas Weingartner | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jul 11, 2020 at 1:22 | history | answered | Andreas Weingartner | CC BY-SA 4.0 |