Prove that a set with n elements has n(n 1)/2 subsets containing exactly two elements whenever

Question:

Prove that a set with n elements has n(n − 1)/2 subsets containing exactly two elements whenever n is an integer greater than or equal to 2.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: