Timeline for Are there any interesting or lesser known proofs related to Bertrand's Postulate
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2012 at 5:44 | comment | added | user22202 | This should work by counting prime pairs that sum to $m$ for each even $m$ between $n/2$ and $n$. If there are no primes between $n/2$ and $n$, the sum on the left in the above theorem should be too large. | |
| Aug 7, 2012 at 6:46 | history | answered | user22202 | CC BY-SA 3.0 |