Answers>Maths>IB>Article

Prove by mathematical induction that (2C2)+(3C2)+(4C2)+...+(n-1C2) = (nC3).

Firstly, show the equation is true for n = 3 (as this is the samllest n that nC3 is defined): LHS = (2C2) = 1 = (3C3) = RHStherefore, true for n=3.
Then assume true for n = k:(2C2)+(3C2)+(4C2)+...+(k-1C2) = (kC3).
Concider n = k-1:(2C2)+(3C2)+(4C2)+...+(k-1C2)+(kC2) = (kC3)+(kC2) = [k!/(k-3)!3!] + [k!/(k-2)!2!] = (k!/3!)[(1/(k-3)!)+3/(k-2)!] = (k!/3!)[(k-2+3)/(k-2)!] = (k!/3!)[(k+1)/(k-2)!] = [(k+1)!/3!(k-2)!] = (k+1)C3
Equation is true for n = 3. If true for n = k, it is true for n = k+1. Therefore the equation is true for all n >= 3 by induction.

HX
Answered by Henry X. Maths tutor

15158 Views

See similar Maths IB tutors

Related Maths IB answers

All answers ▸

The sum of the first and third term of a geometric sequence is 72. The sum to infinity of this sequence is 360, find the possible values of the common ratio, r.


Find the coordinates that correspond to the maximum point of the following equation: y = −16x^2 + 160x - 256


In Topic 5 (Statistics and Probability) what is the difference between mutually exclusive events and independent events?


Consider the arithmetic sequence 2, 5, 8, 11, ... a) Find U101 b) Find the value of n so that Un = 152


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences