If a set has n elements then show that it has 2^n subsets.
Added by Javier R.
Step 1
For a set with 0 elements, there is only one subset, the empty set. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Eric Carlsen and 77 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove that all sets with $n$ elements have $2^{\prime \prime}$ subsets. Count the empty set $\empty set$ and the whole set as subsets.
Precalculus Preview
A Note on Mathematical Proof; Mathematical Induction
Show that the number of subsets of a set containing $n$ elements is $2^{n}$.
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 .
Induction and Recursion
Mathematical Induction
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Watch the video solution with this free unlock.
EMAIL
PASSWORD