Ted and Alan are in a race to double their money. Ted feels he will win if he puts his $4,000 into a savings account offering 4.
2 answers:
You might be interested in
Option C: –10, –7.5, –5, –2.5, … is the sequence that could be partially defined by the recursive formula
Explanation:
The given recursive formula is for
and
We need to determine the sequence.
The sequence can be determined by substituting n = 1, 2, 3, 4,....
<u>2nd term of the sequence:</u>
Substituting n = 1 in the formula , we get,
Simplifying, we have,
Thus, the 2nd term of the sequence is -7.5
<u>3rd term of the sequence:</u>
Substituting n = 2 in the formula , we get,
Simplifying, we have,
Thus, the 3rd term of the sequence is -5
<u>4th term of the sequence:</u>
Substituting n = 3 in the formula , we get,
Simplifying, we have,
Thus, the 4th term of the sequence is -2.5
Therefore, the sequence is –10, –7.5, –5, –2.5, …
Hence, Option C is the correct answer.
Work the information to set inequalities that represent each condition or restriction.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.
2) Name the variables.
c: number of color copies
b: number of black-and-white copies
3) Model each restriction:
i) <span>It takes 3 minutes to print a color copy and 1 minute to print a black-and-white copy.
</span><span>
</span><span>3c + b
</span><span>
</span><span>
</span><span>ii) He needs to print at least 6 copies ⇒ c + b ≥ 6
</span><span>
</span><span>
</span><span>iv) And must have the copies completed in no more than 12 minutes ⇒</span>
3c + b ≤ 12
<span />
4) Additional restrictions are c ≥ 0, and b ≥ 0 (i.e. only positive values for the number of each kind of copies are acceptable)
5) This is how you graph that:
i) 3c + b ≤ 12: draw the line 3c + b = 12 and shade the region up and to the right of the line.
ii) c + b ≥ 6: draw the line c + b = 6 and shade the region down and to the left of the line.
iii) since c ≥ 0 and b ≥ 0, the region is in the first quadrant.
iv) The final region is the intersection of the above mentioned shaded regions.
v) You can see such graph in the attached figure.