a.
Check whether 7 classes would be used to create a frequency distribution using the
a.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The number of classes for the frequency distribution that consists of 73 observations is 7.
Explanation of Solution
Selection of number of classes:
The “2 to the k rule” suggests that the number of classes is the smallest value of k, where
It is given that the data set consists of 73 observations. The value of k can be obtained as follows:
Here,
Therefore, the number of classes for the frequency distribution that consists of 73 observations is 7.
b.
Check whether the class interval of 30 would summarize the data in 7 classes.
b.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The reasonable class interval is 30.
Explanation of Solution
From the given data set, the maximum and minimum values are 488 and 320, respectively.
The formula for the class interval is given as follows:
Where, i is the class interval and k is the number of classes.
Therefore, the class interval for the given data can be obtained as follows:
In practice, the class interval size is usually rounded up to some convenient number such as a multiple of 10 or 100. Therefore, the reasonable class interval is 30.
c.
Construct a frequency and relative frequency table for the given data.
c.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The frequency and relative frequency table for the given data are as follows:
Class | Frequency | Relative Frequency |
300-330 | 2 | |
330-360 | 2 | |
360-390 | 17 | |
390-420 | 27 | |
420-450 | 22 | |
450-480 | 1 | |
480-510 | 2 | |
Total | 73 | 1 |
Explanation of Solution
Frequency table:
The frequency table is a collection of mutually exclusive and exhaustive classes that show the number of observations in each class.
It is given that the lower limit of the first class is 300. From Part (b), the class interval is 30. The frequency table of the 73 home runs can be constructed as follows:
Class | Frequency | Relative Frequency |
300-330 | 2 | |
330-360 | 2 | |
360-390 | 17 | |
390-420 | 27 | |
420-450 | 22 | |
450-480 | 1 | |
480-510 | 2 | |
Total | 73 | 1 |
d.
Find the number of home runs traveled at a distance of 360 up to 390 feet.
d.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The number of home runs traveled at a distance of 360 up to 390 feet is 17.
Explanation of Solution
From the frequency table in Part (c), the frequency value of the class 360-390 is 17. Therefore, the number of home runs traveled at a distance of 360 up to 390 feet is 17.
e.
Calculate the percentage of the number of home runs traveled at a distance of 360 up to 390 feet.
e.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The percentage of the number of home runs traveled at a distance of 360 up to 390 feet is 23.288%.
Explanation of Solution
From the frequency table in Part (c), the frequency value of the class 360-390 is 17. The total number of observations is 73. The value of 17 home runs traveled can be converted into percentage as follows:
Therefore, percentage of the number of home runs traveled at a distance of 360 up to 390 feet is 23.288%.
f.
Calculate the percentage of the number of home runs traveled at a distance of 390 feet or more.
f.
![Check Mark](/static/check-mark.png)
Answer to Problem 3SR
The percentage of the number of home runs traveled at a distance of 390 feet or more is 71.233%.
Explanation of Solution
From the frequency table in Part (c), the sum of all the frequencies of the classes 390-420 and above is given below:
The total number of observations is 73. The value of 52 home runs traveled can be converted into percentage as follows:
Therefore, percentage of the number of home runs traveled at a distance of 390 feet or more is 71.233%.
Want to see more full solutions like this?
Chapter 2 Solutions
STATISTICAL TECHNIQUES FOR BUSINESS AND
- 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
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt
- College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningTrigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780079039897/9780079039897_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780547587776/9780547587776_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781680331141/9781680331141_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305652231/9781305652231_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337282291/9781337282291_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337278461/9781337278461_smallCoverImage.gif)