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 first two terms are ⌊ 1 1 ⌋ and ⌊ 3 3 ⌋ . These terms, of course, correspond to n = 0 and n = 1 . I will now show that ⌊ n 3 + n 2 + 1 n 2 + n + 1 ⌋ = 0 for n > 1 . ⌊ n 3 + n 2 + 1 n 2 + n + 1 ⌋ = 0 ⇔ n 3 + n 2 + 1 > n 2 + n + 1 ⇔ n 3 − n > 0 ⇔ ( n − 1 ) n ( n + 1 ) > 0 . We can see that for n > 1 , each factor, namely, n − 1 , n , n + 1 , are all positive. Therefore, their product is also positive. This shows ⌊ n 3 + n 2 + 1 n 2 + n + 1 ⌋ = 0 for all n > 1 . Therefore, only the first two terms contribute to the sum and the desired sum is equal to ⌊ 1 1 ⌋ + ⌊ 3 3 ⌋ = 1 + 1 = 2 .