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.
To begin this problem, let us attempt to find the value of ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ for integers n such that 0 ≤ n ≤ 2 0 1 6 .
Looking at the value n 2 0 1 5 + 1 n 2 0 1 6 , we see that this will be extremely close to n 2 0 1 5 n 2 0 1 6 = n because of the exponents which will lead to extremely large numbers for n ≥ 2 . Seeing the additional 1 that is added in the denominator of the fraction, we can deduce that the fraction n 2 0 1 5 + 1 n 2 0 1 6 will have a value slightly lower than n for n ≥ 2 . Therefore the greatest integer less than n 2 0 1 5 + 1 n 2 0 1 6 , or ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ , will be equivalent to n − 1 for n ≥ 2 .
So, we now know the value of ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ for the integers n = 2 , 3 , 4 … 2 0 1 4 , 2 0 1 5 , 2 0 1 6 . Therefore, to find the value of ∑ n = 0 2 0 1 6 ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ , we must simply add the values of ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ for n = 0 , 1 to the value of ∑ n = 2 2 0 1 6 ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ .
Therefore, ∑ n = 0 2 0 1 6 ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ = ⌊ 0 2 0 1 5 + 1 0 2 0 1 6 ⌋ + ⌊ 1 2 0 1 5 + 1 1 2 0 1 6 ⌋ + ∑ n = 2 2 0 1 6 ⌊ n 2 0 1 5 + 1 n 2 0 1 6 ⌋ = ⌊ 1 0 ⌋ + ⌊ 2 1 ⌋ + ∑ n = 2 2 0 1 6 n − 1 = 0 + 0 + 1 + 2 + 3 + … + 2 0 1 3 + 2 0 1 4 + 2 0 1 5 =
1 + 2 + 3 + … + 2 0 1 3 + 2 0 1 4 + 2 0 1 5 = 2 ( 2 0 1 5 + 1 ) ⋅ 2 0 1 5 = 2 2 0 1 6 ⋅ 2 0 1 5 = 1 0 0 8 ⋅ 2 0 1 5 = 2 0 3 1 1 2 0