Congratulations to Federico Poloni from Casirate d'Adda (Italy)
for the following solution.
Prove that
.
Using Newton's formula (also called the Binomial Theorem)
|
|
|
|
1 + n |
æ ç
è
|
1 n
|
ö ÷
ø
|
+ |
n(n-1) 2!
|
|
æ ç
è
|
1 n2
|
ö ÷
ø
|
+ |
n(n-1)(n-2) 3!
|
|
æ ç
è
|
1 n3
|
ö ÷
ø
|
+ ¼ |
| |
|
| |
|
|
|
(a) Which is larger: 1.0000011000000 or 2? It's possible to prove that every number in the form
is greater than 2.
|
|
æ ç
è
|
1+ |
1 a
|
ö ÷
ø
|
a
|
= 1+a· |
1 a
|
+other positive terms > 2 |
|
for every integer a> 2. For a=1000000, the problem is solved.
(b) Which is larger: 100300 or or 300! (i.e.factorial 300)? This is a bit more complex. I'll use the formula
| (1+ |
1 n
|
)n = ( |
n+1 n
|
)n < 3 (1)
|
I will now use the last inequality to prove by induction
that
Clearly this is true for n=1 and 2 and so using
the induction hypothesis that it is true for n:
|
|
|
| |
|
|
3 |
æ ç
è
|
n+1 3
|
ö ÷
ø
|
n+1
|
|
æ ç
è
|
n n + 1
|
ö ÷
ø
|
n
|
. |
| |
|
So using (1) gives:
|
(n+1)! £ |
æ ç
è
|
n+1 3
|
ö ÷
ø
|
n+1
|
. |
|
The demonstration by induction is complete. In particular, for
n=300, the formula solves the given problem.