Answer:
k = 6.5
Step-by-step explanation:
y = 2x + c is given. Thus, we know immediately that the slope of this line is m = 2. If (k, 10) is a point on this line, then the following must be true:
10 = 2(k) + c, and
-3 + 2(0) + c
or
10 = 2k + c
c = -3
Thus, 10 = 2k + -3 becomes 13 = 2k, so that k = 6.5
Answer:
The best estimate of the number of times out of 39 that Ariana is on time to class is 27.
Step-by-step explanation:
For each class, there are only two possible outcomes. Either Ariana is on time, or she is not. The probability of Ariana being on time for a class is independent of other classes. So we use the binomial probability distribution to solve this question.
Binomial probability distribution
Probability of exactly x sucesses on n repeated trials, with p probability.
The expected value of the binomial distribution is:

The probability that Ariana is on time for a given class is 69 percent.
This means that 
If there are 39 classes during the semester, what is the best estimate of the number of times out of 39 that Ariana is on time to class
This is E(X) when n = 39. So

Rounding
The best estimate of the number of times out of 39 that Ariana is on time to class is 27.
Constant rates are used to illustrate linear functions.
- The average rate of change is $9.0 per hour
- The function that models the table is:

- The amount earned in 7.5 hours is $67.5
<u>(a) The average rate of change</u>
This is calculated using:

So, we have:



Hence, the average rate of change is $9.0 per hour
<u>(b) A function that models the table of values</u>
Let x represent hours, and y represent the earnings.
So, we have:

Where:
m =Rate = 9.0
So, we have:

Expand


Represent as a function

Hence, the function that models the table is: 
<u>(c) Amount earned for 7.5 hours</u>
This means that x = 7.5
So, we have:


Hence, the amount earned in 7.5 hours is $67.5
Read more about constant rates at:
brainly.com/question/23184115
Answer:
n times 5
Step-by-step explanation:
A matrix Anxn of this way is called an upper triangular matrix. It can be proved that the determinant of this kind of matrix is

In this case, it would be 5+5+...+5 (n times) = n times 5
We are going to develop each determinant by the first column taking as pivot points the elements of the diagonal
![det\left[\begin{array}{cccc}5&a_{12}&a_{13}...&a_{1n}\\0&5&a_{23}...&a_{2n}\\...&...&...&...\\0&0&0&5\end{array}\right] =5+det\left[\begin{array}{ccc}5&a_{23}...&a_{2n}\\0&5&a_{3n}\\...&...&...\\0&0&5\end{array}\right]=5+5+...+det\left[\begin{array}{cc}5&a_{n-1,n}\\0&5\end{array}\right]=5+5+...+5+5\;(n\;times)](https://tex.z-dn.net/?f=det%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D5%26a_%7B12%7D%26a_%7B13%7D...%26a_%7B1n%7D%5C%5C0%265%26a_%7B23%7D...%26a_%7B2n%7D%5C%5C...%26...%26...%26...%5C%5C0%260%260%265%5Cend%7Barray%7D%5Cright%5D%20%3D5%2Bdet%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D5%26a_%7B23%7D...%26a_%7B2n%7D%5C%5C0%265%26a_%7B3n%7D%5C%5C...%26...%26...%5C%5C0%260%265%5Cend%7Barray%7D%5Cright%5D%3D5%2B5%2B...%2Bdet%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7D5%26a_%7Bn-1%2Cn%7D%5C%5C0%265%5Cend%7Barray%7D%5Cright%5D%3D5%2B5%2B...%2B5%2B5%5C%3B%28n%5C%3Btimes%29)
Answer:
Step-by-step explanation:
130 + 125 + 191 = 446, so choice (C)
Hope that helps!