Concept explainers
Time to review: The following table presents the time taken to review articles that were submitted for publication to the journal Technometrics during a recent year. A few articles took longer than 9 months to review; these are omitted from the table. Consider the data to be a population.
- Approximate the variance of the times.
- Approximate the standard deviation of the times.
a)
To find the Population variance for given data.
Answer to Problem 39E
Variance = 0.384
Explanation of Solution
Given:
The data
Time (Months) | Number of Articles |
0.0−0.9 | 45 |
1.0−1.9 | 17 |
2.0−2.9 | 18 |
3.0−3.9 | 19 |
4.0−4.9 | 12 |
5.0−5.9 | 14 |
6.0−6.9 | 13 |
7.0−7.9 | 22 |
8.0−8.9 | 11 |
Calculation:
Time (Months) | Number of Articles(fi) | Mid Value(xi) | ||
0.0−0.9 | 45 | 0.5 | 22.5 | 10.27 |
1.0−1.9 | 17 | 1.5 | 25.5 | 4.86 |
2.0−2.9 | 18 | 2.5 | 45 | 1.45 |
3.0−3.9 | 19 | 3.5 | 66.5 | 0.04 |
4.0−4.9 | 12 | 4.5 | 54 | 0.63 |
5.0−5.9 | 14 | 5.5 | 77 | 3.22 |
6.0−6.9 | 13 | 6.5 | 84.5 | 7.81 |
7.0−7.9 | 22 | 7.5 | 165 | 14.40 |
8.0−8.9 | 11 | 8.5 | 93.5 | 23.00 |
Sum | 171 | 633.50 | 65.69 | |
Mean | 3.70 |
The variance for the given data is 0.384.
b)
To find the Population standard deviation for given data.
Answer to Problem 39E
Standard deviation = 0.62
Explanation of Solution
Calculation:
Time (Months) | Number of Articles(fi) | Mid Value(xi) | ||
0.0−0.9 | 45 | 0.5 | 22.5 | 10.27 |
1.0−1.9 | 17 | 1.5 | 25.5 | 4.86 |
2.0−2.9 | 18 | 2.5 | 45 | 1.45 |
3.0−3.9 | 19 | 3.5 | 66.5 | 0.04 |
4.0−4.9 | 12 | 4.5 | 54 | 0.63 |
5.0−5.9 | 14 | 5.5 | 77 | 3.22 |
6.0−6.9 | 13 | 6.5 | 84.5 | 7.81 |
7.0−7.9 | 22 | 7.5 | 165 | 14.40 |
8.0−8.9 | 11 | 8.5 | 93.5 | 23.00 |
Sum | 171 | 633.50 | 65.69 | |
Mean | 3.70 |
The Standard deviation for the given data is 0.62.
Want to see more full solutions like this?
Chapter 3 Solutions
Elementary Statistics 2nd Edition
- 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
- Big Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin HarcourtGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill