We're back after a server migration that caused effbot.org to fall over a bit harder than expected. Expect some glitches.


divmod(a, b)

Takes two (non complex) numbers as arguments and returns 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).

Changed in version 2.3: Using divmod with complex numbers is deprecated.