perplexus.info :: Algorithms : Ceiling and Floor Formulation

Ceiling and Floor Formulation (Posted on 2013-03-04)

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

No Solution Yet Submitted by K Sengupta

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

re: Solution

Comment 6 of 6 |

(In reply to Solution by snark)

> This suggests the answer can be obtained by the sum of squares

> of the first n odd numbers plus one plus n.

Sorry, mis-counted. The sum of squares of the first n odd numbers, plus n.

Posted by snark on 2013-03-05 20:33:03

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info