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
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:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top