[Tutor] Arbitrary precision arithmetic

[Daniel Ehrenberg]

>   RTFM, where it says:
> 
> "divmod( a, b)
> Take two (non complex) numbers as arguments and
> return a pair of numbers 
> consisting of their quotient and remainder when
> using long division. With 
> mixed operand types, the rules for binary arithmetic
> operators apply. For 
> plain and long integers, the result is the same as
> (a / b, a % b). For 
> floating point numbers the result is (q, a % b),
> where q is usually 
> math.floor(a / b) but may be 1 less than that. In
> any case q * b + a % b is 
> very close to a, if a % b is non-zero it has the
> same sign as b, and 0 <= 
> abs(a % b) < abs(b)."
> 
> Did you already find the above and want a
> translation? or it this what you 
> were looking for?
> 
> Bob Gailer
> bgailer at alum.rpi.edu
> 303 442 2625 home
> 720 938 2625 cell 

Yes, I did RTM, but I don't understand it. I should
have said that before.

Daniel Ehrenberg

__________________________________
Do you Yahoo!?
Find out what made the Top Yahoo! Searches of 2003
http://search.yahoo.com/top2003