Formulate an algorithm for fast evaluation of:
Σ_j=1,...,n² (floor (√j) + ceil (√j)), where n is a positive integer.

** ceil(x) is the least integer ≥ x and, floor(x) is the greatest integer ≤ x

(In reply to re: Solution? by Charlie)

Granted I made a little error somewhere. 

My point, as you demonstrated was: why come up with a summing algorithm when you can just find a (polynomial) formula.

Posted by Jer on 2013-03-04 23:12:21