Concept explainers
In Exercises 17-20, compute the
To calculate: To compute the correlation coefficient.
Answer to Problem 19E
The correlation coefficient is
Explanation of Solution
Given information:
The data is,
5.5 | 4.2 | 4.7 | 5.6 | 6.0 | 3.9 | 6.3 | 5.7 | |
4.9 | 4.8 | 4.8 | 4.7 | 5.5 | 5.1 | 5.8 | 6.5 |
Formula used:
The correlation coefficient of a data is given by:
Where,
The standard deviations are given by:
Calculation:
The mean of x is given by:
The mean of y is given by:
The data can be represented in tabular form as:
x | y | ||||
5.5 | 4.9 | 0.2625 | 0.06891 | -0.3625 | 0.13141 |
4.2 | 4.8 | -1.0375 | 1.07641 | -0.4625 | 0.21391 |
4.7 | 4.8 | -0.5375 | 0.28891 | -0.4625 | 0.21391 |
5.6 | 4.7 | 0.3625 | 0.13141 | -0.5625 | 0.31641 |
6 | 5.5 | 0.7625 | 0.58141 | 0.2375 | 0.05641 |
3.9 | 5.1 | -1.3375 | 1.78891 | -0.1625 | 0.02641 |
6.3 | 5.8 | 1.0625 | 1.12891 | 0.5375 | 0.28891 |
5.7 | 6.5 | 0.4625 | 0.21391 | 1.2375 | 1.53141 |
Hence, the standard deviation is given by:
And,
Hence, the table for calculating coefficient of correlation is given by:
x | y | |||
5.5 | 4.9 | 0.2625 | -0.3625 | -0.09516 |
4.2 | 4.8 | -1.0375 | -0.4625 | 0.47984 |
4.7 | 4.8 | -0.5375 | -0.4625 | 0.24859 |
5.6 | 4.7 | 0.3625 | -0.5625 | -0.20391 |
6 | 5.5 | 0.7625 | 0.2375 | 0.18109 |
3.9 | 5.1 | -1.3375 | -0.1625 | 0.21734 |
6.3 | 5.8 | 1.0625 | 0.5375 | 0.57109 |
5.7 | 6.5 | 0.4625 | 1.2375 | 0.57234 |
The correlation coefficient of a data is given by:
Plugging the values in the formula,
Therefore, the correlation coefficient for the given data is 0.515
Want to see more full solutions like this?
Chapter 4 Solutions
Elementary Statistics ( 3rd International Edition ) Isbn:9781260092561
- 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 HillHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL