Proof of Bertrand's postulate
id:
proof-of-bertrand-s-postulate-167-5938272
title:
Proof of Bertrand's postulate
text:
In mathematics, Bertrand's postulate states that, for each n ≥ 2, there is a prime p such that n < p < 2 n. First conjectured in 1845 by Joseph Bertrand, it was first proven by Chebyshev, and a shorter but also advanced proof was given by Ramanujan. The following elementary proof was published by Paul Erdős in 1932, as one of his earliest mathematical publications. The basic idea is to show that the central binomial coefficients must have a prime factor within the interval in order to be large e
brand slug:
wiki
category slug:
encyclopedia
description:
Solved prime-number problem
original url:
https://en.wikipedia.org/wiki/Proof_of_Bertrand%27s_postulate
date created:
2003-06-28T04:35:18Z
date modified:
2024-08-30T08:03:52Z
main entity:
{"identifier":"Q13634063","url":"https://www.wikidata.org/entity/Q13634063"}
image:
fields total:
13
integrity:
15