Timeline for Elementary proof for $n^2>p>n$ for all $n>1$
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2020 at 12:44 | vote | accept | fisura filozofica | ||
| Jul 16, 2020 at 2:32 | history | edited | KConrad | CC BY-SA 4.0 |
deleted 4 characters in body
|
| Jul 15, 2020 at 21:24 | comment | added | Gerhard Paseman | Erdos has a little more to the sketch than what I present here. However, the whole paper is elementary, and proves SS for all n greater than 3000. My understanding is that there is more to proving Bertrand, and seems like much more to me. Gerhard "Lots Of Little Cases Left" Paseman, 2020.07.15. | |
| Jul 15, 2020 at 21:21 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
edited body
|
| Jul 15, 2020 at 21:13 | comment | added | Fedor Petrov | It does not differ much from the proof of Bertrand postulate. | |
| Jul 15, 2020 at 21:13 | comment | added | John Omielan | FYI, this is quite similar to the Math SE's answer to There is a prime between $n$ and $n^2$, without Bertrand. | |
| Jul 15, 2020 at 21:09 | history | answered | Gerhard Paseman | CC BY-SA 4.0 |