Scribd
Upload
318 views3 pages

11

This document provides examples of using mathematical induction to prove inequalities. It explains that induction can be used to prove inequalities involving subtraction or comparisons using an assumption at step 2 of the proof. Two examples are given: one proves 4n-1 > n^2 for n ≥ 3 using direct comparison, and the other proves n^2 < 2n for n ≥ 5 using the difference between the left and right sides. Both examples follow the standard three steps of mathematical induction to complete the proofs.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
318 views3 pages

11

This document provides examples of using mathematical induction to prove inequalities. It explains that induction can be used to prove inequalities involving subtraction or comparisons using an assumption at step 2 of the proof. Two examples are given: one proves 4n-1 > n^2 for n ≥ 3 using direct comparison, and the other proves n^2 < 2n for n ≥ 5 using the difference between the left and right sides. Both examples follow the standard three steps of mathematical induction to complete the proofs.

Uploaded by

compiler&automata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

9/25/2017 Best Examples of Mathematical Induction Inequality | iitutor

Best Examples of Mathematical Induction Inequality

Share Share +1 Tweet

Our Courses

Mathematical Induction Inequality Proofs

Mathematical Induction Inequality is being used for proving inequalities. It is quite often applied for
the subtraction and/or greatness, using the assumption at the step 2. Lets take a look at the
following hand-picked examples.

Practice Questions for Mathematical Induction Inequality

Basic Mathematical Induction Inequality

Prove 4n1 > n2 for n 3 by mathematical induction.

Step 1: Show it is true for n = 3.


LHS = 431 = 16
RHS = 32 = 9
LHS > RHS
Therefore it is true for n = 3.
Step 2: Assume that it is true for n = k.
That is, 4k1 > k2 .
Step 3: Show it is true for n = k + 1.
That is, 4k > (k + 1)2 .

k
https://www.iitutor.com/mathematical-induction-inequality/ 1/3
9/25/2017 Best Examples of Mathematical Induction Inequality | iitutor

LHS = 4k
= 4k1+1
= 4k1 4
> k2 4 by the assumption 4k1 > k2
= k2 + 2k2 + k2 2k2 > 2k and k2 > 1 for k 3
> k2 + 2k + 1
= (k + 1)2
= RHS
LHS > RHS
Therefore it is true for n = k + 1 assuming that it is true for n = k.
Therefore 4n1 > n2 is true for n 3.

Mathematical Induction Inequality using the Difference

It is quite often used to prove A > B by A B > 0.


Prove n2 < 2n for n 5 by mathematical induction.

Step 1: Show it is true for n = 5.


LHS = 52 = 25
RHS = 25 = 32
LHS < RHS
It is true for n = 5.
Step 2: Assume that it is true for n = k.
That is, k2 < 2k .
Step 3: Show it is true for n = k + 1.
That is, (k + 1)2 < 2k+1 .

k+1
https://www.iitutor.com/mathematical-induction-inequality/ 2 2/3
9/25/2017 Best Examples of Mathematical Induction Inequality | iitutor

RHS LHS = 2k+1 (k + 1)2


= 2 2k (k2 + 2k + 1)
> 2 k2 (k2 + 2k + 1) by the assumption from Step 2
= k2 2k 1
= (k 1)2 2
>0 , since k 5 and so (k 1)2 16
2k+1 (k + 1)2 > 0
(k + 1)2 < 2k+1
Therefore it is true for n = k + 1 assuming it is true for n = k.
Therefore it is true for n = k + 1 is true for n 5.

https://www.iitutor.com/mathematical-induction-inequality/ 3/3

You might also like