Practice One-to-one Correspondence (bijective Function) (2.2.3)

Practise this section

8 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does it mean for a function to be injective?
Show hintHide hint
Think about one input leading to one specific output.
Question 2.
Provide an example of a surjective function.
Show hintHide hint
Ensure all targets in your output set have pre-images.
3Question 3.
What is a necessary condition for a function to be bijective?
- It must be injective
- It must be surjective
- Both injective and surjective
Show hintHide hint
Think about the definitions of injective and surjective.
4Question 4.
True or False: A function that maps some elements in the co-domain to multiple elements in the domain can still be bijective.
- True
- False
Show hintHide hint
Remember the definition of a one-to-one function.
Question 5.
Create a function that is injective but not surjective. Show its mapping.
Show hintHide hint
Ensure it has unique domain outputs but misses one or more co-domain targets.
Question 6.
Define a function that is surjective but not injective. Illustrate your function with a mapping.
Show hintHide hint
Check your outputs against each unique input.

4 more questions in this section. Enroll free to practise them all.