To provide the best experiences, we use technologies like cookies to store and/or access device information. Consenting to these technologies will allow us to process data such as browsing behavior or unique IDs on this site. Not consenting or withdrawing consent, may adversely affect certain features and functions.
The technical storage or access is strictly necessary for the legitimate purpose of enabling the use of a specific service explicitly requested by the subscriber or user, or for the sole purpose of carrying out the transmission of a communication over an electronic communications network.
The technical storage or access is necessary for the legitimate purpose of storing preferences that are not requested by the subscriber or user.
The technical storage or access that is used exclusively for statistical purposes.
The technical storage or access that is used exclusively for anonymous statistical purposes. Without a subpoena, voluntary compliance on the part of your Internet Service Provider, or additional records from a third party, information stored or retrieved for this purpose alone cannot usually be used to identify you.
The technical storage or access is required to create user profiles to send advertising, or to track the user on a website or across several websites for similar marketing purposes.
3 Responses
Love this question! The alternating-sum trick shows up because 11’s “fingerprint” in base 10 is two 1’s in a row, so the natural positional weights repeat 1, −1, 1, −1 as you march left across the digits. Think of it like this: each step to the left multiplies by 10, which lines up with sliding one spot along the repeating pattern 1,1 in 11-so you alternate adding and subtracting the digits to measure how well the number “fits” into stacks of 11. On a two-pan balance, put the digits in odd places on the left and the digits in even places on the right; if the pans balance (their difference is 0 or a multiple of 11), then the number is literally built from whole chunks of 11. For your example 4730, that’s 0 − 3 + 7 − 4 = 0, so the balance is perfect and 4730 is divisible by 11. This “weights-from-the-divisor” idea even generalizes: if a divisor’s decimal form has digits ab…, you repeat those as positional weights (with alternating signs), so for 13 you’d use 1, −3, 1, −3, … and for 101 you’d use 1, 0, −1, 1, 0, −1, …-the alternating-sum pattern for 11 is just the especially clean case where the repeated digits are both 1’s. It’s like stacking Lego bricks of size 11: the alternating sum checks whether the bumps and dents from each digit interlock perfectly; when they do, the tower reaches an exact multiple with no wobble.
Your balance idea is actually perfect here! The alternating-sum rule for 11 is exactly a “weights on a seesaw” story. Each digit is a little weight, and moving one place to the left flips which side of the seesaw it’s on.
Here’s the simple why:
– In our usual base 10, shifting a digit one place left multiplies its value by 10.
– But modulo 11, the number 10 behaves like −1. (Because 10 = 11 − 1, so 10 and −1 leave the same remainder when you divide by 11.)
– That means each step left flips the sign of a digit’s contribution when you’re looking mod 11: units place counts “+”, tens counts “−”, hundreds “+”, thousands “−”, and so on.
If you write your number N with digits d0, d1, d2, … from right to left (units = d0, tens = d1, hundreds = d2, …), then
N = d0 + 10·d1 + 10^2·d2 + 10^3·d3 + …
and since 10 ≡ −1 (mod 11), we have 10^k ≡ (−1)^k (mod 11). So modulo 11,
N ≡ d0 − d1 + d2 − d3 + …
That alternating sum is exactly what the rule tells you to compute. If that sum is a multiple of 11 (including 0), then N is a multiple of 11. Your example 4730: 0 − 3 + 7 − 4 = 0, so yes, divisible by 11.
A couple of nice side views (because my brain likes collecting viewpoints like shiny rocks):
– Pairing trick: Group digits in pairs from the right. For 4730, that’s 47 and 30. Since 100 ≡ 1 (mod 11), 47×100 + 30 ≡ 47 + 30 = 77, which is clearly a multiple of 11. That’s the same idea in disguise.
– Checkerboard picture: Imagine the places colored +, −, +, −, … starting at the units place. Each digit contributes its weight to its color. The “balance” is exactly the difference (sum of + places) − (sum of − places). If that difference is 0 mod 11, the whole number is 0 mod 11.
Why this is so tidy: it’s the base-10 meets 11 romance-because 11 is 10 + 1. More generally, in base b, divisibility by b + 1 uses an alternating sum, since b ≡ −1 (mod b + 1). So this isn’t a weird one-off; it’s a neat pattern that follows you to other bases too.
If you want a friendly walk-through with examples, here’s a short Khan Academy explanation:
https://www.khanacademy.org/math/arithmetic/factors-multiples/divisibility-tests/v/divisibility-rule-for-11
Curious follow-up: do you want to see how a similar idea gives the “sum of digits” test for 9 (because 10 ≡ 1 mod 9), or how to adapt these tricks to other moduli like 7 with a different kind of digit-weighting?
Think of the digits wearing alternating +/− hats on a seesaw: since 10 ≡ −1 (mod 11), N = d0 + d1·10 + d2·10^2 + … ≡ d0 − d1 + d2 − d3 + … (mod 11), so the number is divisible by 11 exactly when that alternating sum is 0 (or a multiple of 11). More explanation: https://en.wikipedia.org/wiki/Divisibility_rule#11; hope this helps!