To determine whether each set of ordered pairs represents a one-to-one function, we need to check if each input (the first element in each pair) maps to a unique output (the second element in each pair). In other words, no two different inputs should produce the same output.
Let's analyze each option:
-
{(4,2),(7,3),(10,7),(5,8),(6,2)}
- Outputs: 2, 3, 7, 8.
- Input 4 maps to 2 and input 6 also maps to 2.
- Not one-to-one.
-
{(1,3),(4,5),(7,2),(1,5),(4,3)}
- Outputs: 3, 5, 2.
- Input 1 maps to both 3 and 5, and input 4 maps to both 5 and 3.
- Not one-to-one.
-
{(7,9),(6,4),(1,2),(5,3),(4,1)}
- Outputs: 9, 4, 2, 3, 1.
- Each input maps to a unique output.
- One-to-one.
-
{(2,1),(4,3),(6,3),(8,6),(10,9)}
- Outputs: 1, 3, 6, 9.
- Input 4 maps to 3 and input 6 also maps to 3.
- Not one-to-one.
The only one-to-one function among the given options is:
{(7,9),(6,4),(1,2),(5,3),(4,1)}