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

  • Thread starter Thread starter Chris L T521
  • Start date Start date
  • Tags Tags
    Finite Theory
AI Thread Summary
The problem involves finding the number of elements in the union of two subsets A and B from a universal set U. Given the values n(U) = 130, n(A′) = 55, n(B′) = 69, and n(A∩B) = 23, the solution utilizes set theory identities. By applying the equation n(A∪B) = n(A) + n(B) - n(A∩B) and using the complements, the calculation leads to n(A∪B) = 113. The final answer is that the number of elements in the union of sets A and B is 113.
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.
 
Mathematics 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:
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top