-
Anglický jazyk
Proof of Bertrand's Postulate
Autor: Lambert M. Surhone
High Quality Content by WIKIPEDIA articles! In mathematics, Bertrand's postulate (actually a theorem) states that for each n = 2 there is a prime p such that n p 2n. It was first proven by Pafnuty Chebyshev, and a short but advanced proof was given by... Viac o knihe
Na objednávku
132.91 €
bežná cena: 139.90 €
O knihe
High Quality Content by WIKIPEDIA articles! In mathematics, Bertrand's postulate (actually a theorem) states that for each n = 2 there is a prime p such that n p 2n. It was first proven by Pafnuty Chebyshev, and a short but advanced proof was given by Srinivasa Ramanujan. The gist of the following elementary but involved proof by contradiction is due to Paul Erdos; the basic idea of the proof is to show that a certain binomial coefficient needs to have a prime factor within the desired interval in order to be large enough.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130319892
