Home > Algorithms
| 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.
re: Solution (part 1)
|
 | Comment 4 of 11 | 
|
(In reply to Solution (part 1) by Tristan)
Pick's Theorem?
|
|
Posted by Hugo
on 2005-12-24 09:22:38 |
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (17)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
