Let (n mod k) denote the remainder when n is divided by k. For example, (7 mod 3)=1. Consider the sum of (n mod k) as k runs from 1 to n. Find the limit, as n → ∞ , of this sum divided by n2.
Limit of Modulo
Let (n mod k) denote the remainder when n is divided by k. For example, (7 mod 3)=1. Consider the sum of (n mod k) as k runs from 1 to n. Find the limit, as n → ∞ , of this sum divided by n2.