Concept explainers
a.
Prove that a constant d can be added or subtracted to each
a.
Explanation of Solution
Calculation:
The model used to predict
To this model a constant d is added,
The mean response due to the
Where,
The mean response due to the
Where,
The overall mean response of Y is given below:
Where,
The total sum of squares is given below:
The error sum of squares is given below:
Using the similar method, the sum of squares due to factor A and B are calculated.
Sum of squares due to factor A:
Sum of squares due to factor B:
From all the sum of squares it can observed that the addition of a constant d has no effect on the sum of squares.
b.
Identify the change in the sum of squares due to multiplication of constant c.
Identify the changes in the F-statistic for factor A and B.
Find the effect of
b.
Answer to Problem 13E
The sum of squares remains unchanged and the F-statistic for factor A and B also remains unchanged.
The conclusions for ANOVA remains unchanged by using
Explanation of Solution
Calculation:
The model used to predict
To this model a constant c is multiplied,
Then the sum of squares would have the square of the constant c and it is shown below:
Total sum of squares:
Sum of squares due to factor A:
Sum of squares due to factor B:
Sum of squares due to error:
Mean sum of squares for factor A:
Mean sum of squares for factor B:
Mean sum of squares for error:
Thus, the F-statistic for factor A would be,
For factor B:
From part (a) the addition of constant d has no effect on ANOVA and also the multiplication of constant c has no effect on ANOVA.
Hence, coding the model as
Want to see more full solutions like this?
Chapter 11 Solutions
Student Solutions Manual for Devore's Probability and Statistics for Engineering and the Sciences, 9th
- solve on paperarrow_forwardsolve 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_forward
- We 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_forwardNegate the following compound statement using De Morgans's laws.arrow_forward
- Question 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_forwardCharacterize (with proof) all connected graphs that contain no even cycles in terms oftheir blocks.arrow_forward
- Let 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_forwardLet G be a connected graph that does not have P4 or C4 as an induced subgraph (i.e.,G is P4, C4 free). Prove that G has a vertex adjacent to all othersarrow_forward
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning