Contents
Overview
The divisibility rule of 11 states that a number is divisible by 11 if the difference between the sum of digits at odd positions and the sum of digits at even positions equals zero or is itself divisible by 11.[2] This elegant rule eliminates the need for actual division, allowing quick mental verification of divisibility. The rule works regardless of whether you count positions from the left or right, though consistency matters for accuracy.[1][3]
⚙️ How to Apply It
To apply the rule, first assign positions to each digit, typically starting from the rightmost digit as position 1.[3] Next, separate the digits into two groups: those in odd positions (1, 3, 5, etc.) and those in even positions (2, 4, 6, etc.).[1] Add all digits in odd positions together, then add all digits in even positions separately. Finally, calculate the absolute difference between these two sums.[3] If the result is 0 or divisible by 11 (such as 11, 22, 33, etc.), the original number is divisible by 11.[2] For example, with 2728: odd positions (2 + 2 = 4) and even positions (7 + 8 = 15) yield a difference of 11, confirming divisibility.[3]
🧮 Why It Works
The rule's mathematical foundation lies in modular arithmetic and the properties of powers of 10.[3] In the decimal system, place values correspond to powers of 10, which alternate between 1 and -1 when taken modulo 11.[3] This alternating pattern means that the sum of digits at odd positions minus the sum at even positions directly reflects whether the entire number is divisible by 11.[6] An alternative formulation uses the alternating sum method: subtract and add digits alternately from left to right (2 – 7 + 2 – 8 = -11 for 2728), and if this result is divisible by 11, so is the original number.[6]
💡 Practical Applications
The divisibility rule of 11 has practical applications in mathematics education, mental arithmetic, and number theory.[3] It helps students quickly verify divisibility without performing long division, making it valuable for grade-level mathematics instruction.[4] The rule also demonstrates broader principles of modular arithmetic that extend to other divisibility tests and cryptographic applications. Understanding this rule builds intuition about how numbers behave under division and strengthens foundational mathematical reasoning.
Key Facts
- Year
- Ancient mathematical principle
- Origin
- Number theory and modular arithmetic
- Category
- science
- Type
- concept
Frequently Asked Questions
What's the simplest way to check if a number is divisible by 11?
Count positions from the right starting at 1. Add all digits in odd positions, add all digits in even positions, then find the difference. If the difference is 0 or divisible by 11, your number is divisible by 11.[2][3]
Does the alternating sum method work the same way?
Yes, but it's a different approach. Starting from the left, alternate between subtracting and adding digits (first digit minus second plus third minus fourth, etc.). If this alternating sum is divisible by 11, so is the original number.[6]
Why does this rule actually work mathematically?
In the decimal system, powers of 10 alternate between 1 and -1 when taken modulo 11. This means the positional values naturally create an alternating pattern that directly reflects divisibility by 11.[3]
Can I use this rule for really large numbers?
Absolutely. The rule works for numbers of any size because it's based on the mathematical properties of modular arithmetic, not the magnitude of the number.[1]
What if the difference between my sums is negative?
Use the absolute value (the positive version). For example, if you get -11, that's still divisible by 11, so your number passes the test.[6]