Modulo (remainder) calculator

Definition

The modulo (remainder) operation maps a pair (a, b) to the remainder r when a is divided by b. School and programming notation write a mod b or a % b. Intuitively: how much is left after subtracting as many whole portions of b as the sign convention allows. Classic example: 17 = 3 · 5 + 2, so 17 mod 5 = 2. A remainder of zero means b divides a after the chosen reduction to integers — for example 8 mod 4 = 0.

This calculator implements a concrete browser formula: first A = ⌊a⌋ and B = ⌊b⌋; when B ≠ 0 the result is A % B; when B = 0 the result is blank. The mathematical model is the modulo / remainder operation from integer arithmetic, tied to the division algorithm in number theory. Descriptive sources: Wikipedia — Modulo operation; MathWorld — Modulo Operation; JavaScript specification — remainder operator (%).

In teaching practice it helps to separate the mathematical identity from floating-point limits: this calculator shows the browser’s computation (floating-point arithmetic and a remainder with the dividend’s sign), not a paper proof of symbolic identities. For extreme inputs, check the domain (b ≠ 0 after floor) before floating-point range.

Historical and conceptual context

The division algorithm is foundational: for integers a and b ≠ 0 there exist unique q and r with a = q·b + r under a fixed range for r. Euclid used repeated subtraction and remainders in the GCD algorithm — hence the tight link between modulo and greatest common divisor. Modern congruence notation a ≡ c (mod n) means n divides (a − c), i.e. a and c leave the same remainder when divided by n.

In computing, % spread from C/Unix into JavaScript, Java, and C#. Sign conventions for negative operands are not universal: some systems force r ≥ 0 (Euclidean / floored division), others keep the dividend’s sign (truncating division). The same phrase “−17 mod 5” may mean 3 or −2 depending on the tool. CalcBoxer does not hide the difference: it shows floor and % as the browser computes them.

Conceptually, modulo is not ordinary floating division, not floor alone, and not GCD. Division returns a quotient; floor truncates one number; GCD seeks a common divisor. Here the question is: what is the remainder after flooring both fields.

Formal properties

For integers A, B with B ≠ 0 we have A = q·B + r where in the JavaScript convention (remainder takes the dividend’s sign) r = A % B and q = (A − r) / B is an integer. For A ≥ 0 and B > 0 usually 0 ≤ r < B. For A < 0 and B > 0, the JavaScript remainder is ≤ 0 (dividend sign). The identity A % B = A − B·trunc(A/B) is close to truncating division; the % result is defined unambiguously in the JavaScript specification.

Congruence: A ≡ r (mod B) in the remainder sense depends on convention. For positive arguments a ≡ b (mod n) ⇔ n | (a − b). Periodic structure appears in clocks and array indices: (i + 1) mod n cycles through 0…n−1. Parity test: n mod 2 = 0 iff n is even (for non-negative integers in this convention).

Floor before %: if a is not an integer, A = ⌊a⌋. That is not the same as (a % b) on floats without flooring — JavaScript allows % on non-integers, but this calculator first reduces both sides to floored integers, matching the adopted formula.

In teaching practice it helps to separate the mathematical identity from floating-point limits: this calculator shows the browser’s floating-point computation (about 15–16 significant digits), not a paper proof of symbolic identities. For extreme inputs, check the domain first, then floating-point range.

Full derivation

Step 1. Enter a and b. The parser accepts comma or period. An empty field leaves a blank result; the calculator does not substitute zero for a missing entry.

Step 2. Compute A = ⌊a⌋ and B = ⌊b⌋. Example: a = 17.9 → A = 17; b = 5 → B = 5.

Step 3. If B = 0, the remainder is undefined — blank result. If B ≠ 0, r = A % B in JavaScript.

Step 4. Recover the integer quotient from the identity: q = (A − r) / B. Check: A = q·B + r. For 17 and 5: q = 3, r = 2 because 17 = 3·5 + 2.

Step 5 (negatives). For a = −17, b = 5: A = −17, B = 5, (−17) % 5 = −2 (as in JavaScript). A Euclidean remainder would be 3 because −17 = (−4)·5 + 3. The calculator shows −2 and explains the difference in theory and FAQ.

Step 6. The diagram stacks |q| full blocks of length |B| plus a segment |r|. That visualizes the same identity, not a separate model.

Special cases

Positive examples: 17 mod 5 = 2; 10 mod 3 = 1; 8 mod 4 = 0; 23 mod 7 = 2; 4 mod 8 = 4 (field order matters); 0 mod 7 = 0. Fractional: 17.9 mod 5 = 2 after floor.

Negative dividend: (−17) mod 5 = −2 in this calculator (as in JavaScript). Positive dividend and negative divisor: the remainder still takes the dividend’s sign, as the JavaScript specification requires — check the live panel instead of guessing another language’s convention.

Division by zero after floor: b = 0.5 yields B = 0 → blank result. b = 0.9 likewise. That is a common trap with fractional divisors smaller than 1.

In teaching practice it helps to separate the mathematical identity from floating-point limits: this calculator shows the browser’s floating-point computation (about 15–16 significant digits), not a paper proof of symbolic identities. For extreme inputs, check the domain first, then floating-point range.

Numerical notes

floor and % operate on floating-point numbers. Above |A| > 2⁵³ not every integer is exactly representable — then “remainder” acts on an already rounded machine value. Typical school examples (17, 5, 10, 3) fit with room to spare.

Comma and period are equivalent. Locale display (en-US) does not change the internal value: 17 mod 5 is exactly 2.

The calculator does not compute GCD, does not solve congruence a ≡ x (mod n) for unknown x, and does not replace cryptographic modular arithmetic on big integers (BigInt). Large RSA-style moduli need separate big-integer tooling.

Related ideas and sources

Related: floor (integer part) — preparatory step; GCD — Euclid’s algorithm based on remainder; signum — does not divide; absolute value — distance, not remainder. Congruences and clock arithmetic are applications of the same remainder idea.

Sources: Wikipedia — Modulo operation; MathWorld — Modulo Operation; ECMAScript — Remainder Operator; Knuth, The Art of Computer Programming (integer arithmetic); standard number-theory texts (division algorithm). Educational tool — not a substitute for a textbook or instructor check.