IB Revision Bank
About

← back to Mathematics topic 1

17M.1.AHL.TZ2.H_8

pestleMathematicsAAHLPaper 117M· ahl-1-15-proof-by-induction-contradiction-counterexamplessource ↗

Prove by mathematical induction that ( 2 2 ) + ( 3 2 ) + ( 4 2 ) + + ( n 1 2 ) = ( n 3 ) , where n Z , n 3 .

Markscheme / solution

* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.

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

show true for n = 3      (M1)

LHS = ( 2 2 ) = 1 RHS = ( 3 3 ) = 1      A1

hence true for n = 3

assume true for n = k : ( 2 2 ) + ( 3 2 ) + ( 4 2 ) + + ( k 1 2 ) = ( k 3 )      M1

consider for n = k + 1 : ( 2 2 ) + ( 3 2 ) + ( 4 2 ) + + ( k 1 2 ) + ( k 2 )      (M1)

= ( k 3 ) + ( k 2 )      A1

= k ! ( k 3 ) ! 3 ! + k ! ( k 2 ) ! 2 ! ( = k ! 3 ! [ 1 ( k 3 ) ! + 3 ( k 2 ) ! ] ) or any correct expression with a visible common factor     (A1)

= k ! 3 ! [ k 2 + 3 ( k 2 ) ! ] or any correct expression with a common denominator     (A1)

= k ! 3 ! [ k + 1 ( k 2 ) ! ]

 

Note:     At least one of the above three lines or equivalent must be seen.

 

= ( k + 1 ) ! 3 ! ( k 2 ) ! or equivalent     A1

= ( k + 1 3 )

Result is true for k = 3 . If result is true for k it is true for k + 1 . Hence result is true for all k 3 . Hence proved by induction.     R1

 

Note:     In order to award the R1 at least [5 marks] must have been awarded.

 

[9 marks]

Examiners’ report
[N/A]