A set A of n elements has n(n-1)/2 subsets of 2 elements
View Single Post
Dec11-11, 01:26 PM
* Base step n=2: 2(2-1)/2= 1 subset of two elements.
* Inductive step: assuming the statement holds for n=k, that is a set A of k elements has k(k-1)/2 (hypothesis)
We want to show that it also holds for n=k+1, that is a set A of k+1 has (k+1)(k+1-1)/2 elements.
A set A of k elements has k(k-1)/2 subsets of two elements, as you said.
Suppose you add a new element to set A. How many new subsets can be created where one of the elements of these subsets is the new element?