Question

# Find the number of subsets of the given set. The set of the letters of “uncopyrightable,” which is the longest English word with no repeated letters

Solution

Verified
Step 1
1 of 2

A set of $n$ elements has $2^{n}$ subsets.

$\implies$ The given set has $2^{15}=32,768$ subsets. ( $15$ elements )

$\therefore 32,768$ subsets.

## Recommended textbook solutions

#### Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences

14th EditionISBN: 9780134675985 (2 more)Christopher J. Stocker, Karl E. Byleen, Michael R. Ziegler, Raymond A. Barnett
3,808 solutions

#### Finite Mathematics

11th EditionISBN: 9780321979438 (1 more)Margaret L. Lial, Nathan P. Ritchey, Raymond N. Greenwell
3,566 solutions

#### Mathematical Excursions

3rd EditionISBN: 9781111578497Daniel K. Clegg, Joanne Lockwood, Richard D. Nation, Richard N. Aufmann
4,865 solutions

#### Mathematical Excursions

4th EditionISBN: 9781305965584Daniel K. Clegg, Joanne Lockwood, Richard D. Nation, Richard N. Aufmann
4,593 solutions