(a)
To state: the hypotheses for performing a test of company’s claim that each batch of its deluxe mixed nuts contains 52% cashews, 27% almonds, 13% macadamia and 8% brazil nuts whereas a random sample of 150 nuts from each batch is having the following composition.
Nut | Cashew | Almond | Macadamia | Brazil |
count | 83 | 29 | 20 | 18 |
(a)
Answer to Problem 1E
The null hypothesis will be H0: The observed count of each type of nuts in a group of 150 nuts from latest batch are same as claimed count of nuts in a group of 150.
Versus
H1: The observed counts of each type of nuts in a group of 150 nuts from latest batch are not same as claimed count of nuts in a group of 150.
Explanation of Solution
The null hypothesis will be H0: The observed count of each type of nuts in a group of 150 nuts from latest batch are same as claimed count of nuts in a group of 150.
Versus
H1: The observed counts of each type of nuts in a group of 150 nuts from latest batch are not same as claimed count of nuts in a group of 150.
Since proportion of nuts of each type as per the claim is for 100, we can obtain the proportion of each type of nuts in 150 by multiplying by each number by 150.
(b)
To find: expected counts of nuts of each type in a group of 150.
(b)
Answer to Problem 1E
The expected count of nuts is given in the table below.
Explanation of Solution
Since proportion of nuts of each type as per the claim is for 100, we can obtain the proportion of each type of nuts in a group of 150 by multiplying by each count by 150.
Chapter 11 Solutions
The Practice of Statistics for AP - 4th Edition
Additional Math Textbook Solutions
Elementary Statistics (13th Edition)
Thinking Mathematically (6th Edition)
A First Course in Probability (10th Edition)
Intro Stats, Books a la Carte Edition (5th Edition)
Calculus: Early Transcendentals (2nd Edition)
A Problem Solving Approach To Mathematics For Elementary School Teachers (13th Edition)
- solve the question based on hw 1, 1.41arrow_forwardT1.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_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardNegate 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_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardCharacterize (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_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