Combination and induction question

AI Thread Summary
The discussion revolves around proving the mathematical induction statement that the sum of combinations from j=2 to n, C(j,2), equals C(n+1,3) for integers n greater than 1. Initially, there was confusion regarding the basis step, particularly about the interpretation of C(j,2) and the limits of the summation. Clarification was provided that the summation runs from j=2 to n, not just C(2,2). An example was given for n=4 to illustrate the summation process, which helped the original poster understand the problem better. The conversation emphasizes the importance of correctly interpreting summation notation in combinatorial proofs.
romo84
Messages
8
Reaction score
0

Homework Statement


I need some help with this question please.

Prove using mathematical induction that Σn, j=2 C(j,2) = C(n+1,3) whenever n is an integer greater than 1.

I am not even sure how to get the basis step because it does not makes sense to me to calculate C(j,2), wouldn't that always be C(2,2)?

Thanks for your help.


Homework Equations


The "C" is for "Combination"


The Attempt at a Solution

 
Physics news on Phys.org
welcome to pf!

hi romo84! welcome to pf! :smile:

(try using the X2 and X2 icons just above the Reply box :wink:)
romo84 said:
I am not even sure how to get the basis step because it does not makes sense to me to calculate C(j,2), wouldn't that always be C(2,2)?

no, it means ∑j=2n C(j,2) :wink:
 
actually, the n is located above the summation symbol, it is not j=2^n.

any advise?
 
yes i know, but i can't type that! :biggrin:

it means the sum from j = 2 up to j = n

for example, for n = 4, it means (2,2) + (3,2) + (4,2) = (5,3) :smile:
 
Thanks very much, I understand what the question is asking now!
 

Similar threads

Back
Top