Free Mathematics Class 8 CBSE notes · practise this chapter with an AI quiz

← All study notes

Adding Digits Alternately Tests a Number for Eleven

Learn the digit-sum tests for 3 and 9, the alternating-sum test for 11, the algebra that proves why all three work, and how to crack cryptarithm puzzles in addition and multiplication.

Is there a quick test for divisibility by 11?

There is. Add the digits in alternate positions, subtract one total from the other, and check whether the answer is divisible by 11.

For 13311331: (1+3)−(3+1)=0(1 + 3) - (3 + 1) = 0, which is divisible by 11 — and indeed 1331÷11=1211331 \div 11 = 121.

This page covers everything in the CBSE Class 8 Mathematics chapter's second part: the tests for 3 and 9, the test for 11, the algebra that proves them, and cryptarithm puzzles.

How do the digit-sum tests for 3 and 9 work?

Add all the digits. A number is divisible by 3 if its digit sum is divisible by 3, and by 9 if its digit sum is divisible by 9.

Worked example. Test 42874287:

4+2+8+7=214 + 2 + 8 + 7 = 21

Since 2121 is divisible by 3, so is 42874287 — and 4287÷3=14294287 \div 3 = 1429. But 2121 is not divisible by 9, so 42874287 is not divisible by 9 either.

Worked example. Test 58325832:

5+8+3+2=185 + 8 + 3 + 2 = 18

Since 1818 is divisible by both 3 and 9, so is 58325832 — and 5832÷9=6485832 \div 9 = 648.

Worked example. Test 74157415:

7+4+1+5=177 + 4 + 1 + 5 = 17

Not divisible by 3, so 74157415 is not either.

If the digit sum is still large, repeat the process. For 99 99999\,999 the sum is 4545, and 4+5=94 + 5 = 9 — divisible by 9.

The relationship between the two tests is worth stating. Every number divisible by 9 is automatically divisible by 3, since 3 is a factor of 9 — but not the reverse, as 42874287 shows. So a number passing the 3 test still needs the 9 test separately.

How does the alternating-sum test for 11 work?

Take the digits from the right. Add those in the odd positions, add those in the even positions, and subtract one total from the other. If the result is 00 or a multiple of 11, the number is divisible by 11.

Worked example. Test 13311331. From the right the digits are 1,3,3,11, 3, 3, 1:

- Odd positions (1st and 3rd): 1+3=41 + 3 = 4
- Even positions (2nd and 4th): 3+1=43 + 1 = 4

4−4=04 - 4 = 0

Divisible by 11, and 1331÷11=1211331 \div 11 = 121.

Worked example. Test 61 80961\,809. From the right: 9,0,8,1,69, 0, 8, 1, 6:

- Odd positions: 9+8+6=239 + 8 + 6 = 23
- Even positions: 0+1=10 + 1 = 1

23−1=2223 - 1 = 22

Since 2222 is a multiple of 11, so is 61 80961\,809 — and 61 809÷11=561961\,809 \div 11 = 5619.

Worked example. Test 45874587. From the right: 7,8,5,47, 8, 5, 4:

- Odd positions: 7+5=127 + 5 = 12
- Even positions: 8+4=128 + 4 = 12

12−12=012 - 12 = 0

So 45874587 is divisible by 11, giving 417417.

Worked example that fails. Test 12341234: (4+2)−(3+1)=6−4=2(4 + 2) - (3 + 1) = 6 - 4 = 2. Not a multiple of 11, so 12341234 is not divisible by 11.

A result of 0 counts as divisible, and that is the case most often doubted. Zero is a multiple of 11, since 11×0=011 \times 0 = 0 — so an alternating sum of 0 is a pass, not a failure.
Formula

Why do these tests actually work?

Write the number in expanded place value form and split off the parts that are already divisible.

For 3 and 9. Take a three-digit number with digits aa, bb, cc:

100a+10b+c100a + 10b + c

Rewrite 100100 as 99+199 + 1 and 1010 as 9+19 + 1:

=99a+a+9b+b+c=9(11a+b)+(a+b+c)= 99a + a + 9b + b + c = 9(11a + b) + (a + b + c)

The part 9(11a+b)9(11a + b) is divisible by 9 — and therefore also by 3 — whatever the digits are. So the whole number is divisible by 9 exactly when the remaining part, the digit sum (a+b+c)(a + b + c), is divisible by 9. The same argument with 3 gives the test for 3.

For 11. Start from the same expansion and rewrite 100100 as 99+199 + 1 and 1010 as 11−111 - 1:

100a+10b+c=99a+a+11b−b+c=11(9a+b)+(a−b+c)100a + 10b + c = 99a + a + 11b - b + c = 11(9a + b) + (a - b + c)

The part 11(9a+b)11(9a + b) is divisible by 11 whatever the digits are. So the number is divisible by 11 exactly when (a−b+c)(a - b + c) is — and a−b+ca - b + c is precisely the alternating sum.

Checking on 132132, where a=1a = 1, b=3b = 3, c=2c = 2:

a−b+c=1−3+2=0a - b + c = 1 - 3 + 2 = 0

so 132132 is divisible by 11, and 132÷11=12132 \div 11 = 12.

The idea behind both proofs is the same and is worth naming: split the number into a part you already know divides, plus a small remainder. Whatever the large part does is irrelevant, so the whole question reduces to the remainder — which is why the tests involve only the digits and not the number's size.

How do you solve a cryptarithm puzzle?

In a cryptarithm, each letter stands for a different digit, and the same letter always means the same digit. Work from the column that gives the most information, usually the units.

Addition puzzle. Find the digit AA:

3A+25=623A + 25 = 62

where 3A3A means the two-digit number with tens digit 3 and units digit AA.

- Units column: A+5A + 5 must end in 22. So A+5=12A + 5 = 12, giving A=7A = 7 and a carry of 1.
- Tens column: 3+2+1=63 + 2 + 1 = 6, which matches.

So A=7A = 7, and checking: 37+25=6237 + 25 = 62. Correct.

Multiplication puzzle. Find the digit AA:

1A×6=961A \times 6 = 96

- Units: A×6A \times 6 must end in 66. Testing digits, A=1A = 1 gives 6 and A=6A = 6 gives 36 — both end in 6.
- Try A=1A = 1: 11×6=6611 \times 6 = 66, which is not 96.
- Try A=6A = 6: 16×6=9616 \times 6 = 96. Correct.

So A=6A = 6.

Using a divisibility test in a puzzle. Find the digit xx so that 47x47x is divisible by 9. The digit sum is 4+7+x=11+x4 + 7 + x = 11 + x, and the next multiple of 9 is 18, so

11+x=18⇒x=711 + x = 18 \quad \Rightarrow \quad x = 7

Checking: 477÷9=53477 \div 9 = 53. Correct.

The strategy that works is to start where the choices are fewest and to test the candidates rather than guess. The units column usually narrows a letter to one or two possibilities, and trying each against the rest of the sum settles it — which is exactly what separated A=6A = 6 from A=1A = 1 above.
Exam tip

Exam tip: writing out the digit sum before deciding

Divisibility questions are quick marks, and the working is what earns them.

Write the digit sum or the alternating sum on its own line before stating your conclusion: *4+2+8+7=214 + 2 + 8 + 7 = 21, divisible by 3, so 4287 is divisible by 3.* Both the sum and the verdict are marked.

For the test for 11, count positions from the right and show both group totals before subtracting. And remember that a result of 0 means divisible.

Test 3 and 9 separately — passing the 3 test does not settle 9.

For a justification question, show the expanded form and the split, as 100a+10b+c=9(11a+b)+(a+b+c)100a + 10b + c = 9(11a + b) + (a + b + c). That single line is the proof.

And in a cryptarithm, check your answer by writing out the completed sum in full digits.
Did you know

Why does only the digit sum matter, not the size of the number?

Because every place value except the ones is already a multiple of 9, plus 1.

Ten is 9+19 + 1, a hundred is 99+199 + 1, a thousand is 999+1999 + 1. So each digit contributes a chunk that 9 divides exactly, plus one copy of the digit itself. The chunks can be ignored entirely, and all that is left over is the digits added together.

That is why a number as large as 99 99999\,999 can be settled by adding five small digits. The size of the number lives entirely in the part that 9 already divides — and the digit sum is the only piece that could possibly cause a remainder.
Key takeaways

Divisibility tests and cryptarithms: quick revision

- A number is divisible by 3 if its digit sum is, and by 9 if its digit sum is — so 42874287 has digit sum 21 and passes for 3 but not for 9.
- Every number divisible by 9 is divisible by 3, but not the reverse.
- For 11, take the alternating sum of the digits from the right: 61 80961\,809 gives 23−1=2223 - 1 = 22, so it is divisible by 11. A result of 0 counts as divisible.
- The proofs split the number into a divisible part plus a remainder: 100a+10b+c=9(11a+b)+(a+b+c)100a + 10b + c = 9(11a+b) + (a+b+c) for 9, and =11(9a+b)+(a−b+c)= 11(9a+b) + (a-b+c) for 11.
- In a cryptarithm each letter is a distinct digit; start with the units column, narrow the candidates and test them.
- Combine the tools where useful: 47x47x is divisible by 9 when 11+x=1811 + x = 18, so x=7x = 7.

You will remember all of this far better after answering five questions on it than after reading it twice.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Number Play — Part 2Create a free account
← Back to all articles