Sequence of Subsets Let A₁, A₂,..., A₁00 be a se of Some set B. Suppose that all these subsets are different, and that for all k=1,2,..., 99 we have AK NAKH = & and A₁UA₁ B. What is the minimal possible size of B?
Sequence of Subsets Let A₁, A₂,..., A₁00 be a se of Some set B. Suppose that all these subsets are different, and that for all k=1,2,..., 99 we have AK NAKH = & and A₁UA₁ B. What is the minimal possible size of B?
Chapter9: Sequences, Probability And Counting Theory
Section9.5: Counting Principles
Problem 38SE: Suppose a set A has 2,048 subsets. How many distinct objects are contained in A?
Related questions
Question
Transcribed Image Text:Let A₁, A₂, A100 be a sequence of
Subsets
Some Set B. Suppose that
all these Subsets are
of
different, and that
for all k = 1₁ 2₁.99
have
we
A₂ nA = & and A₁UA₁ B.
ки
What is the minimal possible size
4B?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,