Answer:
128 students in total
Step-by-step explanation:
25/100 = 1/4
1/4 = 32/ x
1 x 32
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:
1. In number theory, Euclid's lemma is a lemma that captures a fundamental property of prime numbers, namely: Euclid's lemma — If a prime p divides the product ab of two integers a and b, then p must divide at least one of those integers a and b.
2. The Thales theorem states that: If three points A, B, and C lie on the circumference of a circle, whereby the line AC is the diameter of the circle, then the angle ∠ABC is a right angle (90°).
Step-by-step explanation:
hope it helps
Answer is A
Step-by-step explanation:
hope that helps
15 students/45 tacos=? students/450 tacos
15 x 450=6750
6750/45=150
Gary would be making 450 tacos for 150 students