a 2 a 1 + a 3 a 2 + a 4 a 3 + ⋯ + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 = 2 0 0
Let a 1 , a 2 , a 3 , … , a 2 0 0 be positive real numbers and a 1 < a 2 < a 3 < ⋯ < a 2 0 0 . How many 200-tuplets ( a 1 , a 2 , a 3 , … , a 2 0 0 ) satisfy the equation above?
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.
Suppose ( a 1 , a 2 , a 3 , … , a 2 0 0 ) is such a solution.
Since 0 < a 1 < a 2 < a 2 0 0 , we have a 2 a 1 < 1 < a 1 a 2 0 0 , so in particular a 2 a 1 = a 1 a 2 0 0 .
Therefore, by the [strict] AM-GM inequality, 1 = 2 0 0 1 = 2 0 0 a 2 a 1 × a 3 a 2 × ⋯ × a 2 0 0 a 1 9 9 × a 1 a 2 0 0 < 2 0 0 1 ( a 2 a 1 + a 3 a 2 + ⋯ + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 ) = 2 0 0 1 ( 2 0 0 ) = 1 .
That is, 1 < 1 , which of course is absurd, so there are no such solutions.
Problem Loading...
Note Loading...
Set Loading...
a 2 a 1 + a 3 a 2 + a 4 a 3 + . . . + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 = 2 0 0 Given Since, a 1 , a 2 , a 3 ⋯ a 2 0 0 are positive reals, Applying AM-GM we get,
2 0 0 a 2 a 1 + a 3 a 2 + a 4 a 3 + . . . + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 2 0 0 a 2 a 1 + a 3 a 2 + a 4 a 3 + . . . + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 ⟹ a 2 a 1 + a 3 a 2 + a 4 a 3 + . . . + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 ≥ 2 0 0 a 2 a 1 ⋅ a 3 a 2 ⋅ a 4 a 3 ⋯ a 2 0 0 a 1 9 9 ⋅ a 1 a 2 0 0 ≥ 1 As a 2 a 1 ⋅ a 3 a 2 ⋅ a 4 a 3 ⋯ a 2 0 0 a 1 9 9 ⋅ a 1 a 2 0 0 = 1 ≥ 2 0 0
⟹ The equality only occurs at, a 2 a 1 = a 3 a 2 = a 4 a 3 = . . . = a 2 0 0 a 1 9 9 = a 1 a 2 0 0 But since a 1 < a 2 < a 3 < ⋯ < a 2 0 0 we have, a 2 a 1 , a 3 a 2 , a 4 a 3 , . . . , a 2 0 0 a 1 9 9 < 1 and a 1 a 2 0 0 > 1 a 2 a 1 + a 3 a 2 + a 4 a 3 + . . . + a 2 0 0 a 1 9 9 + a 1 a 2 0 0 > 2 0 0 Making the number of solutions 0