Consider the sequence with real terms a 0 , a 1 , a 2 , . . . , a k that satisfies the inequality ∑ i = 1 k ∣ a i − 1 + a i ∣ ≤ 4 3 − 3 ∣ a k ∣ . The maximum possible value of ∣ a 0 a k ∣ can be expressed as n m with co-prime positive integers m , n . Find m + n .
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.
Problem Loading...
Note Loading...
Set Loading...
As ∣ x + y ∣ ≥ ∣ x ∣ − ∣ y ∣ for x , y ∈ R ,
4 3 ≥ ∑ i = 1 k ∣ a i − 1 + a i ∣ + 3 ∣ a k ∣ ≥ ∣ a 0 ∣ − ∣ a 1 ∣ + ∣ a 1 ∣ − ∣ a 2 ∣ + . . . − ∣ a k ∣ + 3 ∣ a k ∣ = ∣ a 0 ∣ + 2 ∣ a k ∣ .
Using the AM-GM inequality,
4 3 ≥ ∣ a 0 ∣ + 2 ∣ a k ∣ ≥ 2 ∣ 2 a 0 a k ∣ , so 8 3 ≥ ∣ 2 a 0 a k ∣ .
Hence ∣ a 0 a k ∣ ≤ 1 2 8 9 , giving the answer of 1 3 7 .