Bernoulli Inequality — Definition, Formula & Examples
Bernoulli Inequality states that for any real number and any positive integer , the expression is always at least as large as .
For all with and for every positive integer , the inequality holds, with equality if and only if or .
Key Formula
Where:
- = A real number satisfying $x \ge -1$
- = A positive integer ($n \ge 1$)
How It Works
The inequality gives a simple linear lower bound for an exponential-type expression. You can prove it by mathematical induction: the base case is trivially true, and the inductive step uses the fact that to preserve the inequality when multiplying both sides. In practice, you apply it whenever you need to estimate from below without expanding the full binomial. It is especially powerful when is small, since the linear approximation is then quite close to the true value.
Worked Example
Problem: Use the Bernoulli Inequality to find a lower bound for .
Identify x and n: Write in the form with and . Since , the inequality applies.
Compute the lower bound: Evaluate the right-hand side.
Compare: The actual value of , so the bound is correct and reasonably tight.
Answer:
Why It Matters
Bernoulli Inequality appears frequently in mathematical olympiads for bounding products and powers. It also serves as a stepping stone toward proving the AM-GM inequality and understanding convergence results in calculus and real analysis.
Common Mistakes
Mistake: Applying the inequality when , for example using .
Correction: The condition is essential. When , the factor is negative and raising it to various powers can flip the inequality direction. Always verify before applying.
