Answer:
Let's assume the following data:
Price in Dollars (X) 26 29 32 38 47
Number of Bids (Y) 12 13 15 16 18
For our case we have this:
n=10 
![r=\frac{5(2623)-(172)(74)}{\sqrt{[5(6194) -(172)^2][5(1118) -(74)^2]}}=0.974](https://tex.z-dn.net/?f=r%3D%5Cfrac%7B5%282623%29-%28172%29%2874%29%7D%7B%5Csqrt%7B%5B5%286194%29%20-%28172%29%5E2%5D%5B5%281118%29%20-%2874%29%5E2%5D%7D%7D%3D0.974)
So then the correlation coefficient would be r =0.974
Step-by-step explanation:
Previous concepts
The correlation coefficient is a "statistical measure that calculates the strength of the relationship between the relative movements of two variables". It's denoted by r and its always between -1 and 1.
Solution to the problem
And in order to calculate the correlation coefficient we can use this formula:
![r=\frac{n(\sum xy)-(\sum x)(\sum y)}{\sqrt{[n\sum x^2 -(\sum x)^2][n\sum y^2 -(\sum y)^2]}}](https://tex.z-dn.net/?f=r%3D%5Cfrac%7Bn%28%5Csum%20xy%29-%28%5Csum%20x%29%28%5Csum%20y%29%7D%7B%5Csqrt%7B%5Bn%5Csum%20x%5E2%20-%28%5Csum%20x%29%5E2%5D%5Bn%5Csum%20y%5E2%20-%28%5Csum%20y%29%5E2%5D%7D%7D)
Let's assume the following data
Price in Dollars (X) 26 29 32 38 47
Number of Bids (Y) 12 13 15 16 18
For our case we have this:
n=10
So then the correlation coefficient would be r =0.974
The inverse is x²+7
.......
Line segments joining these points cross the x-axis 5 times. The continuous function y has
at least 5 zeros.
Answer:
The binomial 14
- 35x can be factored as 7x(2x+5)
Step-by-step explanation:
When factoring, you want to factor each constant or variable by their greatest common factor (or GCF). Since 
and 
has a greatest common factor of 7x, factor each term by 7x and you'll get 
.
Answer:
See definition below
Step-by-step explanation:
Since we have to give a recursive definition, we must give a initial value f(0). Additionally, the value of f(n) must depend on the value of f(n-1) for all n≥1.
The required value of f(0) is (0+1)!=1!=1.
Now, the factorial itself is a recursive function, because (n+1)!=(n+1)n!. In terms of f, this means that f(n)=(n+1)f(n-1) for all n≥1.
Then, our definition is: f:N→N is defined by
- f(0)=1.
- For n≥1, f(n)=(n+1)f(n-1).
