Skip to content
Calcapedia
Number of problems

In the print window, choose “Save as PDF” as the printer (or print it on paper). Seed 1 rebuilds this exact sheet.

Showing 10 problems, seed 1.

Modulo worksheet

Grades 4–6 · CCSS 4.NBT.B.6, 5.NBT.B.6

Solve each problem and show your work. Round answers to 2 decimal places where needed.

  1. Problem 1.
    • Dividend (a): 18
    • Divisor, or modulus (n): 5
    • Convention for negative numbers: Floored (sign of n)

    Find: a mod n (remainder)

  2. Problem 2.
    • Dividend (a): 15
    • Divisor, or modulus (n): 4
    • Convention for negative numbers: Euclidean (never negative)

    Find: a mod n (remainder)

  3. Problem 3.
    • Dividend (a): 16
    • Divisor, or modulus (n): 6
    • Convention for negative numbers: Floored (sign of n)

    Find: a mod n (remainder)

  4. Problem 4.
    • Dividend (a): 20
    • Divisor, or modulus (n): 6
    • Convention for negative numbers: Truncated (sign of a)

    Find: a mod n (remainder)

  5. Problem 5.
    • Dividend (a): 15
    • Divisor, or modulus (n): 4
    • Convention for negative numbers: Truncated (sign of a)

    Find: a mod n (remainder)

  6. Problem 6.
    • Dividend (a): 14
    • Divisor, or modulus (n): 6
    • Convention for negative numbers: Truncated (sign of a)

    Find: a mod n (remainder)

  7. Problem 7.
    • Dividend (a): 24
    • Divisor, or modulus (n): 7
    • Convention for negative numbers: Truncated (sign of a)

    Find: a mod n (remainder)

  8. Problem 8.
    • Dividend (a): 16
    • Divisor, or modulus (n): 4
    • Convention for negative numbers: Euclidean (never negative)

    Find: a mod n (remainder)

  9. Problem 9.
    • Dividend (a): 16
    • Divisor, or modulus (n): 4
    • Convention for negative numbers: Floored (sign of n)

    Find: a mod n (remainder)

  10. Problem 10.
    • Dividend (a): 16
    • Divisor, or modulus (n): 3
    • Convention for negative numbers: Truncated (sign of a)

    Find: a mod n (remainder)

Answer key: Modulo worksheet

  1. 1. a mod n (remainder): 3

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      185=3.6
    3. Find the whole number of times n fits (q). Floored rule: always round down, even below zero, so the remainder gets the sign of n

      q=⌊3.6⌋=3
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=18−3×5=3
  2. 2. a mod n (remainder): 3

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      154=3.75
    3. Find the whole number of times n fits (q). Euclidean rule: pick q so the remainder is never negative. Round a ÷ |n| down (|n| is n without its sign), then give q the sign of n

      q=sign(n) × ⌊3.75⌋=3
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=15−3×4=3
  3. 3. a mod n (remainder): 4

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      166=2.6666666667
    3. Find the whole number of times n fits (q). Floored rule: always round down, even below zero, so the remainder gets the sign of n

      q=⌊2.6666666667⌋=2
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=16−2×6=4
  4. 4. a mod n (remainder): 2

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      206=3.3333333333
    3. Find the whole number of times n fits (q). Truncated rule: chop off the decimal part, rounding toward zero, so the remainder gets the sign of a

      q=trunc(3.3333333333)=3
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=20−3×6=2
  5. 5. a mod n (remainder): 3

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      154=3.75
    3. Find the whole number of times n fits (q). Truncated rule: chop off the decimal part, rounding toward zero, so the remainder gets the sign of a

      q=trunc(3.75)=3
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=15−3×4=3
  6. 6. a mod n (remainder): 2

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      146=2.3333333333
    3. Find the whole number of times n fits (q). Truncated rule: chop off the decimal part, rounding toward zero, so the remainder gets the sign of a

      q=trunc(2.3333333333)=2
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=14−2×6=2
  7. 7. a mod n (remainder): 3

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      247=3.4285714286
    3. Find the whole number of times n fits (q). Truncated rule: chop off the decimal part, rounding toward zero, so the remainder gets the sign of a

      q=trunc(3.4285714286)=3
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=24−3×7=3
  8. 8. a mod n (remainder): 0

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      164=4
    3. Find the whole number of times n fits (q). Euclidean rule: pick q so the remainder is never negative. Round a ÷ |n| down (|n| is n without its sign), then give q the sign of n

      q=sign(n) × ⌊4⌋=4
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=16−4×4=0
  9. 9. a mod n (remainder): 0

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      164=4
    3. Find the whole number of times n fits (q). Floored rule: always round down, even below zero, so the remainder gets the sign of n

      q=⌊4⌋=4
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=16−4×4=0
  10. 10. a mod n (remainder): 1

    1. Write a as a whole number (q) of n's plus a leftover remainder (r). That leftover is the answer

      a=q×n + r
    2. Divide a by n to see roughly how many times n fits into a

      163=5.3333333333
    3. Find the whole number of times n fits (q). Truncated rule: chop off the decimal part, rounding toward zero, so the remainder gets the sign of a

      q=trunc(5.3333333333)=5
    4. Find the remainder r: take q lots of n away from a, and what's left is the answer

      r=16−5×3=1