Let be the closest integer to . Then find the value of
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.
Note that if f ( n ) = k , 0 ≤ n − k 2 < ( k + 1 ) 2 − n ⟹ 2 k 2 + 2 k + 1 > 2 n ⟹ k 2 + k = k ( k + 1 ) ≥ n . Also, since f ( n ) = k − 1 ⟹ 2 n > 2 ( k − 1 ) 2 + 2 ( k − 1 ) + 1 ⟹ n ≥ ( k − 1 ) 2 + ( k − 1 ) + 1 = k ( k − 1 ) + 1 . Thus, for a given integer k , k ≥ 1 there are 2 k integers n such that f ( n ) = k .Noting that f ( 2 0 0 8 ) = 4 5 , and that 4 5 ( 4 5 − 1 ) + 1 = 1 9 8 1 , we get k = 1 ∑ 2 0 0 8 f ( n ) 1 = k = 1 ∑ 4 4 k 2 k + 4 4 2 0 0 8 − 1 9 8 0 = 8 8 . 6 2 2 2