Answer:
Whats the question?
Step-by-step explanation:
End behavior always involves x approaching positive and negative infinity. So we'll cross off the choice that says "x approaches 1".
The graphs shows both endpoints going down forever. So both endpoints are going to negative infinity regardless if x goes to either infinity.
<h3>Answer: Choice B</h3><h3>As x approaches −∞, f(x) approaches −∞, and as x approaches ∞, f(x) approaches −∞.</h3>
Another way to phrase this would be to say "f(x) approaches negative infinity when x goes to either positive or negative infinity"
B. $256.50
1) $400 x .25 = $100 --> $400 - $100= $300
2) $300 x .10 = $30 --> $300 - $30 = $270
3) $270 x .05 = $13.5 --> $270 - $13.5 = $256.50
480700. The different combinations of students that could go on the trip with a total of 25 student, but only 18 may go, is 480700.
The key to solve this problem is using the combination formula
. This mean the number of ways to choose a sample of r elements from a set of n distinct objects where order does not matter and replacements are not allowed.
The total of students is n and the only that 18 students may go is r:
![25C_{18}=\frac{25!}{18!(7!)}=480700](https://tex.z-dn.net/?f=25C_%7B18%7D%3D%5Cfrac%7B25%21%7D%7B18%21%287%21%29%7D%3D480700)
Number 1 is add 3
Number 2 is add 4
Number 3 is add 6
Number 4 is add 7