MHB How Do You Calculate P(A∩B) in Probability Theory?

  • Thread starter Thread starter karush
  • Start date Start date
  • Tags Tags
    Probability
karush
Gold Member
MHB
Messages
3,240
Reaction score
5
View attachment 1135
this is an image of the problem as given, mostly to avoid typo's, but (b) seems to contain a notation that I don't recognize.

well for $$(a)$$ find $$p(A\cap B)$$

from the counting Formula:
$$n(A\cup B)=n(A)+n(B)-n(A\cap B)$$

replacing $n$ for $p$ and isolating $$p(A\cap B)$$
$$p(A\cup B)-p(A)-p(B)=p(A\cap B)$$
so..
$1-0.6-0.8=-0.4=p(A\cap B)$

(b) ?
 
Mathematics news on Phys.org
Hi karush,

For (a) you have the right idea but mixed up your signs a bit.

$P[A \cup B]=P[A]+P-P[A \cap B]$. We want to solve for $P[A \cap B]$.

$P[A \cap B]=P[A]+P-P[A \cup B]$.

Can you solve it from there?

(b) I'm going to guess that the "C" means "compliment". Normally we write this as $P[A' \cup B']$ or $P[A^c \cup B^c]$. There are some special and useful rules, called De Morgan's laws, that allow us to manipulate expressions like this. Have you seen these before?
 
$$P[A \cap B]=P[A]+P-P[A \cup B]$$

$$0.4=0.6+0.8-1$$

i am am looking at De Morgan's laws it new to me...

I did see this

https://www.physicsforums.com/attachments/1136
 
Exactly! :)

Notice that $P[A' \cup B']=P[A \cap B]'=1-P[A \cap B]$ and you'll be done.
 
Jameson said:
Exactly! :)

Notice that $P[A' \cup B']=P[A \cap B]'=1-P[A \cap B]$ and you'll be done.

$$P[A' \cup B']=P[A \cap B]'=1-P[A \cap B]$$
$$

0.6=1-0.4$$

really that it!
 
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