About 4 years ago WolframAlpha was using Euclidean division algorithm. The result of dividing -11 by 5 was the quotient equals -3 and the remainder equals 4. Which was absolutely correct according to Euclidean definition.
Nowadays, the result is -2 and -1 respectively. Which is correct in the Modulo world, but not in the Euclidean one. The remainder, according to a vast majority of sources, is 0 ≤ r < |b|, so it simply can't be negative. On top of it, the remainder is what is left after we found smallest multiple of the divisor, right? The smallest multiple of 5 in respect to -11 is -15, because -10 is actually greater than -11. Why was it changed to yield an incorrect result?
