Concept explainers
In Problem 18 the data show large and consistent differences between subjects. For example, subject A has the largest score in every treatment and subject D always has the smallest score. In the second stage of the ANOVA. the large individual differences get subtracted out of the denominator of the F-ratio. which results in a larger value for F.
The following data were created by using the same numbers that appeared in Problem 18. I1oever. we eliminated the consistent individual differences by scrambling the scores within each treatment.
Treatment | |||||
Subject | I | II | III | P | |
A | 6 | 2 | 3 | 11 | |
B | 5 | 1 | 5 | 11 | |
C | 0 | 5 | 10 | 15 | |
D | 1 | 8 | 2 | 11 | |
a. Use a repeated-measures ANOVA with
b. The data in problem 18 showed consistent differences between subjects and produced significant treatment effects. Explain how eliminating the consistent individual differences affected the results of this analysis compared with the results from Problem 18.
The following data were obtained from a repeated- measures study comparing three treatment conditions.
Treatment | |||||
Subject | I | II | III | P | |
A | 6 | 8 | 10 | 24 | |
B | 5 | 5 | 5 | 15 | |
C | 1 | 2 | 3 | 6 | |
D | 0 | 1 | 2 | 3 | |
Use a repeated-measures ANOVA with
Want to see the full answer?
Check out a sample textbook solutionChapter 13 Solutions
Statistics for The Behavioral Sciences (MindTap Course List)
- 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 HillBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt