2.1 Practice

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

NAME _____________________________________________ DATE ____________________________ PERIOD _____________

2-1 Practice
Relations and Functions
Bellringer:
State the domain and range of each relation. Then determine whether each relation is a function. If it is a function,
determine if it is one-to-one, onto, both or neither.

1. 2.
not a function Yes it is a function, onto
D: {2,8} D: {5, 10, 15}
R: {21, 25, 30} R: {105, 110}

3. x y 4. x y
It is a function, onto It is not a function
–3 0 –2 –1

–1 –1 D:{-3. -1, 0, 2, 3} –2 1 D:{-2,-1,1,2}


R:{-1,0.-2,4} R:{-1,0,1}
0 0 –1 0

2 –2 1 0

3 4 2 1

Graph each equation and determine the domain and range. Determine whether the relation is a function, is one-to-
one, onto, both, or neither. Then state whether it is discrete or continuous.

5. x = –1 6. y = 2x – 1

D:{-1} D: {all real numbers}


R:{all real numbers} R: {all real numbers}

continous continous

𝟓
Find each value if f(x) = 𝒙 + 𝟐 and g(x) = –2x + 3.
1
7. f(3) = 5/2 8. f(–4) =5/-6 9. g(2) =2

10. f(–2) =0 11. g(–6) =15 12. f(m – 2) = 5/m

13. MUSIC The ordered pairs (1, 16), (2, 16), (3, 32), (4, 32), and (5, 48) represent the cost of buying various numbers of
CDs through a music club. Identify the domain and range of the relation. Is the relation discrete or continuous? Is the
relation a function? It is a function, D:{1,2,3,4,5} R:{16,32,48} The function is discrete

14. COMPUTING If a computer can do one calculation in 0.0000000015 second, then the function T(n) =
0.0000000015n gives the time required for the computer to do n calculations. How long would it take the computer to
do 5 billion calculations?

Chapter 2 8 Glencoe Algebra 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy