Hello,(adsbygoogle = window.adsbygoogle || []).push({});

I am supposed to show that the number of proper subsets of S = {a1, a2, ... an} is 2^n - 1.

I know that the number of subsets of S is 2^n. And I know also know that the number of proper subsets of S is 2^n - 1 since S is not a proper subset of itself.

But how do I show that? I could show this by brute force. But I can't seem to think of a way to show it in a more efficient way.

**Physics Forums - The Fusion of Science and Community**

# The Number Of Proper Subsets is 2^n - 1

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: The Number Of Proper Subsets is 2^n - 1

Loading...

**Physics Forums - The Fusion of Science and Community**