Answer:
<u>Slope = 3</u>
Step-by-step explanation:
Slope is calculated as the "Rise/Run" of a straight line. The Rise is the change in the value of y, or the amount y changes per change in x. Run is the change in the x value. A line with a run of 3 and a rise of 9 is calculated as:
Rise/Run = 9/3 or 3
This means that the value of y will increase by 3 for every increase of 1 in the value of 3.
Slope in "m" in the slope-intercept form of a straight line equation: y = mx + b
The line y = 3x + 2 tells us the it has a slope of 3 and intercepts the y axis at x = 2.
Example points (y = 3x + 2)
(0,2)
(1,5)
(4,14)
Note that y changes by 12 when x changes by 4. Rise/Run = 12/4 or 3.
2.
1099.99x 0.58 =637.9942
1099.99-637.9942= 461.9958
461.9958x 0.065=30.029727
461.9958-30.029727=431.967073
The answer round is 431.96
3.
42.95x1/5= 8.59
42.95-8.59 = 34.56
34.56 x 0.07=2.4192
34.56-2.4192= 32.1408
Round it is 32.14
4.
1250x0.85= 1062.5
1250-1062.5 =187.5
Answer:
6 and 8
Step-by-step explanation:
Let's start off by thinking at what the question is asking us.
The product (multiplication) of two even numbers (x)(x+2) is which means =,
12 more (12) than the square of the smaller number (x).
So put that all together and you get (x)(x+2)=12+x^2=
Distribute the x, (x)(x+2)=
x^2+2x=x^2+12 Subtract x^2 from both sides.
2x=12
Divide both sides by 2 and you get x=6
So the two numbers are 6,8
6(8)=12+6^2
48=48
I'm partial to solving with generating functions. Let

Multiply both sides of the recurrence by
and sum over all
.

Shift the indices and factor out powers of
as needed so that each series starts at the same index and power of
.

Now we can write each series in terms of the generating function
. Pull out the first few terms so that each series starts at the same index
.

Solve for
:

Splitting into partial fractions gives

which we can write as geometric series,


which tells us

# # #
Just to illustrate another method you could consider, you can write the second recurrence in matrix form as

By substitution, you can show that

or

Then solving the recurrence is a matter of diagonalizing the coefficient matrix, raising to the power of
, then multiplying by the column vector containing the initial values. The solution itself would be the entry in the first row of the resulting matrix.
You would save 7 hours and 31 minutes if you take a plane