All 303 families

GB-41-05-001 · Algebraic divisibility proof

For any integer n, prove that (2n+9)2−(2n+3)2(2n+9)^2-(2n+3)^2 is divisible by 6.

Algebraic Proof (Prove a Multiple) Booklet p. 32–33
Method
1) Form expression
2) Expand using grids
3) Simplify
4) Factorise out the divisor
5) Write a conclusion
Worked Example (GB-41-05-001)
1)
Form the expression (2n+9)2−(2n+3)2(2n+9)^2-(2n+3)^2. Expand each square using a grid:
2)
×2n2n99
2n2n4n24n^218n18n
9918n18n8181
3)
×2n2n33
2n2n4n24n^26n6n
336n6n99
4)
Subtract the whole second expansion: (4n2+36n+81)−(4n2+12n+9)=24n+72(4n^2+36n+81)-(4n^2+12n+9)=24n+72.
5)
Factorise out the required divisor: 24n+72=6(4n+12)24n+72=6(4n+12).
6)
For integer n, 4n+124n+12 is an integer. The expression is therefore divisible by 66.
Ans = 12(2n+6)12(2n+6)