In the languages I have tested, - (x div y ) is not equal to -x div y; I have tested // in Python, / in Ruby, div in Perl 6; C has a similar behavior.

That behavior is usually according to spec, since div is usually defined as the rounding down of the result of the division, however it does not make a lot of sense from the arithmetic point of view, since it makes div behave in a different way depending on the sign, and it causes confusion such as this post on how it is done in Python.

Is there some specific rationale behind this design decision, or is just div defined that way from scratch? Apparently Guido van Rossum uses a coherency argument in a blog post that explains how it is done in Python, but you can have coherency also if you choose to round up.

(Inspired by this question by PMurias in the #perl6 IRC channel)

Ideally, we would like to have two operations div and mod, satisfying, for each b>0:

  1. (a div b) * b + (a mod b) = a
  2. 0 <= (a mod b) < b
  3. (-a) div b = -(a div b)

This is, however, a mathematical impossibility. If all the above were true, we would have

1 div 2 = 0
1 mod 2 = 1

since this is the unique integer solution to (1) and (2). Hence, we would also have, by (3),

0 = -0 = -(1 div 2) = (-1) div 2

which, by (1), implies

-1 = ((-1) div 2) * 2 + ((-1) mod 2) = 0 * 2 + ((-1) mod 2) = (-1) mod 2

making (-1) mod 2 < 0 which contradicts (2).

Hence, we need to give up some property among (1), (2), and (3).

Some programming languages give up (3), and make div round down (Python, Ruby).

In some (rare) cases the language offers multiple division operators. For instance, in Haskell we have div,mod satisfying only (1) and (2), similarly to Python, and we also have quot,rem satisfying only (1) and (3). The latter pair of operators rounds division towards zero, at the price of returning negative remainders, e.g., we have (-1) `quot` 2 = 0 and (-1) `rem` 2 = (-1).

C# also gives up (2), and allows % to return a negative remainder. Coherently, integer division rounds towards zero. Java, Scala, Pascal, and C, starting from C99, also adopt this strategy.

Floating-point operations are defined by IEEE754 with numeric applications in mind and, by default, round to the nearest representable value in a very strictly-defined manner.

Integer operations in computers are not defined by general international standards. The operations granted by languages (especially those of the C family) tend to follow whatever the underlying computer provides. Some languages define certain operations more robustly than others, but to avoid excessively difficult or slow implementations on the available (and popular) computers of their time, will choose a definition that follows its behaviour quite closely.

For this reason, integer operations tend to wrap around on overflow (for addition, multiplication, and shifting-left), and round towards negative infinity when producing an inexact result (for division, and shifting-right). Both of these are simple truncation at their respective end of the integer in two’s-complement binary arithmetic; the simplest way to handle a corner-case.

Other answers discuss the relationship with the remainder or modulus operator that a language might provide alongside division. Unfortunately they have it backwards. Remainder depends on the definition of division, not the other way around, while modulus can be defined independently of division – if both arguments happen to be positive and division rounds down, they work out to be the same, so people rarely notice.

Most modern languages provide either a remainder operator or a modulus operator, rarely both. A library function may provide the other operation for people who care about the difference, which is that remainder retains the sign of the dividend, while modulus retains the sign of the divisor.

Because the implication of integer division is that the full answer includes a remainder.

Wikipedia has a great article on this, including history as well as theory.


As long as a language satisfies the Euclidean division property that (a/b) * b + (a%b) == a, both flooring division and truncating division are coherent and arithmetically sensible.


Of course people like to argue that one is obviously correct and the other is obviously wrong, but it has more the character of a holy war than a sensible discussion, and it usually has more to do with the choice of their early preferred language than anything else. They also often tend to argue primarily for their chosen %, even though it probably makes more sense to choose / first and then just pick the % that matches.

  • Flooring (like Python):
    • No less an authority than Donald Knuth suggests it.
    • % following the sign of the divisor is apparently what about 70% of all students guess
    • The operator is usually read as mod or modulo rather than remainder.
    • “C does it”—which isn’t even true.1
  • Truncating (like C++):
    • Makes integer division more consistent with IEEE float division (in default rounding mode).
    • More CPUs implement it. (May not be true at different times in history.)
    • The operator is read modulo rather than remainder (even though this actually argues against their point).
    • The division property conceptually is more about remainder than modulus.
    • The operator is read mod rather than modulo, so it should follow Fortran’s distinction. (This may sound silly, but may have been the clincher for C99. See this thread.)
  • “Euclidean” (like Pascal—/ floors or truncates depending on signs, so % is never negative):
    • Niklaus Wirth argued that nobody is ever surprised by positive mod.
    • Raymond T. Boute later argued that you can’t implement Euclidean division naively with either of the other rules.

A number of languages provide both. Typically—as in Ada, Modula-2, some Lisps, Haskell, and Julia—they use names related to mod for the Python-style operator and rem for the C++-style operator. But not always—Fortran, for example, calls the same things modulo and mod (as mentioned above for C99).


We don’t know why Python, Tcl, Perl, and the other influential scripting languages mostly chose flooring. As noted in the question, Guido van Rossum’s answer only explains why he had to choose one of the three consistent answers, not why he picked the one he did.

However, I suspect the influence of C was key. Most scripting languages are (at least initially) implemented in C, and borrow their operator inventory from C. C89’s implementation-defined % is obviously broken, and not suitable for a “friendly” language like Tcl or Python. And C calls the operator “mod”. So they go with modulus, not remainder.


1. Despite what the question says—and many people using it as an argument—C actually doesn’t have similar behavior to Python and friends. C99 requires truncating division, not flooring. C89 allowed either, and also allowed either version of mod, so there’s no guarantee of the division property, and no way to write portable code doing signed integer division. That’s just broken.

As Paula said, it is because of the remainder.

The algorithm is founded on Euclidean division.

In Ruby, you can write this rebuilding the dividend with consistency:

puts (10/3)*3 + 10%3
#=> 10

It works the same in real life. 10 apples and 3 people. Ok you can cut one apple in three, but going outside the set integers.

With negative numbers the consistency is also kept:

puts (-10/3)*3 + -10%3 #=> -10
puts (10/(-3))*(-3) + 10%(-3) #=> 10
puts (-10/(-3))*(-3) + -10%(-3) #=> -10

The quotient is always round down (down along the negative axis) and the reminder follows:

puts (-10/3) #=> -4
puts -10%3 #=> 2

puts (10/(-3)) #=> -4
puts 10%(-3) # => -2

puts (-10/(-3)) #=> 3
puts -10%(-3) #=> -1 

This answer addresses a sub-part of the question that the other (excellent) answers didn’t explicitly address. You noted:

you can have coherency also if you choose to round up.

Other answers addressed the choice between rounding down (towards -?) and truncating (rounding towards 0) but didn’t compare rounding up (towards ?).

(The accepted answer touches on performance reasons to prefer rounding down on a two’s-complement machine, which would also apply in comparison to rounding up. But there are more important semantic reasons to avoid rounding up.)

This answer directly addresses why rounding up is not a great solution.

Rounding up breaks elementary-school expectations

Building on an example from a previous answer’s, it’s common to informally say something like this:

If I evenly divide fourteen marbles among three people, each person gets four marbles and there are two marbles left over.

Indeed, this is how many students are first taught division (before being introduced to fractions/decimals). A student might write 14 ÷ 3 = 4 remainder 2. Since this is introduced so early, we’d really like our div operator to preserve this property.

Or, put a bit more formally, of the three properties discussed in the top-voted answer, the first one ((a div b) × b + (a mod b) = a) is by far the most important.

But rounding up breaks this property. If div rounds up, then 14 div 3 returns 5. This means that the equation above simplifies to 15 + (13 mod 4) = 13 – and that’s not true for any definition of mod. Similarly, the less-formal/elementary-school approach is also out of luck – or at least requires introducing negative marbles: “Each person gets 5 marbles and there are negative one marbles left over”.

(Rounding to the nearest integer also breaks the property when, as in the example above, that means rounding up.)

Thus, if we want to maintain elementary expectations, we cannot round up. And with rounding up off the table, the coherency argument that you linked in the question is sufficient to justify rounding down.