- #1

Ella087

- 3

- 0

Prove by induction that the number of 2-subsets of an n-set

**A**equals**n(n-1)/2**.You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter Ella087
- Start date

- #1

Ella087

- 3

- 0

Prove by induction that the number of 2-subsets of an n-set **A** equals **n(n-1)/2**.

- #2

Pere Callahan

- 586

- 1

Say the 2-set is A= {1,2} and the three set is B={1,2,3}. A 2-subset of A is certainly also a 2-subset of B, so you have {1,2}, but there are more 2-subsets of B, those containing 3. What can you pair 3 with? Apparently with any of the elements of A, which gives you another two 2-subsets of B, namely {1,3},{2,3}.

So in total there are three 2-subsets of a set B with three elements, in agreement with your formula.

Can you generalize this?

- #3

mathman

Science Advisor

- 8,087

- 550

- #4

ssd

- 268

- 6

Share:

- Last Post

- Replies
- 4

- Views
- 624

- Last Post

- Replies
- 4

- Views
- 1K

- Last Post

- Replies
- 8

- Views
- 557

- Last Post

- Replies
- 4

- Views
- 3K

MHB
Set proof

- Last Post

- Replies
- 5

- Views
- 656

- Last Post

- Replies
- 2

- Views
- 1K

- Last Post

- Replies
- 1

- Views
- 316

- Last Post

- Replies
- 1

- Views
- 734

- Replies
- 8

- Views
- 447

- Last Post

- Replies
- 1

- Views
- 2K