Answer:
Step-by-step explanation:
Natsano can satisfy his constraints by investing the first $20,000 in Company A, then splitting the remaining $35,000 evenly between the companies. For best return, he needs to invest as much as possible in Company B, but each such dollar (after the first 20k) must be matched by a dollar invested in Company A. That is, his investments should be ...
- Company A: $37,500
- Company B: $17,500
_____
The attached graph shows the feasible region of investments (doubly shaded). The vertex that maximizes the objective function (return on investment) is the one highlighted. (It puts the objective function line as far as possible from the origin.)
_____
Sometimes graphing the constraints is more work than necessary if there is some simple logic that quickly identifies the solution.
Negative x négative = positive so it’s 27 eioeieieieieieieiiee
Answer:
i would think about 20 miles away
Step-by-step explanation:
The sequence is given by the formula

, where n is the value of the n'th term in the sequence.
Thus,
T(1) calculates the value of the 1st term
T(2) calculates the value of the 2nd term
T(3) calculates the value of the 3rd term
.
.
an so on
the value of the third term is T(3)=3*3-1=9-1=8
Answer: 8