We need to find limn→∞n2[r]+[2r]+…+[nr], where [x] denotes the greatest integer function.
We use the property that for any real number x, we have x−1<[x]≤x. Applying this to each term [kr] for k=1,2,…,n:
kr−1<[kr]≤kr.
Summing from k=1 to n: ∑k=1n(kr−1)<∑k=1n[kr]≤∑k=1nkr.
The right side equals r⋅2n(n+1), and the left side equals r⋅2n(n+1)−n.
Dividing everything by n2: n2r⋅2n(n+1)−n<n2∑k=1n[kr]≤n2r⋅2n(n+1).
As n→∞, the left bound becomes 2r⋅nn+1−n1→2r, and the right bound becomes 2r⋅nn+1→2r.
By the Squeeze Theorem, the limit equals 2r, which is Option A.