Introduction to Divisibility
In mathematics, divisibility is a fundamental concept that describes whether one integer can be divided by another without leaving a remainder. When we say a number is "divisible" by another, we mean that the result of the division is a whole number (an integer). Understanding divisibility rules allows us to analyze large numbers quickly, perform mental arithmetic, simplify fractions, and find prime factors without performing lengthy long division calculations.
Among all the divisibility rules in the decimal (base-10) system, the rule for the number 5 is one of the easiest, most intuitive, and most widely used. Whether you are a student learning basic arithmetic, a programmer optimizing an algorithm, or a puzzle enthusiast, mastering the divisibility rule for 5 is an essential mathematical tool.
The Basic Rule: What Is the Divisibility Rule for 5?
The divisibility rule for 5 states: A whole number is divisible by 5 if and only if its last digit (the units digit) is either 0 or 5.
This rule is incredibly straightforward because it requires you to look at only one digit, regardless of how large the number is. It does not matter if the number has three digits, ten digits, or a hundred digits; the only digit that determines divisibility by 5 is the very last one on the right.
Immediate Examples
45: The last digit is 5. Therefore, 45 is divisible by 5 (45 ÷ 5 = 9).
120: The last digit is 0. Therefore, 120 is divisible by 5 (120 ÷ 5 = 24).
6,785: The last digit is 5. Therefore, 6,785 is divisible by 5 (6,785 ÷ 5 = 1,357).
93: The last digit is 3. Since 3 is neither 0 nor 5, 93 is not divisible by 5 (93 ÷ 5 = 18.6).
1,000,004: The last digit is 4. Since 4 is neither 0 nor 5, this large number is not divisible by 5.
Why Does the Rule Work? A Mathematical Proof
To understand why this rule works universally, we must look at how numbers are structured in our standard decimal (base-10) system. Every number we write is a shorthand representation of a sum of powers of 10, scaled by the digits in each place value.
The Decimal Expansion of a Number
Let us represent any positive integer N with digits an, an-1, ..., a1, a0. We can write this number in its expanded algebraic form as follows:
N = (an × 10n) + (an-1 × 10n-1) + ... + (a1 × 101) + (a0 × 100)
In this expansion, a0 represents the units digit, a1 represents the tens digit, a2 represents the hundreds digit, and so on. For example, the number 3,485 can be written as:
3,485 = (3 × 103) + (4 × 102) + (8 × 101) + (5 × 100)
3,485 = 3,000 + 400 + 80 + 5
Analyzing Divisibility by 5 in the Expansion
Now, let us examine the divisibility of each term in the general expansion by 5. Notice the base of our number system, 10. The number 10 is directly divisible by 5, since 10 = 2 × 5.
Because 10 is divisible by 5, any positive integer power of 10 is also divisible by 5:
101 = 10 (divisible by 5)
102 = 100 (divisible by 5)
103 = 1,000 (divisible by 5)
10k is divisible by 5 for any integer k ≥ 1
Since each power of 10 (from 101 onwards) is a multiple of 5, any digit multiplied by these powers of 10 will also result in a multiple of 5. Therefore, the entire sum of terms from the tens place up to the highest place value is guaranteed to be divisible by 5:
(an × 10n) + ... + (a1 × 101) is always a multiple of 5.
This leaves us with only the very last term: a0 × 100, which is simply the units digit a0. Therefore, the divisibility of the entire number N by 5 depends entirely on the divisibility of its units digit a0 by 5.
Evaluating the Units Digit
The units digit a0 can only be a single-digit integer from the set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. Let us test which of these digits are divisible by 5:
0 ÷ 5 = 0 (No remainder, so 0 is divisible by 5)
1, 2, 3, 4 are not divisible by 5
5 ÷ 5 = 1 (No remainder, so 5 is divisible by 5)
6, 7, 8, 9 are not divisible by 5
Thus, the only units digits that allow the entire number to be divisible by 5 are 0 and 5. This mathematically proves our rule.
Proof Using Modular Arithmetic
For students and enthusiasts interested in higher-level mathematics, modular arithmetic offers a highly elegant and concise way to prove this rule. Modular arithmetic is arithmetic dealing with remainders. We write A ≡ B (mod M) if A and B leave the same remainder when divided by M.
We want to find the remainder of a number N when divided by 5. Let us write N as:
N = 10Q + R
Where Q represents all the digits before the units digit, and R is the units digit (0 through 9). Since 10 is congruent to 0 modulo 5:
10 ≡ 0 (mod 5)
We can substitute this into our equation for N:
N = 10Q + R ≡ 0(Q) + R (mod 5)
N ≡ R (mod 5)
This congruence tells us that any number N leaves the exact same remainder when divided by 5 as its units digit R does. For N to be perfectly divisible by 5, the remainder must be 0:
R ≡ 0 (mod 5)
Since R is a single digit (0 ≤ R ≤ 9), the only values of R that satisfy this are R = 0 and R = 5.
Connecting to the Multiples of 5
Another intuitive way to grasp this rule is to observe the pattern in the sequence of multiples of 5. When we list the first few multiples of 5, a clear visual pattern emerges:
5 × 1 = 5
5 × 2 = 10
5 × 3 = 15
5 × 4 = 20
5 × 5 = 25
5 × 6 = 30
5 × 7 = 35
5 × 8 = 40
5 × 9 = 45
5 × 10 = 50
Notice the units column: it alternates strictly and infinitely between 5 and 0. This periodic behavior occurs because adding 5 to a number ending in 5 will always result in a number ending in 0 (since 5 + 5 = 10, carrying over to the next place value), and adding 5 to a number ending in 0 will always result in a number ending in 5.
Practical Applications of the Divisibility Rule for 5
Knowing this rule is not just an academic exercise; it has several practical uses in everyday mathematics and problem-solving:
1. Prime Factorization
When breaking down a large composite number into its prime factors, the divisibility rule for 5 helps you quickly identify if 5 is one of the prime factors. For example, if you are factoring 1,225, you can instantly see it ends in 5, meaning you can divide it by 5 to begin your factorization tree.
2. Simplifying Fractions
If you are asked to simplify a fraction like 85/150, you can instantly observe that the numerator ends in 5 and the denominator ends in 0. This means both numbers are divisible by 5. You can quickly divide both by 5 to simplify the fraction to 17/30.
3. Real-World Currency and Counting
Many financial transactions and physical items are grouped in fives or tens. Knowing this rule helps in verifying totals quickly when counting cash, inventory, or tally marks.
Key Takeaways
The Rule: A number is divisible by 5 if its last digit is 0 or 5.
The Reason: Because 10 is divisible by 5, all place values higher than the units place (tens, hundreds, thousands) are automatically divisible by 5.
The Proof: Both algebraic expansion and modular arithmetic prove that a number's divisibility by 5 depends entirely on its units digit.
The Pattern: Multiples of 5 always end in an alternating pattern of 5, 0, 5, 0...
