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: ( You must be logged in to post comments.)

Subject	Author	Date
re: Solution	snark	2013-03-05 20:33:03
Solution	snark	2013-03-05 20:12:00
re(2): Solution?	Jer	2013-03-04 23:12:21
re: Solution?	Charlie	2013-03-04 15:40:27
two ways of looking at the problem	Charlie	2013-03-04 15:27:36
Solution?	Jer	2013-03-04 14:46:40

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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info