This interactive tool helps you visualize how numbers divide into equal groups. Start by entering any number between 1 and 100 in the Number field. The tool displays your number as a grid of gray tiles, arranged in rows of 10 for easy counting.
Next, select a divisor by clicking one of the buttons labeled 2 through 9. This determines how many tiles will be in each group when you perform the division.
Click the Group button to see the magic happen. The tool rearranges all tiles into equal-sized groups based on your chosen divisor. Blue groups show complete sets, while any leftover tiles appear in a yellow group. Click Reset to return to the original grid view and try a different divisor. A perfect split with no yellow at all is what divisibility means—and if the divisor is larger than the number itself, no complete group forms.
Understanding the Tiles Display
The tiles area provides two distinct views of your number. In the default ungrouped view, tiles appear as gray squares arranged in a 10-column grid. This layout makes it easy to count by tens and quickly verify your input number.
When you click Group, the display transforms to show the division result. Complete groups appear as blue tiles enclosed in light blue boxes, each labeled with the group size. If your number doesn't divide evenly, leftover tiles display in bright yellow with an amber border, making the remainder immediately visible.
The visual contrast between blue groups and yellow leftovers provides instant feedback about divisibility. Equal-sized blue boxes mean perfect division, while any yellow tiles indicate a remainder exists.
23 tiles, ungrouped, frozen
Twenty-three gray tiles in rows of ten: two full rows and three more. The layout states the number before any question about grouping is asked.
The rows-of-ten arrangement is deliberate: it mirrors base-ten notation, so a number like 23 is readable at a glance as two full rows and three extra tiles—the tens digit and the units digit made physical.
Both views show the same count; only the organizing question changes. Ungrouped, the tiles just state the number. Grouped, they answer whether that number splits evenly, and the result banner records the verdict in symbols.
Reading the Result Banner
The blue result banner above the tiles area summarizes your division in plain language. Before grouping, it simply shows your tile count (for example, "23 tiles").
After clicking Group, the banner updates to show the complete result. For a number like 23 divided by 5, you'll see: 4 groups of 5 + 3 leftover. This corresponds to the division equation 23÷5=4remainder3.
When a number divides evenly, the banner displays only the group count followed by a green checkmark and "Divisible ✓". For instance, dividing 20 by 5 shows: 4 groups of 5 — Divisible ✓. This visual confirmation helps reinforce when remainders are zero.
Using the Explanation Panel
The right side of the tool contains a step-by-step explanation panel that walks through the division process. Before grouping, it presents the starting point and poses the question: can we divide these tiles into equal groups?
After grouping, the panel shows numbered steps with mathematical notation. Step 1 displays the division equation with the quotient and remainder. Step 2 shows the multiplication check: groups times divisor equals the portion that divides evenly.
When a remainder exists, Step 3 appears with yellow highlighting, showing the subtraction that yields the leftover: number−(groups×divisor)=remainder. The conclusion box at the bottom confirms whether the number is divisible (green) or not (yellow).
Finding Nearby Divisible Numbers
When a number isn't divisible by your chosen divisor, the tool provides a helpful hint showing nearby numbers that would divide evenly. This feature appears in a light blue box below the conclusion.
The hint suggests two options: subtract the remainder to find a smaller divisible number, or add enough to reach the next divisible number. For 23 ÷ 5, the hint shows:
20 (which gives 4 groups of 5)
25 (which gives 5 groups of 5)
This feature helps students understand the relationship between consecutive multiples and see how close any number is to being divisible by a given divisor.
What is Divisibility?
Divisibility describes whether one integer divides another exactly, leaving no remainder. We say a is divisible by b when there exists an integer k such that a=b×k. For example, 24 is divisible by 6 because 24=6×4.
The notation b∣a means "b divides a" and indicates that a is a multiple of b. Equivalently, b is a factor (or divisor) of a. Understanding divisibility is fundamental to working with fractions, finding common denominators, and factoring numbers.
Divisibility connects directly to the concept of remainders. When a÷b produces remainder r, we write a=b×q+r where q is the quotient. When r=0, divisibility holds.
20 ÷ 5, frozen
Four blue boxes of five tiles each, and nothing outside them: 20 = 4 × 5 exactly, so the banner reports Divisible ✓.
The frozen frame above is the definition made visible: twenty tiles, four boxes of five, and nothing outside a box. The witness k in a=b×k is simply the number of blue boxes—divisibility is not an abstract property but a successful packing.
Note what the picture rules out: there is no way to draw a fifth box, and no partial box is allowed. That all-or-nothing character is why divisibility questions have clean yes/no answers, and why the common divisibility rules can decide them from digits alone without drawing a single tile.
Division, Quotients, and Remainders
Every division of positive integers produces a quotient and remainder. The division algorithm states that for any integers a and b (with b>0), there exist unique integers q (quotient) and r (remainder) such that:
a=b×q+r where 0≤r<b
The quotient tells how many complete groups of size b fit into a. The remainder is what's left over after forming those groups. In the Divisibility Tiles tool, blue groups represent the quotient while yellow tiles represent the remainder.
The modulo operation extracts just the remainder: amodb=r. For instance, 23mod5=3. This operation appears throughout mathematics and computer science for cyclic patterns and clock arithmetic.
23 ÷ 5, frozen
Four complete blue groups absorb twenty tiles; the three that would not fit glow yellow — the remainder the equation writes as 23 = 4 × 5 + 3.
The frozen 23 ÷ 5 above shows why the division algorithm's constraint 0≤r<b is forced: three yellow tiles cannot form a fourth-and-a-bit blue box, and if five could ever be left over they would immediately close another complete group. The remainder is small precisely because grouping is greedy.
Uniqueness matters too: for a given number and divisor there is exactly one way to fill the picture—one group count, one leftover. Two edge cases bracket the idea: a remainder of zero collapses the yellow box entirely, and a quotient of zero leaves nothing but yellow. When the split fails, the hint below the conclusion names the nearest numbers that would succeed.
When the Divisor Is Larger Than the Number
What happens when you try to divide 3 tiles into groups of 5? Not even one complete group can form. The tool shows zero blue boxes and all three tiles in yellow, and the banner reads: 0 groups of 5 + 3 leftover.
This is a perfectly legal division—just an extreme one. The quotient is 0 and the remainder equals the number itself: 3=5×0+3. The division algorithm's condition 0≤r<b still holds, because 3 is less than 5.
Try it in the tool: enter any number smaller than your chosen divisor and click Group. The all-yellow display makes the case memorable—division did not fail, it simply produced nothing but leftover.
3 ÷ 5, frozen
With only three tiles, no group of five can form: zero blue boxes and every tile yellow — 3 = 5 × 0 + 3.
The case matters beyond curiosity. It anchors the general fact that any number smaller than the divisor is its own remainder—which is exactly why amodb leaves small numbers untouched, and why clock arithmetic reads 3 o'clock as simply 3.
It also completes the tool's spectrum of outcomes: all blue (divisible), blue with yellow (a proper remainder), and all yellow (quotient zero). The nearby-numbers hint still works here: for 3 ÷ 5 it points down to 0 and up to 5, the two nearest multiples.
Common Divisibility Rules
Quick divisibility rules help determine if a number divides evenly without performing full division:
Divisible by 2: Last digit is even (0, 2, 4, 6, 8)
Divisible by 3: Sum of digits is divisible by 3
Divisible by 4: Last two digits form a number divisible by 4
Divisible by 5: Last digit is 0 or 5
Divisible by 6: Divisible by both 2 and 3
Divisible by 9: Sum of digits is divisible by 9
Use the Divisibility Tiles tool to verify these rules visually. Enter a number, select the divisor, and observe whether groups form perfectly or leave remainders. This hands-on approach builds intuition for why these rules work.
Divisibility and Factors
The divisors of a number n are all integers that divide n evenly. For example, the divisors of 12 are: 1, 2, 3, 4, 6, and 12. Each divisor produces zero remainder when dividing into 12.
Prime numbers have exactly two divisors: 1 and themselves. Numbers like 2, 3, 5, 7, 11, and 13 cannot be split into smaller equal groups (other than groups of 1). Use the Divisibility Tiles tool to explore primes—try dividing a prime by various divisors and notice that none produce zero remainder.
Composite numbers have more than two divisors. The number 12 is composite because multiple divisors exist. Finding all divisors connects to prime factorization, where every composite number breaks down into a product of primes.
Related Concepts and Tools
Divisibility connects to many foundational arithmetic and number theory topics:
Factors and Multiples: Understanding which numbers divide evenly leads to finding all factors of a number and recognizing multiples of common divisors.
Greatest Common Divisor (GCD): The largest number that divides two integers evenly. Essential for simplifying fractions to lowest terms.
Least Common Multiple (LCM): The smallest number divisible by two given integers. Used when adding fractions with different denominators.
Prime Factorization: Breaking numbers into prime factors reveals all divisibility relationships and provides a systematic approach to finding GCD and LCM.
Modular Arithmetic: Extends remainder concepts into a complete number system used in cryptography, computer science, and advanced mathematics.