All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Ceiling and Floor Formulation (Posted on 2013-03-04) Difficulty: 3 of 5
Formulate an algorithm for fast evaluation of:
Σj=1,...,n2 (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.)
Solution 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:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information