| << Chapter < Page | Chapter >> Page > |
Is there any function that is equal to its own inverse?
Yes. If f=f−1, then f(f(x))=x, and we can think of several functions that have this property. The identity function does, and so does the reciprocal function, because
Any function f(x)=c−x, where c is a constant, is also equal to its own inverse.
Access these online resources for additional instruction and practice with inverse functions.
Visit this website for additional practice questions from Learningpod.
Describe why the horizontal line test is an effective way to determine whether a function is one-to-one?
Each output of a function must have exactly one output for the function to be one-to-one. If any horizontal line crosses the graph of a function more than once, that means that y -values repeat and the function is not one-to-one. If no horizontal line crosses the graph of the function more than once, then no y -values repeat and the function is one-to-one.
Why do we restrict the domain of the function f(x)=x2 to find the function’s inverse?
Can a function be its own inverse? Explain.
Yes. For example, f(x)=1x is its own inverse.
Are one-to-one functions either always increasing or always decreasing? Why or why not?
How do you find the inverse of a function algebraically?
Given a function y=f(x), solve for x in terms of y. Interchange the x and y. Solve the new equation for y. The expression for y is the inverse, y=f−1(x).
Show that the function f(x)=a−x is its own inverse for all real numbers a.
For the following exercises, find f−1(x) for each function.
f(x)=2x+35x+4
For the following exercises, find a domain on which each function f is one-to-one and non-decreasing. Write the domain in interval notation. Then find the inverse of f restricted to that domain.
f(x)=(x−6)2
Given f(x)=x2+x and g(x)=2x1−x:
a. f(g(x))=x and g(f(x))=x. b. This tells us that f and g are inverse functions
Notification Switch
Would you like to follow the 'Algebra and trigonometry' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
