- 3

- 0

## Main Question or Discussion Point

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

**A**equals**n(n-1)/2**.- Thread starter Ella087
- Start date

- 3

- 0

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

- 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?

mathman

Science Advisor

- 7,716

- 398

- 268

- 6

- Last Post

- Replies
- 0

- Views
- 1K

- Last Post

- Replies
- 4

- Views
- 5K

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 4

- Views
- 582

- Last Post

- Replies
- 7

- Views
- 1K

- Replies
- 2

- Views
- 1K

- Last Post

- Replies
- 4

- Views
- 72K