Unknownnn's question from Yahoo Answers (re: finite math/set theory)

  • Context: MHB 
  • Thread starter Thread starter Chris L T521
  • Start date Start date
  • Tags Tags
    Finite Theory
Click For Summary
SUMMARY

The problem involves calculating the union of two sets A and B within a universal set U, where n(U) = 130, n(A′) = 55, n(B′) = 69, and n(A∩B) = 23. By applying the formulas for set complements and De Morgan's Laws, the calculation yields n(A∪B) = 113. This solution effectively demonstrates the use of set theory identities to derive the union of two sets from given parameters.

PREREQUISITES
  • Understanding of finite math concepts, specifically set theory.
  • Familiarity with Venn diagrams and their applications in set operations.
  • Knowledge of De Morgan's Laws in set theory.
  • Ability to manipulate set identities and equations.
NEXT STEPS
  • Study the application of De Morgan's Laws in more complex set problems.
  • Explore additional set theory identities and their proofs.
  • Practice solving finite math problems involving Venn diagrams and set operations.
  • Learn about the implications of set theory in probability and statistics.
USEFUL FOR

Students and educators in mathematics, particularly those focusing on finite math and set theory, as well as anyone seeking to enhance their problem-solving skills in these areas.

Chris L T521
Gold Member
MHB
Messages
913
Reaction score
0
Here is the question:

Finite math problem involving venn diagrams? said:
Let U be a universal set with subsets A and B such that n(U) = 130, n(A′) = 55, n(B′) = 69, and n(A∩B) = 23. Find n(A∪B).

n(A∪B) = halp? plox

Here is a link to the question:

Finite math problem involving venn diagrams? - Yahoo! Answers

I have posted a link there to this topic so the OP can find my response.
 
Physics news on Phys.org
Hi Unknownnn,

We will use the following identities/equations in our computation:

- $n(A^{\prime})=n(U)-n(A)$;
- $n(A\cup B)=n(A)+n(B)-n(A\cap B)$
- $n((A\cap B)^{\prime})=n(A^{\prime}\cup B^{\prime})$ and $n((A\cup B)^{\prime})=n(A^{\prime}\cap B^{\prime})$ (De Morgan's Laws)

To get the answer we seek, let us use the second equation, but with complements instead of regular sets since we know the values of $n(A^{\prime})$ and $n(B^{\prime})$:
\[n(A^{\prime}\cup B^{\prime})=n(A^{\prime})+n(B^{\prime})-n(A^{\prime}\cap B^{\prime}).\]
Using the equations I provided above, we see that
\[\begin{aligned}n(A^{\prime}\cup B^{\prime})=n((A\cap B)^{\prime})= n(U)-n(A\cap B) &= n(A^{\prime})+n(B^{\prime}) -n((A\cup B)^{\prime})\\ &= n(A^{\prime})+n(B^{\prime}) -(n(U)-n(A\cup B))\\ &= n(A^{\prime})+n(B^{\prime})-n(U)+n(A\cup B)\end{aligned} \]

Solving for $n(A\cup B)$ gives us
\[n(A\cup B)=2n(U)-n(A^{\prime})-n(B^{\prime})-n(A\cap B)=260-55-69-23=113\]

Thus, $n(A\cup B)=113$.
 
Last edited:

Similar threads

Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K