Concept explainers
a.
To write: All the eight possible arrangements for the boy and girl child.
To find: The
a.
Answer to Problem 12.48E
The eight possible arrangements for the boy and girl child are given below,
The probability to get first two girls and a boy is
Explanation of Solution
Given info:
A couple has planned to have three child, eight possible arrangements for the girl and boy are possible. All these eight arrangements are equally likely to occurrence.
Justification:
The sample space is defined as the set of all possible outcomes from an experiment.
The total number of possible outcomes is,
A couple plans to have three children. One of the possible combinations to have three children is “Girl, Girl or Boy”. Similarly, the other possible combinations can be obtained.
All the eight possible arrangements for the boy and girl child are the sample space S which is given below:
Where, G represents the girl child and B represents the boy child.
Calculation:
Equally likely events:
An
Since, the eight possible arrangements are equally likely to occur. The probability for one of the eight possible arrangements is calculated as follows:
Thus, the probability for getting any one from the eight possible arrangements is
b.
To find: The probability that
b.
Answer to Problem 12.48E
The probability that the couple have two girl children is
Explanation of Solution
Given info:
Assume that X denotes the number of girls that the couple has.
Calculation:
Let the number of girls X that the couple has equals to 2 girls.
The outcomes for 2 girls are
The probability that the couple have two girl children is calculated as follows:
Thus, the probability that the couple have two girl children is
c.
To find: The values of X and the probability distribution for X.
c.
Answer to Problem 12.48E
The values taken by X are 0, 1, 2, and 3.
The probability distribution is given below:
X | 0 | 1 | 2 | 3 |
Probability |
Explanation of Solution
Calculation:
Random variable:
The random variable is a variable which has numerical values or outcomes obtained from a random experiment.
Finite Probability Model:
A probability model with a finite sample space is called the finite probability model.
Assigning probabilities to the finite probability model:
- List all the probabilities for all individual outcomes.
- These probabilities should lie between 0 and 1 and the total sum of all probabilities exactly equal to 1.
- The probability for occurrence of any event is the sum of individual probabilities of that event.
Values of X:
The random variable X takes values 0, 1, 2, 3 because the couple has planned to have 3 children and X denotes the number of girl child. So, the possible number of girl child the couple can have is 0, 1, 2, and 3.
Probability distribution for X:
Let the number of girls X that the couple has equals to 0. The possible outcome is
The probability to have no girl child is calculated as follows:
Thus, the probability to have no girl child is
Let the number of girls X that the couple has equals 1. The possible outcomes are
The probability to have 1 girl child is calculated as follows:
Thus, the probability to have one girl child is
Let the number of girls X that the couple has equals 2. The outcomes for 2 girls are
The probability to have 2 girl children is calculated as follows:
Thus, the probability to have two girl child is
Let the number of girls X that the couple has equals 3. The possible outcome is
The probability to have 3 girl children is calculated as follows:
Thus, the probability to have three girl child is
The probability distribution is given below:
X | 0 | 1 | 2 | 3 |
Probability |
Want to see more full solutions like this?
Chapter 12 Solutions
The Basic Practice of Statistics
- T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.arrow_forwardWe consider the one-period model studied in class as an example. Namely, we assumethat the current stock price is S0 = 10. At time T, the stock has either moved up toSt = 12 (with probability p = 0.6) or down towards St = 8 (with probability 1−p = 0.4).We consider a call option on this stock with maturity T and strike price K = 10. Theinterest rate on the money market is zero.As in class, we assume that you, as a customer, are willing to buy the call option on100 shares of stock for $120. The investor, who sold you the option, can adopt one of thefollowing strategies: Strategy 1: (seen in class) Buy 50 shares of stock and borrow $380. Strategy 2: Buy 55 shares of stock and borrow $430. Strategy 3: Buy 60 shares of stock and borrow $480. Strategy 4: Buy 40 shares of stock and borrow $280.(a) For each of strategies 2-4, describe the value of the investor’s portfolio at time 0,and at time T for each possible movement of the stock.(b) For each of strategies 2-4, does the investor have…arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardQuestion 6: Negate the following compound statements, using De Morgan's laws. A) If Alberta was under water entirely then there should be no fossil of mammals.arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forward
- Characterize (with proof) all connected graphs that contain no even cycles in terms oftheir blocks.arrow_forwardLet G be a connected graph that does not have P4 or C3 as an induced subgraph (i.e.,G is P4, C3 free). Prove that G is a complete bipartite grapharrow_forwardProve sufficiency of the condition for a graph to be bipartite that is, prove that if G hasno odd cycles then G is bipartite as follows:Assume that the statement is false and that G is an edge minimal counterexample. That is, Gsatisfies the conditions and is not bipartite but G − e is bipartite for any edge e. (Note thatthis is essentially induction, just using different terminology.) What does minimality say aboutconnectivity of G? Can G − e be disconnected? Explain why if there is an edge between twovertices in the same part of a bipartition of G − e then there is an odd cyclearrow_forward
- MATLAB: An Introduction with ApplicationsStatisticsISBN:9781119256830Author:Amos GilatPublisher:John Wiley & Sons IncProbability and Statistics for Engineering and th...StatisticsISBN:9781305251809Author:Jay L. DevorePublisher:Cengage LearningStatistics for The Behavioral Sciences (MindTap C...StatisticsISBN:9781305504912Author:Frederick J Gravetter, Larry B. WallnauPublisher:Cengage Learning
- Elementary Statistics: Picturing the World (7th E...StatisticsISBN:9780134683416Author:Ron Larson, Betsy FarberPublisher:PEARSONThe Basic Practice of StatisticsStatisticsISBN:9781319042578Author:David S. Moore, William I. Notz, Michael A. FlignerPublisher:W. H. FreemanIntroduction to the Practice of StatisticsStatisticsISBN:9781319013387Author:David S. Moore, George P. McCabe, Bruce A. CraigPublisher:W. H. Freeman