Find the probability, Mathematics

A bag contains 19 tickets, numbered from 1 to 19. A ticket is drawn and then another ticket is drawn without replacement .Find the probability that both tickets will show even numbers.

A) 4/9     B) 3/9    C) 2/9     D) 1/9 

Let A be the event of drawing an even numbered ticket in first draw and B be the event of drawing an even numbered ticket in the second draw.Then,

Required probability =P(A∩B)=P(A)P(B/A)

Since there are 19 tickets .numbered 1 to 19,in the bag out of which 9 are even numbered viz.2,4,6,8,10,12,14,16,18.Therefore

P(A)=9/19

Since the ticket drawn in the first draw is not replaced, therefore second ticket drawn is from the remaining 18 tickets, out of which 8 are even numbered.

P(B/A)=8/18=4/9

Hence, Required probability=P(A∩B)

=P(A)P(B/A)

=9/19x4/9=4/9

Posted Date: 7/23/2012 3:25:29 AM | Location : United States







Related Discussions:- Find the probability, Assignment Help, Ask Question on Find the probability, Get Answer, Expert's Help, Find the probability Discussions

Write discussion on Find the probability
Your posts are moderated
Related Questions
how can I compare fractions with unlike denominators?


who discovered unitary method

solve the parameter estimate in v=a+bx+cx^2

Definition 1.   Given any x 1  & x 2   from an interval  I with x 1 2  if f ( x 1 ) 2 ) then f ( x ) is increasing on I. 2.   Given any x 1  & x 2  from an interval

what is the difference between North America''s part of the total population and Africa''s part

find the magnitude of the following vectors:5i+7j

ne nje tabak letre me permasa 100cm dhe 55cm nje nxenes duhet te ndertoje nje kuboide me permasa 20cm,25cm,40cm. a mund ta realizoje kete, ne qofte se per prerjet dhe ngjitjet humb

a) Specify that a tree has at least 2 vertices of degree 1.                               b) What is the largest number of vertices in a graph with 35 edges if all vertices are

Find out the length of Hamiltonian Path in a connected graph of n vertices. Ans: The length of Hamiltonian Path in a connected graph of n vertices is n-1.