Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
Define an injective function in your own words.
Think about how one-to-one mapping works.
Give an example of a surjective function.
Consider functions that cover all elements in its codomain.
What is an injective function?
Think of one-to-one relationships.
True or False: Every bijective function is surjective.
Recall what the definition of bijective means.
Given the function f(x) = 2x + 3, state whether it is injective and surjective. Prove your answer.
Analyze injectiveness using algebraic manipulation.
Consider the function f: Z -> Z defined as f(n) = n². Explain how to restrict its domain to ensure it's bijective.
Focus on the concepts of output duplication.
5 more questions in this section. Enroll free to practise them all.
Enroll free