My instructions were "for i from 1 to n, do i % m and return the sum. You'll need to get a little clever with performance, since n can be a very large number"
The program below works fine with small numbers. How can I make it efficient with large numbers?
function f(n, m) {
var summ = 0;
for (var i = 1; i <= n; i++) {
summ += i % m;
}
return summ;
}