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

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.

Step by Step Solution

3.43 Rating (178 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

This proof will be similar to the proof in Example 10 The basis step is clear since for n 2 t... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

923-M-C-M-S (1791).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!