Bonus: For a nonnegative integer $n$, let $s_n$ be the number of subsets of an $n$-element set. Give a recursive definition of $s_n$ for $n \ge 0$. Can you use this to explain why the order of the power set of an $n$-element set is $2^n$?
Added by Michelle M.
Close
Step 1
The number of subsets of an n-element set is given by the formula 2^n. This means that for any nonnegative integer n, the number of subsets of an n-element set is 2^n. Show more…
Show all steps
Your feedback will help us improve your experience
Gregory Higby and 63 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
Show that the number of subsets of a set containing $n$ elements is $2^{n}$.
Suppose that a set contains $n$ elements. Argue that the total number of subsets of this set is $2^{n}$.
Madhur L.
Power Sets. Let X be a set. Define the power set of X, denoted P(X), to be the set of all subsets of X. For example, P({a,b}) = {∅, {a}, {b}, {a,b}}. For every positive integer n, show that a set with exactly n elements has a power set with exactly 2^n elements.
Rukhmani J.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD