No, because when adding 1 to any odd number it will become even, and all even numbers besides 2 are not prime. This means that if n was 1 the resulting number would be prime, since 2 is prime.
Set up the equation:
Let x be the number of weeks before they weigh the same.
148+2x=193-x
solve:
148+2x=193-x
3x=45
x=15
therefore: it will take 15 weeks until they weigh the same.
Answer:
basket ball
Step-by-step explanation:
<span>We want to optimize f(x,y,z)=x^2 y^2 z^2, subject to g(x,y,z) = x^2 + y^2 + z^2 = 289.
Then, ∇f = λ∇g ==> <2xy^2 z^2, 2x^2 yz^2, 2x^2 y^2 z> = λ<2x, 2y, 2z>.
Equating like entries:
xy^2 z^2 = λx
x^2 yz^2 = λy
x^2 y^2 z = λz.
Hence, x^2 y^2 z^2 = λx^2 = λy^2 = λz^2.
(i) If λ = 0, then at least one of x, y, z is 0, and thus f(x,y,z) = 0 <---Minimum
(Note that there are infinitely many such points.)
(f being a perfect square implies that this has to be the minimum.)
(ii) Otherwise, we have x^2 = y^2 = z^2.
Substituting this into g yields 3x^2 = 289 ==> x = ±17/√3.
This yields eight critical points (all signage possibilities)
(x, y, z) = (±17/√3, ±17/√3, ±17/√3), and
f(±17/√3, ±17/√3, ±17/√3) = (289/3)^3 <----Maximum
I hope this helps! </span><span>
</span>
Answer:
C. 20
Step-by-step explanation:
The order in which the members are selected is important. The first one selected is the president and the second is the vice president.
So we use the permutations formula to solve this question.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
In this problem:
2 people are going to be chosen from a set of 5. So
So the correct answer is:
C. 20
