Answer:
Both ordered pairs are solutions to this equation.
Step-by-step explanation:
If you plug in the x and y values given in the ordered pair, you make the left side of the equation equal the right for both pairs.
Answer:
<u>For one Necklace you would need...</u>
24 blue beads.
16 white beads.
4 green beads.
Ratio: 24: 16: 4
Step-by-step explanation:
If you quadruple the amount of beads from the original amount (6 : 4: 1), the total beads for that necklace will be 44.
Step 1: 6 x 4 = 24 (amount of blue beads in necklace).
Step 2: 4 x 4 = 16 (amount of white beads in necklace).
Step 3: 1 x 4 = 4 (amount of green beads in necklace).
Now check to see if the total of all types of beads sum up to 44:
Step 4: 24 + 16 + 4 = 44
______________-
There is your answer:
You need 24 blue beads, 16 white beads, and 4 green beads to have a total sum of 44 beads in that one necklace.
Composition function rule (f○g)(x) = f(g(x))
<em><u /></em><u>Given the separate functions</u>:
and
40 is the correct answer for this
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;
}
