Devise an algorithm for fast evaluation of:
floor((n+1)r) - floor(nr), n = 0, 1, 2, ....
where r is an algebraic number and, floor(x) is the greatest integer ≤ x.
 |
All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars |
