Answer:
- y = 2x + 3
- y = -6x
- y = -x + 2
- y = 2x - 7
Step-by-step explanation:
<u>Slope-intercept form:</u>
<em>Hint. if we have x = 0, then the y-coordinate is the same as b</em>
<u>Slope</u>
33.
- m = (9 -(-3))/(3 - (-3)) = 12/6 = 2
- b = 3 as per table (0, 3)
34.
- m = (0-12)/(0 - (-2)) = -12/2 = -6
- b = 0, as per table (0, 0)
35.
- m = (2 - (-2))/(0 - 4) = 4/-4 = -1
- b = 2, as per table (0, 2)
36.
- m = (-5 - (-1))/ (1 -3) = -4/-2 = 2
Using point (3, -1)
- -1 = 2*3 + b
- b= -1 - 6= - 7
Answer:
Step-by-step explanation:
It is given that, the radius of a circle is 8 inches and we are to find the circumference of the circle.
To find the circumference of the circle we must know this formula first :
Where
- r is the radius of the circle.
- We'll take the value of π as 3.14
Now substituting the values in the formula :
Therefore,
- The circumference of the circle is 50.24 inches
Answer:
Equation shown
Step-by-step explanation:
Eq(1): x-3y=-12
X=-12+3y
=-4+y
Eq(2): x-3y=-6
X=-6+3y
=-2+y
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
