Math 2.0

Real functions Classical inequalities Theorem

Bernoulli's inequality

Builds on Mathematical induction

Statement

Let xx be a real number with x≥−1x \ge -1, and let nn be a natural number. Then (1+x)n≥1+nx.(1 + x)^n \ge 1 + n x.

Remarks

When x≠0x \neq 0 and n≥2n \ge 2, the inequality is strict. For natural numbers nn, the inequality also holds when x≥−2x \ge -2. A proof by induction on nn multiplies (1+x)n≥1+nx(1 + x)^n \ge 1 + n x by 1+x≥01 + x \ge 0 and uses nx2≥0n x^2 \ge 0.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Mathematical induction concept
  2. Bernoulli's inequality statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Bernoulli%27s_inequality, Integer exponent
About this page
Tag0M1MX28VXK
URIm2://0M1MX28VXK
Kindstatement, theorem
WritingW1 stated
MSC26D05
StatusThis copy of the site has no build data. Run m2 status 0M1MX28VXK.
UsesMathematical induction
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.