Suppose that the sum of n consecutive integers is 2016, find the biggest value of 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.
My solution is analogous to Chan's.
The sum of n consecutive integers is n × a a v g = 2 0 1 6 . The minimum of a a v g is 2 1 so that the maximum of n is 2 × 2 0 1 6 = 4 0 3 2
@Otto Bretscher Sir , how do you conclude that minimum average is 2 1 ??
Problem Loading...
Note Loading...
Set Loading...
Let the first term of the consecutive integers be a . Then we have 2 n ( 2 a + n − 1 ) = 2 0 1 6 . Note that 2 a + n − 1 is a positive integer. This means that 2 n ≤ 2 0 1 6 and hence n ≤ 4 0 3 2 . Now n = 4 0 3 2 is possible, by letting a = − 2 0 1 5 .