Multiplication rule: dependent events, Mathematics

Assignment Help:

Multiplication Rule: Dependent Events

The joint probability of two events A and B which are dependent is equal to the probability of A multiplied by the probability of B given that A has occurred.

P(A and B)        =P(A) P(B|A)

or P(B and A)    =P(B) . P(A|B)

This formula is derived from the formula of conditional probability of dependent events.

P(B|A) = 1821_multiplication rule.png

Þ P(A and B) = P(B|A).P(A)

Example 

A study of an insurance company shows that the probability of an employee being absent on any given day P(A) is 0.1. Given that an employee is absent, the probability of that employee being absent a second day in succession P(B|A) is 0.4. Events A and B are dependent events because B cannot occur unless event A has occurred. The probability of an employee being absent on two successive days

P(A and B)      =P(A) . P(B|A)

                     =(0.1) (0.4) = 0.04

Thus, the probability of an employee being absent on two successive days is 0.04 or 4% of the time.

Joint probability of several dependent events is equal to the product of the probabilities of occurrence of the preceding outcomes in the sequence.

P(A and B and C...) = P(A) P(B|A) P(C|A and B) .... 


Related Discussions:- Multiplication rule: dependent events

Calculate the value of expected value, The owner of TMH Hospital wants to o...

The owner of TMH Hospital wants to open a new facility in a certain area. He usually builds 25-, 50-, or 100-bed facilities, depending on whether anticipated demand is low, medium

Conscious consumer, a group of 3o students is planning a thanksgiving party...

a group of 3o students is planning a thanksgiving party items needed hats @ $2.50 each.noise makers@$4.00 per pack of 5.Ballons @$5.00 per pack of 10.how many packs of noisemakers

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

Trigonometric Identities, How to sovle or prove whether an equation is a id...

How to sovle or prove whether an equation is a identity?

Regression and correlation analysis on income and ex, regression and correl...

regression and correlation analysis on income and expenditure

Marginal cost & cost function, Marginal cost & cost function  The cost ...

Marginal cost & cost function  The cost to produce an additional item is called the marginal cost and as we've illustrated in the above example the marginal cost is approxima

Dividing, I don''t know how to do the next step like if I had 73 divided by...

I don''t know how to do the next step like if I had 73 divided by 9 wouldn''t 7 go into nine 1 time then you have to do something else but that is the part I don''t understand

Real analysis, .find lim sup Ek and liminf Ek of Ek=[(-(1/k),1] for k odd a...

.find lim sup Ek and liminf Ek of Ek=[(-(1/k),1] for k odd and liminf Ek=[(-1,(1/k)] for k even

each player selects one of her two remaining chips , Consider the followin...

Consider the following parlor game to be played between two players. Each player begins with three chips: one red, one white, and one blue. Each chip can be used only once. To beg

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd