Find [1]+[2]+[3]+…+[120] where [x] is the greatest integer function.
For n2≤k<(n+1)2, [k]=n.
Count of integers k with [k]=n: from n2 to (n+1)2−1, that's 2n+1 integers.
For n=1: k=1,2,3 (3 values), contribution = 1×3=3
For n=2: k=4,...,8 (5 values), contribution = 2×5=10
For n=3: k=9,...,15 (7 values), contribution = 3×7=21
For n=4: k=16,...,24 (9 values), contribution = 4×9=36
For n=5: k=25,...,35 (11 values), contribution = 5×11=55
For n=6: k=36,...,48 (13 values), contribution = 6×13=78
For n=7: k=49,...,63 (15 values), contribution = 7×15=105
For n=8: k=64,...,80 (17 values), contribution = 8×17=136
For n=9: k=81,...,99 (19 values), contribution = 9×19=171
For n=10: k=100,...,120 (21 values), contribution = 10×21=210
Total = 3+10+21+36+55+78+105+136+171+210=825
The answer is 825.