perplexus.info :: Algorithms : Another Man's Floor

Another Man's Floor (Posted on 2005-11-23)

Let a, b, and m be positive whole numbers. Required is a fast algorithm for evaluating Σ_k=0..m floor(ka/b), floor(x) being the greatest integer that does not exceed the real number x.

See The Solution Submitted by Richard

Rating: 4.5000 (2 votes)

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re(4): Jump Start-typo?	Richard	2005-12-30 13:06:47
re(3): Jump Start-typo?	goFish	2005-12-30 06:50:07
re(2): Jump Start	Richard	2005-12-30 03:25:02
re: Jump Start	goFish	2005-12-30 02:41:38
Jump Start	Richard	2005-12-29 21:16:02
My best solution	goFish	2005-12-29 18:38:06
re: Solution (part 1)	Tristan	2005-12-28 00:40:01
re: Solution (part 1)	Hugo	2005-12-24 09:22:38
Solution (part 1)	Tristan	2005-12-24 02:11:24
A contribution	goFish	2005-11-23 18:11:09
A simplification	e.g.	2005-11-23 13:14:53

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

Chatterbox:


perplexus dot info