Given 1 0 0 reals a 1 , a 2 , … , a 1 0 0 such that i = 1 ∑ 1 0 0 a i 1 6 = 2 3 2 , we have maximum value of i = 1 ∑ 1 0 0 a i 1 7 to be of the form a k , where a is a prime and k is a positive integer. Find ( a + k ) .
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.
Good observation that a 1 7 = a × a 1 6 , and thus that can give us a bound.
We say that ∣ ∣ l 1 7 ∣ ∣ ≤ ∣ ∣ l 1 ∣ ∣ × ∣ ∣ l 1 6 ∣ ∣ .
Problem Loading...
Note Loading...
Set Loading...
NOTE : The maximum value is unaffected of the number of reals. The solution below considers a more general case of taking n reals, instead of 1 0 0 as mentioned in the problem.