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

← All study notes

A Pattern That Works Four Times Can Still Be Wrong

Learn to explain a number grid puzzle with algebra, arrange digits for the largest product and prove the choice, justify a divisibility trick from expanded form, and find where a claimed pattern breaks.

Can a number pattern hold for four cases and still be false?

Easily. The claim *the sum of kk consecutive numbers is divisible by kk* works for k=1,3,5k = 1, 3, 5 and 77 — and fails for k=4k = 4, since 7+8+9+10=347 + 8 + 9 + 10 = 34, which is not divisible by 4.

Only algebra can tell you which cases survive. This page covers everything in the CBSE Class 8 Mathematics chapter's second part: explaining a grid puzzle, the largest product, justifying a divisibility trick, and proving or breaking a pattern.

How does algebra explain a number grid puzzle?

Name the centre entry with a letter and write every other entry in terms of it. The letters then do the explaining.

The puzzle. In a calendar, draw a box around any 3×33 \times 3 block of dates. Add all nine. The total is always nine times the centre.

Why. In a calendar each row is 77 days after the one above, and each column steps by 11. So with the centre called nn, the block is

- Top row: n−8n-8, n−7n-7, n−6n-6
- Middle row: n−1n-1, nn, n+1n+1
- Bottom row: n+6n+6, n+7n+7, n+8n+8

Adding them, every offset cancels against its opposite:

(−8−7−6−1+0+1+6+7+8)=0(-8 - 7 - 6 - 1 + 0 + 1 + 6 + 7 + 8) = 0

so the total is simply

9n9n

Checking with numbers. Centre 1515 gives the block 7,8,9,14,15,16,21,22,237, 8, 9, 14, 15, 16, 21, 22, 23:

24+45+66=135,and 9×15=13524 + 45 + 66 = 135, \qquad \text{and } 9 \times 15 = 135

The cancelling of offsets is what makes the trick work, and it explains why the rule survives anywhere on the grid. Every entry above the centre is matched by one equally far below it, so their deviations destroy each other — which is also why the same puzzle works on a 5×55 \times 5 block, giving 25n25n.

Which arrangement of digits gives the largest product?

Put the two largest digits in the tens places, then pair the larger tens digit with the smaller units digit.

Worked example. Use each of 1,2,3,41, 2, 3, 4 once to form two two-digit numbers with the largest possible product.

The tens places must take 44 and 33, since tens are worth ten times as much. That leaves 22 and 11 for the units, and there are two ways to finish:

41×32=1312,42×31=130241 \times 32 = 1312, \qquad 42 \times 31 = 1302

So 41×32=131241 \times 32 = 1312 is the largest, and the larger tens digit took the smaller unit.

Justifying it algebraically.
Let the tens digits be a>ba > b and the units digits be p>qp > q. Compare the two arrangements:

(10a+q)(10b+p)−(10a+p)(10b+q)(10a + q)(10b + p) - (10a + p)(10b + q)

Expanding both products, the 100ab100ab terms and the pqpq terms cancel, leaving

10(ap+bq−aq−bp)=10(a−b)(p−q)10(ap + bq - aq - bp) = 10(a - b)(p - q)

Since a>ba > b and p>qp > q, both brackets are positive, so the difference is positive — meaning (10a+q)(10b+p)(10a + q)(10b + p) is the larger product.

With a=4a = 4, b=3b = 3, p=2p = 2, q=1q = 1 that is 41×3241 \times 32, exactly as found.

The surprise is that pairing the biggest with the biggest is wrong, and the algebra shows why. Choosing 42×3142 \times 31 puts both large digits in one number, which raises that number but lowers the other more — and the product depends on both.

How do you justify a divisibility trick with expanded form?

Write the number in expanded place value form with letters for the digits, then simplify until a factor appears.

Trick 1 — reverse and subtract. Take any two-digit number, reverse its digits and subtract the smaller from the larger. The answer is always divisible by 9.

With digits aa and bb, the number is 10a+b10a + b and its reverse is 10b+a10b + a:

(10a+b)−(10b+a)=9a−9b=9(a−b)(10a + b) - (10b + a) = 9a - 9b = 9(a - b)

A multiple of 9, whatever the digits.

Checking: 72−27=45=9×572 - 27 = 45 = 9 \times 5, and a−b=7−2=5a - b = 7 - 2 = 5. Correct.

Trick 2 — reverse and add. The sum is always divisible by 11:

(10a+b)+(10b+a)=11a+11b=11(a+b)(10a + b) + (10b + a) = 11a + 11b = 11(a + b)

Checking: 72+27=99=11×972 + 27 = 99 = 11 \times 9, and a+b=9a + b = 9. Correct.

Trick 3 — a three-digit number with all digits equal, such as 555555. With digit aa:

100a+10a+a=111a=3×37×a100a + 10a + a = 111a = 3 \times 37 \times a

so it is always divisible by 3 and by 37. Checking: 555÷37=15555 \div 37 = 15.

The method is the same each time, and it is worth naming: replace the digits with letters, expand, and factorise. The factor that comes out is the divisor the trick promises — which is why the trick holds for every number of that shape rather than just the ones you happened to test.

How do you prove a pattern, or find where it fails?

Write the general case with letters. If it factorises, the pattern is proved. If it does not, look for the case where the factor is missing.

Proving. The sum of three consecutive integers is divisible by 3.

n+(n+1)+(n+2)=3n+3=3(n+1)n + (n+1) + (n+2) = 3n + 3 = 3(n + 1)

A multiple of 3 always. Checking: 7+8+9=24=3×87 + 8 + 9 = 24 = 3 \times 8.

Proving again. The sum of five consecutive integers is divisible by 5.

n+(n+1)+(n+2)+(n+3)+(n+4)=5n+10=5(n+2)n + (n+1) + (n+2) + (n+3) + (n+4) = 5n + 10 = 5(n + 2)

Always a multiple of 5. Checking: 3+4+5+6+7=253 + 4 + 5 + 6 + 7 = 25.

Where it fails. The sum of four consecutive integers is divisible by 4.

n+(n+1)+(n+2)+(n+3)=4n+6=2(2n+3)n + (n+1) + (n+2) + (n+3) = 4n + 6 = 2(2n + 3)

Since 2n+32n + 3 is odd, the expression has only one factor of 2 — so it is divisible by 2 but never by 4.

Checking: 7+8+9+10=347 + 8 + 9 + 10 = 34, and 34÷4=8.534 \div 4 = 8.5. The claim is false, and 7,8,9,107, 8, 9, 10 is the counterexample.

The real pattern. The algebra reveals what is actually true: the sum of kk consecutive integers is divisible by kk when kk is odd, and not when kk is even. For odd kk there is a middle term and the offsets cancel; for even kk there is no middle term and a leftover remains.

That is what algebra gives you that examples cannot. Testing k=1,3,5,7k = 1, 3, 5, 7 would have suggested the claim always held — and only the general expression showed both why it works for odd kk and exactly where it breaks.
Exam tip

Exam tip: showing the general case before any example

These questions are marked on the algebra, not on the examples.

Write the general case with letters first — n+(n+1)+(n+2)=3(n+1)n + (n+1) + (n+2) = 3(n+1) — and point to the factor that proves the claim. Then add one numerical check.

For a divisibility trick, use expanded place value form: a two-digit number is 10a+b10a + b, and a three-digit one is 100a+10b+c100a + 10b + c. Expand, simplify, and name the factor.

To disprove a claim, give one specific counterexample with the arithmetic shown both ways: *7+8+9+10=347+8+9+10 = 34, and 34÷4=8.534 \div 4 = 8.5.*

Never offer confirming examples as a proof — and say so if a question asks whether testing cases is enough.

And when a grid puzzle is involved, name the centre as nn and write every cell relative to it.
Did you know

Why do the offsets cancel in a calendar square?

Because the centre sits exactly in the middle of every line through the block.

The entry three places to the left of centre is matched by one three places to the right; the one a week above is matched by one a week below. Each pair adds to twice the centre, and the centre itself adds one more copy — nine copies in total.

That symmetry is why the answer is 9n9n and not something messier. It also predicts the general result without any new work: a 5×55 \times 5 block has the same balance around its centre, so its total must be 25n25n.
Key takeaways

Algebraic proofs and patterns: quick revision

- Name the centre of a grid puzzle nn; in a calendar the 3×33 \times 3 offsets cancel, so the total is 9n9n — and 135=9×15135 = 9 \times 15 confirms it.
- For the largest product from four digits, put the two biggest in the tens places and pair the larger tens digit with the smaller unit: 41×32=131241 \times 32 = 1312 beats 42×31=130242 \times 31 = 1302.
- The algebra behind it: the difference of the two arrangements is 10(a−b)(p−q)10(a-b)(p-q), which is positive.
- Justify divisibility tricks from expanded form: (10a+b)−(10b+a)=9(a−b)(10a+b) - (10b+a) = 9(a-b), the sum gives 11(a+b)11(a+b), and aaa=111a=3×37×aaaa = 111a = 3 \times 37 \times a.
- Prove a pattern by factorising the general case: three consecutive integers give 3(n+1)3(n+1), five give 5(n+2)5(n+2).
- Four consecutive integers give 2(2n+3)2(2n+3), divisible by 2 but never by 4 — so 7+8+9+10=347+8+9+10 = 34 disproves the claim, and the rule holds only for odd kk.

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 Algebra Play — Part 2Create a free account
← Back to all articles