MHB Probability of Order Accuracy from A, C, or Not Accurate

jridgeman99
Messages
5
Reaction score
0
This is a problem I got for a review in probability and statistics

The layout of the data is as follows:
A B C D
Order Accurate- 315 277 234 120
Order not - 34 50 35 18
accurate

Like I said previously this is an or problem and this means it is an addition rule problem. The problem wants me to compute
the probability that whenever a single order is selected what is the probability that this probability is from restaurant A or C or an order that is not accurate.
I know the answer is .633 I just can't figure out how to set up the problem.
 
Mathematics news on Phys.org
jridgeman99 said:
This is a problem I got for a review in probability and statistics

The layout of the data is as follows:
A B C D
Order Accurate- 315 277 234 120
Order not - 34 50 35 18
accurate

Like I said previously this is an or problem and this means it is an addition rule problem. The problem wants me to compute
the probability that whenever a single order is selected what is the probability that this probability is from restaurant A or C or an order that is not accurate.
I know the answer is .633 I just can't figure out how to set up the problem.

[(all A) + (all C) + (inaccurate B) + (inaccurate D)]/total

$\dfrac{(315+34)+(234+35)+50+18}{1083} = 0.6334$
 
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.

Similar threads

Replies
1
Views
2K
Replies
1
Views
1K
Replies
6
Views
5K
Replies
2
Views
3K
Replies
2
Views
2K
Replies
4
Views
2K
Back
Top