Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 2 - Set Theory - 2.2 Subsets - Concept and Vocabulary Check - Page 67: 4

Answer

$2^{n}$

Work Step by Step

The number of distinct subsets of a set with n elements is $2^{n}$. The power of 2 is the same as the number of elements in the set. Using inductive reasoning, if the set contains n elements, then the number of subsets that can be formed is $2^{n}$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.