If the number in the sequence is doubled, the average of the sequence will be 51.
Find maximum . If it is impossible to determine, enter 0.
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.
The average is calculated by n 1 + 2 + 3 + . . . + 2 x + . . . + n = n 1 + 2 + . . . + n + x = n 2 n ( n + 1 ) + x = 2 n + 1 + n x . And the problem tells us that 2 n + 1 + n x = 5 1 . With a little algebra we can re-arrange this into x = 2 1 0 1 n − n 2 . Unfortunately we really have no idea what n has to be, but there are two properties we have yet to apply. First, x has to be a positive integer so we have the inequality 1 0 1 n − n 2 > 0 ⟹ 1 0 1 n > n 2 ⟹ 1 0 1 > n . The other property is that x ≤ n so we have 2 1 0 1 n − n 2 ≤ n ⟹ 1 0 1 n − n 2 ≤ 2 n ⟹ 9 9 n ≤ n 2 ⟹ 9 9 ≤ n . So what we have found is that 1 0 1 > n ≥ 9 9 ⟹ n = 1 0 0 , 9 9 . And using the formula we have, x = 5 0 when n = 1 0 0 and x = 9 9 when n = 9 9 . Thus the maximum value is n − x = 5 0 .