For positive integer , define . Find the value of that maximizes .
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.
We start by pointing out the case when n < 1 0 and n > 1 9 . If n < 1 0 , then we have that n + 1 < 1 1 < 2 0 , 1 < n + 1 1 1 < n + 1 2 0 . Therefore, A n + 1 = ( n + 1 ) ! 2 0 n + 1 + 1 1 n + 1 = n + 1 2 0 ⋅ n ! 2 0 n + n + 1 1 1 ⋅ n ! 1 1 n > n ! 2 0 n + n ! 1 1 n = A n . It means that A 1 < A 2 < A 3 < … < A 9 < A 1 0 . Similarly, if n > 1 9 , we will finally have a converse that A n + 1 < A n . Therefore, in the range n > 1 9 , this sequence is decreasing, that is, A 2 0 > A 2 1 > A 2 2 > ⋯ . In conclusion, the biggest A n must be among A 1 0 , A 1 1 , … , A 1 9 , A 2 0 . The next step is to find relations between these numbers.
Let's say A n + 1 > A n , it is true if and only if ( n + 1 ) ! 2 0 n + 1 + 1 1 n + 1 > n ! 2 0 n + 1 1 n iff 2 0 n + 1 + 1 1 n + 1 > ( n + 1 ) ( 2 0 n + 1 1 n ) iff ( 1 9 − n ) 2 0 n > ( n − 1 0 ) 1 1 n . It is obvious that 2 0 n > 1 1 n for all positive integer n . Thus, whenever 1 9 − n > n − 1 0 , this inequality always holds. It is equivalent to n < 1 4 . 5 , so we have that A 1 0 < A 1 1 < … < A 1 5 . Now, there are A 1 5 , A 1 6 , … , A 2 0 left.
Moreover, this inequality is equivalent to ( 7 6 0 0 − 4 0 0 n ) 2 0 n − 2 > ( n − 1 0 ) 1 1 n , and it is not hard to prove that 2 0 n − 2 > 1 1 n for all n ≥ 1 2 (the proof will be given afterwards). So, whenever 7 6 0 0 − 4 0 0 n > n − 1 0 , this inequality always holds. We simply get n < 4 0 1 7 6 1 0 . This works for n < 1 9 , so we have that A 1 5 < A 1 6 < … < A 1 9 . Therefore, we have two candidates left, which are A 1 9 and A 2 0 .
Lastly, we find that A 2 0 = 2 0 ! 2 0 2 0 + 1 1 2 0 = 1 9 ! 2 0 1 9 + 2 0 1 1 ⋅ 1 9 ! 1 1 1 9 < 1 9 ! 2 0 1 9 + 1 9 ! 1 1 1 9 = A 1 9 . This concludes that A 1 9 is the biggest number in the sequence.
Here's the proof that 2 0 n − 2 > 1 1 n for all n ≥ 1 2 . This inequality is equivalent to ( 1 1 2 0 ) n − 2 > 1 2 1 . So, if we have that n ≥ 1 2 , then ( 1 1 2 0 ) n − 2 ≥ ( 1 1 2 0 ) 1 0 > ( 1 . 8 ) 1 0 = ( 3 . 2 4 ) 5 > 3 5 = 2 4 3 > 1 2 1 , and we are done.