Timeline for Estimate for the $2n$-th consecutive prime number
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2023 at 16:21 | comment | added | Pace Nielsen | @AndrejLeško Yes, as long as $n$ is big enough. Even more terms can be appended, using the asymptotic expansion for the order of $p_n$, whose first few terms were given by Cipolla in 1902 (as mentioned in the linked paper above); but making that effective takes more work. | |
| Apr 26, 2023 at 8:49 | comment | added | Andrej Leško | As i understand, the proof rest on estimate $ n\cdot log(nlogn)-c_{1}n\leqslant p_{n}\leqslant n\cdot log(nlogn)-c_{2}n $ and work for any $ c_{1}\geqslant 1$ and $,c_{2}\leqslant 0.9484$ | |
| Apr 25, 2023 at 18:50 | vote | accept | Andrej Leško | ||
| Apr 25, 2023 at 17:15 | history | edited | Pace Nielsen | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 25, 2023 at 17:09 | history | answered | Pace Nielsen | CC BY-SA 4.0 |