Two boxes contain colored balls. Box 1 contains 4 blue, 5 green and 3 red balls. Box 2 contains 6 blue, 2 green and 3 red balls. A ball is selected at random from box 1 and transferred to box 2. A ball is then selected at random from box 2. If the ball selected from box 2 is green, what is the probability that the ball transferred from box 1 was: (a) red? (b) blue?

Two boxes contain colored balls. Box 1 contains 4 blue, 5 green and 3 red balls. Box 2 contains 6 blue, 2 green and 3 red balls. A ball is selected at random from box 1 and transferred to box 2. A ball is then selected at random from box 2. If the ball selected from box 2 is green, what is the probability that the ball transferred from box 1 was: (a) red? (b) blue?

A First Course in Probability (10th Edition)

10th Edition

ISBN:9780134753119

Author:Sheldon Ross

Publisher:Sheldon Ross

Chapter1: Combinatorial Analysis

Section: Chapter Questions

Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...

See similar textbooks

Similar questions

Draw the tree diagram giving the permutations of {x, y, z, u} objects.
Does the following diagram show a tree? If not, why not?
Kindly handwritten and correctly
What is a false base line in graph? Please provide a brief answer
You'd like to study social networks. Consider the following 26 people {A,B,C,...,X,Y,Z} in a social network graph. (These people can be thought of as "nodes" or points drawn on a piece of paper.) Here, we'd like to model "followers." How many different ways can we draw arrows between two people from these 26? Here, "A-->B" (A is a follower of B) is not the same as "B-->A" (B is a follower of A). Order matters here.
(c) It is known that, a is the root of a tree. a is the parent of b and c. d, e, and f share the same parent, b. h is the child of c. i and j are the siblings of h. Illustrate the above information in a tree.
A tree has 7 vertices. (i) How many edges this tree can have? (ii) If the degrees of first six vertices are 1,1,1,2,2 and 3 then what is the degree of next vertex? Show all your work. (iii) If the degrees of vertices are 1,1,2,2,3,3 and 4 then is it possible to have such tree? Explain with detail.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
use a tree diagram that shows how many ways a nickel a dime and a quarter can be flipped, determine how many ways you can get exactly one tail.
A tree diagram has two stages. Stage 1 has three nodes and stage 2 has six nodes. In stage 1, the branch from the starting position to node A is labeled 0.3. The branch from the starting position to node B is labeled 0.1. The branch from the starting position to node C is an answer blank. In stage 2, the branch from node A to node E is an answer blank. The branch from node A to node F is labeled 0.5. In stage 2, the branch from node B to node G is an answer blank. The branch from node B to node H is labeled 0.8. In stage 2, the branch from node C to node I is an answer blank. The branch from node C to node J is an answer blank. Node I is labeled P(I ∩ C) = 0.24. Node J is labeled P(J ∩ C) = 0.36.
in fuzzy graph What is the fuzzy cutvertex ? And give an examples