4, 7 and 9 are mutually coprime, so you can use the Chinese remainder theorem.
Start with
Taken mod 4, the last two terms vanish and we're left with
We have 
, so we can multiply the first term by 3 to guarantee that we end up with 1 mod 4.
Taken mod 7, the first and last terms vanish and we're left with
which is what we want, so no adjustments needed here.
Taken mod 9, the first two terms vanish and we're left with
so we don't need to make any adjustments here, and we end up with 
.
By the Chinese remainder theorem, we find that any 
such that
is a solution to this system, i.e. 
for any integer 
, the smallest and positive of which is 149.
The answer is D.
explain:
A^2 + b^2 = c^2
Answer:
42.5
Step-by-step explanation:
Multiply 50 by 0.85, which equals 42.5.
Answer:
1. Objective function is a maximum at (16,0), Z = 4x+4y = 4(16) + 4(0) = 64
2. Objective function is at a maximum at (5,3), Z=3x+2y=3(5)+2(3)=21
Step-by-step explanation:
1. Maximize: P = 4x +4y
Subject to: 2x + y ≤ 20
x + 2y ≤ 16
x, y ≥ 0
Plot the constraints and the objective function Z, or P=4x+4y)
Push the objective function to the limit permitted by the feasible region to find the maximum.
Answer: Objective function is a maximum at (16,0),
Z = 4x+4y = 4(16) + 4(0) = 64
2. Maximize P = 3x + 2y
Subject to x + y ≤ 8
2x + y ≤ 13
x ≥ 0, y ≥ 0
Plot the constraints and the objective function Z, or P=3x+2y.
Push the objective function to the limit in the increase + direction permitted by the feasible region to find the maximum intersection.
Answer: Objective function is at a maximum at (5,3),
Z = 3x+2y = 3(5)+2(3) = 21
