About 51,800 results
Open links in new tab
  1. Modulo - Wikipedia

    In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the modulus of the operation.

  2. Modulo Calculator

    Aug 1, 2025 · Modulo calculator finds a mod b, the remainder when a is divided by b. The modulo operation returns the remainder in division of 2 positive or negative numbers or decimals.

  3. Modulo — Definition, Formula & Examples

    Modulo is an operation that gives you the remainder when one number is divided by another. For example, 17 modulo 5 equals 2, because 17 ÷ 5 = 3 with a remainder of 2.

  4. What Is a Modulo? The Remainder Operation Explained

    Mar 13, 2026 · Modulo is the remainder after division. Learn how it works, what the % symbol means in code, and where it shows up in everyday math and programming.

  5. Modular arithmetic - Wikipedia

    For example, International Standard Book Number (ISBN) uses modulo 11 (for 10-digit ISBN) or modulo 10 (for 13-digit ISBN) arithmetic for error detection. Likewise, International Bank Account Numbers …

  6. Modulo Operation - Math is Fun

    The modulo (or modulus or mod) is the remainder after dividing one number by another. Because 1009 = 11 with a remainder of 1.

  7. Modulo Operator - Algebrica

    1 day ago · The modulo operator returns the remainder of an integer division and is a fundamental concept in number theory.

  8. Jujutsu Kaisen Modulo | Jujutsu Kaisen Wiki | Fandom

    These concepts, developed through several serialization meetings, ultimately led to the creation of the Jujutsu Kaisen Modulo series. Gege anticipates Modulo will be a concise, six-month serialization, …

  9. Modulo | Math Wiki | Fandom

    In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the modulus of the operation.

  10. Modular Arithmetic - GeeksforGeeks

    May 13, 2026 · For two integers a and b, and a positive integer n, we say that a is congruent to b modulo n if their difference is an integer multiple of n. This is denoted as: