Prove that a set with n elements has n(n l)/2 subsets
Chapter 5, Problem 45E(choose chapter or problem)
Prove that a set with n elements has n(n ? l)/2 subsets containing exactly two elements whenever n is an integer greater than or equal to 2.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer