Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define what an injective function is.
Think of it as one-to-one relationships.
Give an example of a surjective function.
Consider if every output can be reached.
What is an injective function?
Remember the concept of one-to-one relationship.
True or False: Every bijective function has an inverse.
Think about the requirements for a function to have an inverse.
Consider the function f(x) = 3x – 2. Prove whether this function is bijective and determine its inverse.
Check both injectivity and surjectivity to confirm bijection.
Is it possible for a function to be injective but not surjective? Provide an example.
Review the definitions to clarify the difference between injective and surjective.
4 more questions in this section. Enroll free to practise them all.
Enroll free