Don't use your calculator!

Algebra Level 5

For positive integer n n , define A n = 20 n + 11 n n ! { A }_{ n }=\dfrac { { 20 }^{ n }+{ 11 }^{ n } }{ n! } . Find the value of n n that maximizes A n A_n .


The answer is 19.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

We start by pointing out the case when n < 10 n<10 and n > 19 n>19 . If n < 10 n<10 , then we have that n + 1 < 11 < 20 , n+1 < 11 < 20, 1 < 11 n + 1 < 20 n + 1 . 1 < \frac{11}{n+1} < \frac{20}{n+1}. Therefore, A n + 1 = 2 0 n + 1 + 1 1 n + 1 ( n + 1 ) ! = 20 n + 1 2 0 n n ! + 11 n + 1 1 1 n n ! > 2 0 n n ! + 1 1 n n ! = A n . A_{n+1}=\frac{20^{n+1}+11^{n+1}}{(n+1)!} = \frac{20}{n+1} \cdot \frac{20^n}{n!} + \frac{11}{n+1} \cdot \frac{11^n}{n!} > \frac{20^n}{n!}+\frac{11^n}{n!} = A_n. It means that A 1 < A 2 < A 3 < < A 9 < A 10 A_1 < A_2 < A_3 < \ldots < A_9 < A_{10} . Similarly, if n > 19 n > 19 , we will finally have a converse that A n + 1 < A n A_{n+1} < A_n . Therefore, in the range n > 19 n > 19 , this sequence is decreasing, that is, A 20 > A 21 > A 22 > A_{20} > A_{21} > A_{22} > \cdots . In conclusion, the biggest A n A_n must be among A 10 , A 11 , , A 19 , A 20 A_{10}, A_{11}, \ldots, A_{19},A_{20} . The next step is to find relations between these numbers.

Let's say A n + 1 > A n A_{n+1} > A_n , it is true if and only if 2 0 n + 1 + 1 1 n + 1 ( n + 1 ) ! > 2 0 n + 1 1 n n ! \frac{20^{n+1}+11^{n+1}}{(n+1)!} > \frac{20^n+11^n}{n!} iff 2 0 n + 1 + 1 1 n + 1 > ( n + 1 ) ( 2 0 n + 1 1 n ) 20^{n+1} + 11^{n+1} > (n+1)(20^n+11^n) iff ( 19 n ) 2 0 n > ( n 10 ) 1 1 n . (19-n) 20^n > (n-10) 11^n. It is obvious that 2 0 n > 1 1 n 20^n > 11^n for all positive integer n n . Thus, whenever 19 n > n 10 19-n > n-10 , this inequality always holds. It is equivalent to n < 14.5 n < 14.5 , so we have that A 10 < A 11 < < A 15 A_{10} < A_{11} < \ldots < A_{15} . Now, there are A 15 , A 16 , , A 20 A_{15}, A_{16}, \ldots, A_{20} left.

Moreover, this inequality is equivalent to ( 7600 400 n ) 2 0 n 2 > ( n 10 ) 1 1 n , (7600-400n) 20^{n-2} > (n-10) 11^n, and it is not hard to prove that 2 0 n 2 > 1 1 n 20^{n-2} > 11^n for all n 12 n \ge 12 (the proof will be given afterwards). So, whenever 7600 400 n > n 10 7600-400n > n-10 , this inequality always holds. We simply get n < 7610 401 n<\frac{7610}{401} . This works for n < 19 n < 19 , so we have that A 15 < A 16 < < A 19 A_{15}<A_{16}<\ldots<A_{19} . Therefore, we have two candidates left, which are A 19 A_{19} and A 20 A_{20} .

Lastly, we find that A 20 = 2 0 20 + 1 1 20 20 ! = 2 0 19 19 ! + 11 20 1 1 19 19 ! < 2 0 19 19 ! + 1 1 19 19 ! = A 19 . A_{20} = \frac{20^{20}+11^{20}}{20!} = \frac{20^{19}}{19!}+\frac{11}{20} \cdot \frac{11^{19}}{19!} < \frac{20^{19}}{19!}+\frac{11^{19}}{19!} = A_{19}. This concludes that A 19 \boxed{A_{19}} is the biggest number in the sequence.

Here's the proof that 2 0 n 2 > 1 1 n 20^{n-2} > 11^n for all n 12 n \ge 12 . This inequality is equivalent to ( 20 11 ) n 2 > 121. \left( \frac{20}{11} \right)^{n-2} > 121. So, if we have that n 12 n \ge 12 , then ( 20 11 ) n 2 ( 20 11 ) 10 > ( 1.8 ) 10 = ( 3.24 ) 5 > 3 5 = 243 > 121 , \left( \frac{20}{11} \right)^{n-2} \ge \left( \frac{20}{11} \right)^{10} > (1.8)^{10} = (3.24)^5 > 3^5 = 243 > 121, and we are done.

How did you get the idea of your initial thoughts? It seems a wonder that you just noticed the three cases - less that 10, greater than 19 and in between 10 and 19 so easily.

Tapas Mazumdar - 4 years ago

Log in to reply

Edit : My apologies. The numbers 11 and 20 were well written in the numerator.

Tapas Mazumdar - 4 years ago

Log in to reply

Well, I thought that it looks like induction, so I considered A(n+1) compared to A(n). Then it turned out just like that somehow.

Perathorn Pooksombat - 4 years ago

Good solution!

Steven Jim - 4 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...