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
Step by Step Solution
3.43 Rating (178 Votes )
There are 3 Steps involved in it
This proof will be similar to the proof in Example 10 The basis step is clear since for n 2 t... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (1791).docx
120 KBs Word File
