Je bent je ingevulde velden bij deze pagina aan het verwijderen. Ben je zeker dat je dit wilt doen?
You are erasing your filled-in fields on this page. Are you sure that is what you want?
Nieuwe Versie BeschikbaarNew Version Available
Er is een update van deze pagina. Als je update naar de meest recente versie, verlies je mogelijk je huidige antwoorden voor deze pagina. Hoe wil je verdergaan ?
There is an updated version of this page. If you update to the most recent version, then your current progress on this page will be erased. Regardless, your record of completion will remain. How would you like to proceed?
Below is a few practice problems of various difficulty, but you will need considerably more practice than one each. For that reason
you should definitely use the green “Try Another” button in the top right corner at least two or three times to complete
additional versions of these questions for more practice. You should keep using that button until doing these problems feels straight
forward and easy, and then come back after a week or so of doing other stuff and try again to make sure it is still just as easy for
you.
Consider the following set of ordered pairs that represent input-output values of a relation (ie for an ordered pair the ‘input’ is
and the ‘output’ is );
Is this relation a function? Enter the number 1 if the above represents a function, or 0 if it does not.
Remember that, in order
for something to be a function, it needs to have exactly 1 output for any given input. This means that if the same input appears
more than once with a different associated output [that is, if you have two ordered pairs with the same value but different values]
then the underlying relation cannot be a function.
Consider the following set of ordered pairs that represent input-output values of a relation (ie for an ordered pair the ‘input’ is
and the ‘output’ is );
Is this relation a function? Enter the number 1 if the above represents a function, or 0 if it does not.
Remember that, in order
for something to be a function, it needs to have exactly 1 output for any given input. This means that if the same input appears
more than once with a different associated output [that is, if you have two ordered pairs with the same value but different values]
then the underlying relation cannot be a function.
Consider the following set of ordered pairs that represent input-output values of a relation (ie for an ordered pair the ‘input’ is
and the ‘output’ is );
Is this relation a function? Enter the number 1 if the above represents a function, or 0 if it does not.
Remember that, in order
for something to be a function, it needs to have exactly 1 output for any given input. This means that if the same input appears
more than once with a different associated output [that is, if you have two ordered pairs with the same value but different values]
then the underlying relation cannot be a function.
