You haven't provided any value, but I can tell you the solution set for the inequality.
First of all, expand both sides:
Add 3x to both sides:
Add 6 to both sides:
Which is of course equivalent to
Divide both sides by 9
So, every number smaller than 2 is part of the solution of this inequality.
An equilateral triangle has 3 equal sides and angles. Each angle is
60 degrees.
Answer:
Step-by-step explanation:
first we need to find the slope using the slope formula :
slope = (y2 - y1) / (x2 - x1)
(-9,7)...x1 = -9 and y1 = 7
(-6,-3)....x2 = -6 and y2 = -3
now we sub
slope = (-3 - 7) / (-6 - (-9) = -10 / (-6 + 9) = -10 / 3
so our slope is -10/3
now we use y = mx + b....with m representing the slope
slope(m) = -10/3
use either of ur points....I will use (-9,7)...x = -9 and y = 7
we are solving for b, the y intercept
now we sub
7 = -10/3(-9) + b
7 = 30 + b
7 - 30 = b
- 23 = b
so ur equation is : y = -10/3x - 23
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;
}
Answer:
yes.......................
Step-by-step explanation:
