Kvant
Main Articles

The Case of the Method of Mathematical Induction

Николаев Е. Г.

Rough automatic draft, low quality: expect mistakes and awkward wording. It will be replaced by a better translation. Original →

37

The Case of the Method of Mathematical Induction

One day, a teacher gave 10th grade students the following homework problem:

To prove, by attempting to use the method of mathematical induction, that for any natural number nn the inequality is true

Pn=1⋅3⋅5…(2n−1)2⋅4⋅6…2n<1n+1.P_n = \frac{1 \cdot 3 \cdot 5 \dots (2n-1)}{2 \cdot 4 \cdot 6 \dots 2n} < \frac{1}{\sqrt{n+1}}.

Kolya V. found the following solution at home;

a) For n=1n = 1 the inequality is true, since

P1=12<12.P_1 = \frac{1}{2} < \frac{1}{\sqrt{2}}.

  1. Let us show that the validity of inequality Pn+1<1n+2P_{n+1} < \frac{1}{\sqrt{n+2}} follows from condition Pn<1n+1P_n < \frac{1}{\sqrt{n+1}}. To do this it is enough to show that

Pn+1Pn<n+1n+2,\frac{P_{n+1}}{P_n} < \frac{\sqrt{n+1}}{\sqrt{n+2}},

or

2n+12n+2<n+1n+2,\frac{2n+1}{2n+2} < \sqrt{\frac{n+1}{n+2}},

or

(2n+1)2(n+2)<4(n+1)3.(2n+1)^2(n+2) < 4(n+1)^3.

or

4n3+12n2+9n+2<4n3+12n2+12n+4,4n^3 + 12n^2 + 9n + 2 < 4n^3 + 12n^2 + 12n + 4,

or

0<3n+2,0 < 3n + 2,

which is obviously true. Thus, a fairly provable inequality follows from the principle of mathematical induction.

However, while telling this solution at school, Kolya forgot to put one in the denominator and began to prove a more “gross” inequality:

Pn<1n.P_n < \frac{1}{\sqrt{n}}.

Here’s what he got:

a) For n=1n = 1 the inequality is true, since

P1=12<11.P_1 = \frac{1}{2} < \frac{1}{1}.

  1. Let us show that condition Pn<1nP_n < \frac{1}{\sqrt{n}} implies Pn+1<1n+1P_{n+1} < \frac{1}{\sqrt{n+1}}. To do this it is enough to show that

Pn+1Pn<nn+1,\frac{P_{n+1}}{P_n} < \frac{\sqrt{n}}{\sqrt{n+1}},

or

2n+12n+2<nn+1,\frac{2n+1}{2n+2} < \sqrt{\frac{n}{n+1}},

or

(2n+1)2(n+2)<4(n+1)3n,(2n+1)^2(n+2) < 4(n+1)^3n,

or

4n3+12n2+9n+2<4n3+12n2+12n+4,4n^3 + 12n^2 + 9n + 2 < 4n^3 + 12n^2 + 12n + 4,

or

0<3n+2,0 < 3n + 2,

which is obviously true. Thus, a fairly provable inequality follows from the principle of mathematical induction.

For those who understand this issue, we propose to prove two inequalities:

  1. Pn<13,1nP_n < \frac{1}{\sqrt{3,1n}}.

It is interesting that in this inequality the coefficient 3.1 cannot be replaced by 3.2. The largest coefficient at which it remains true is π (the ratio of the circumference to the diameter).

  1. 123+133+⋯+1n3<14\frac{1}{2^3} + \frac{1}{3^3} + \dots + \frac{1}{n^3} < \frac{1}{4}.