Download File
Download File
Download File
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
194 Chapter 3 Exponential and Logarithmic Functions<br />
7.<br />
fx 1 5 x 5 x<br />
8.<br />
hx 3 2 x<br />
x 2 1 0 1 2<br />
y 25 5 1<br />
1<br />
5<br />
1<br />
25<br />
x 2 1 0 1 2<br />
y<br />
9 3<br />
1<br />
4<br />
2<br />
2<br />
3<br />
4<br />
9<br />
y<br />
4<br />
3<br />
1<br />
Asymptote: y 0<br />
Intercept: 0, 1<br />
Decreasing<br />
9<br />
8<br />
7<br />
6<br />
5<br />
4<br />
3<br />
2<br />
y<br />
Asymptote: y 0<br />
Intercept: 0, 1<br />
Decreasing<br />
–2 –1 1 2<br />
x<br />
−5 −4 −3 −2 −1<br />
1<br />
2<br />
3<br />
4<br />
5<br />
x<br />
9.<br />
hx 5 x2<br />
10.<br />
gx 3 2 x2<br />
x 1 0 1 2 3<br />
1<br />
125<br />
1<br />
25<br />
1<br />
5<br />
y 1 5<br />
x 4 3 2 1 0<br />
y<br />
4 2<br />
1<br />
9<br />
3<br />
3<br />
2<br />
9<br />
4<br />
y<br />
4<br />
3<br />
2<br />
Asymptote:<br />
Intercept:<br />
Increasing<br />
y 0<br />
0, 1 25<br />
9<br />
8<br />
7<br />
6<br />
5<br />
4<br />
3<br />
y<br />
Asymptote: y 0<br />
Intercept: 0, 9 4<br />
Increasing<br />
1<br />
1 2 3 4<br />
x<br />
−5 −4 −3 −2 −1<br />
1<br />
1<br />
2<br />
3<br />
4<br />
5<br />
x<br />
11.<br />
gx 5 x 3<br />
12.<br />
fx 3 2 x 2<br />
x 1 0 1 2<br />
y 2 2 2 24<br />
2 4 5<br />
y<br />
1<br />
x<br />
–2 –1 1 2<br />
–2<br />
13. fx 2 x2 rises to the right.<br />
Asymptote: y 0<br />
Intercept: 0, 1 4 <br />
Matches graph (d).<br />
25<br />
Asymptote: y 3<br />
Intercepts:<br />
0, 2, 0.683, 0<br />
Decreasing<br />
x 2 1 0 1 2<br />
y<br />
17 7<br />
3<br />
4<br />
−5 −4 −3 −2 −1<br />
9<br />
8<br />
7<br />
6<br />
5<br />
4<br />
2<br />
1<br />
y<br />
2<br />
1<br />
2<br />
3<br />
4<br />
5<br />
8<br />
3<br />
x<br />
22<br />
9<br />
Asymptote: y 2<br />
Intercept: 0, 3<br />
Decreasing<br />
14. f x 2 x is positive and decreasing.<br />
Matches graph (a).<br />
© Houghton Mifflin Company. All rights reserved.