Timeline for Reference request for the following results
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 10, 2021 at 13:52 | history | suggested | user142929 |
Added the tag (nt.number-theory) because some users advice about it in this kind of questions.
|
|
| Aug 10, 2021 at 13:45 | review | Suggested edits | |||
| S Aug 10, 2021 at 13:52 | |||||
| Aug 10, 2021 at 13:09 | comment | added | Wojowu | The second is immediate from prime number theorem. We have a more precise result: for any $C>0$ and large enough $n$, there is a prime between $n$ and $Cn$ (apply this to $C=(1+\varepsilon)^k$. The former you can probably prove using an asymptotic expansion $\pi(x)=x/\log x+x/(\log x)^2+O(x/(\log x)^3)$. | |
| Aug 10, 2021 at 12:57 | review | First posts | |||
| Aug 10, 2021 at 13:29 | |||||
| Aug 10, 2021 at 12:56 | history | asked | S. Das | CC BY-SA 4.0 |