|
|
|
|
|
|
|
|
|
An Inequality: |
| (1) | (1 + 1-3)(1 + 2-3)(1 + 3-3)...(1 + n-3) < 3 |
Copyright © 1996-2008 Alexander Bogomolny
Mathematical induction is a reasonable method to apply to proving (1) "for all n". As is the case with another example, there does not appear to be an obvious way to make induction work for (1).
| (1) | (1 + 1-3)(1 + 2-3)(1 + 3-3)...(1 + n-3) < 3 |
However, a strengthened inequality
| (2) | (1 + 1-3)(1 + 2-3)(1 + 3-3)...(1 + n-3) < 3 - 1/n |
is easily amenable to an inductive argument. Denote the left-hand side of (2) as A(n). The verification of (2) for
| A(k) < 3 - 1/k |
For n = k+1, we have
|
Our goal of proving (2) for n = k+1 will be achieved provided
| ((k+1)3 - 3k + 1)/[k(k+1)3] > 1/(k+1). |
The latter simplifies to
| k3 + 3k2 + 2 > k(k + 1)2, |
and further to
| (3) | k2 - k + 2 > 0. |
Since P(x) = x2 - x + 2 has no real roots and
We thus obtain an example of two problems - one weaker, the other stronger - of which the weaker problem is more difficult to prove than the stronger one. This fits into the observation that more general problem are often easier than their specific instances.
References
- T. Andreescu, B. Enescu, Mathematical Olympiad Treasures, Birkhäuser, 2004
Copyright © 1996-2008 Alexander Bogomolny
| 30163406 |  |
|