We begin by recalling the definition of the greatest-integer (floor) function. By definition, for any real number x
[x]=nif and only ifn≤x<n+1,
where n is an integer. In words, [x] is the largest integer that is not greater than x.
The series to be summed is
[−31]+[−31−1001]+[−31−1002]+…+[−31−10099].
To handle all the terms uniformly, let us label the general (k-th) term:
Tk=[−31−100k],k=0,1,2,…,99.
Our task is to find Tk for every integer k in the stated range and then add all the Tk.
First, convert −31 into its decimal form for easy comparison:
−31=−0.333333…
Next, observe that
−31−100k=−0.333333…−100k.
Because 100k varies from 0 (when k=0) to 10099=0.99 (when k=99), the expression
αk=−31−100k
will move from
α0=−0.333333…
down to
α99=−0.333333…−0.99=−1.323333…
Thus each αk lies in the interval
−1.323333…≤αk≤−0.333333…
Within this interval the only integers that can serve as greatest integers are −1 and −2, because
−2<−1.323333…≤αk≤−0.333333…<0.
So every term Tk equals either −1 or −2.
To decide which, locate the point where αk crosses −1.
We need
αk<−1⟺−31−100k<−1.
Rearranging, add 31 to both sides:
−100k<−1+31=−32.
Multiplying by −1 reverses the inequality:
100k>32.
Now convert 32 to a decimal:
32=0.666666…
Hence
100k>0.666666…⟺k>66.6666…
Since k is an integer, the inequality becomes
k≥67.
We have therefore obtained two cases.
• If 0≤k≤66, then αk≥−1, so
Tk=[αk]=−1.
• If 67≤k≤99, then αk<−1, but always αk>−2, so
Tk=[αk]=−2.
Count how many times each value occurs.
• For k=0,1,2,…,66 we have 67 integers, giving 67 occurrences of −1.
• For k=67,68,…,99 we have 99−67+1=33 integers, giving 33 occurrences of −2.
Now add all the terms:
Sum=67(−1)+33(−2).
Simplify step by step:
67(−1)=−67,
33(−2)=−66,
and finally
−67−66=−133.
Hence, the correct answer is Option D.