Are there any interesting or lesser known proofs related to Bertrand's Postulate There are 3 standard proofs of Bertrand's Postulate:
(1)  Chebyshev's original proof
(2)  Ramanujan's simplification of Chebyshev's proof
(3)  Erdos's proof
I recently learned about the very simple proof that if the Goldbach conjecture is true, then Bertrand's postulate follows (see here).
Does anyone know of any other proofs?  There are recent proofs that extend Bertrand's postulate to show that there is always a prime in $2n$/$3n$ and $3n$/$4n$.  
I am wondering if there aren't other lesser known proofs that take a different approach to establish the existence of a prime between $n$ and $2n$.
Thanks,
-Larry
 A: The proofs for $(2n,3n)$ and $(3n,4n)$ are elementary and very pleasing (based on a quick look.) It is known that there is always a prime between $k$ and $\frac{6k}{5}\ $   for $k \gt 24.$ The proof is more involved but do not use anything analytic. Putting $k=2n$ etc gives a prime in $(4n,\frac{24n}{5})$ (except $n=1,2,6$) and hence in $(4n,5n)$ except for $n=1,2$ and one in  $(5n,6n)$ except for $n=1$. 
A: A stronger version is proved by Jonathan Sondow in this arxiv preprint (which looks like a monthly paper).
A: Bertrand's Postulate follows as a direct consequence of the following theorem of J.J. Sylvester: 
Theorem (Sylvester, 1892): Let $k$ be a positive integer. Then at least one of any $k$ consecutive integers greater than $k$ is divisible by a prime greater than $k$.
(For comparison: Chebyshev's analytic proof dates to 1850; Erdos' elementary proof dates to 1932.)
See Theorem 6 (p. 6) in http://www.math.sc.edu/~filaseta/papers/schurpaper.pdf, from which I quote: 
"The theorem implies immediately that for any positive integer $k$, one of $k+1, k+2, \ldots, 2k$ is a prime (since one of these integers must be divisible by a prime $\geq k+1).$"
A copy of the Sylvester paper can be found here.

Edit: An article in the AMM (Aug/Sept, 2013) presents a revised version of Ramanujan's proof of Bertrand's Postulate; in particular, in which the use of Stirling's formula is eliminated. The citation is:
Ramanujan’s Proof of Bertrand’s Postulate. Jaban Meher, M. Ram Murty. The American Mathematical Monthly, Vol. 120, No. 7 (August–September 2013), pp. 650-653. http://www.jstor.org/stable/10.4169/amer.math.monthly.120.07.650.
A: Nice question! For a point of view from the perspective of Goldbach's conjecture, perhaps one can consider also Theorem 3.7 of "The Hardy-Littlewood Method", 2nd edition, by R.C. Vaughan.
A: Chebyshev's proof can also be simplified a bit, I wrote down details in this blog post:
A quite short proof of Bertrand's postulate
A: I found an interesting proof today that demonstrates a stronger form of Bertrand's Postulate.  I hadn't seen it before:
Abstract. In this paper we give a stronger form of Bertrand's
postulate and use it to prove that every positive integer, except 1, 2,
4, 6, and 9, can be written as the sum of distinct odd primes.
http://www.ams.org/journals/proc/1972-033-02/S0002-9939-1972-0292746-6/S0002-9939-1972-0292746-6.pdf
A: Re-extending Chebyshev’s theorem about Bertrand’s conjecture:
http://link.springer.com/article/10.1007%2Fs11253-008-0034-7
