Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
Define a surjective function.
Think of how each output is achieved through inputs.
List one property of bijective functions.
Recall the letter B represents both properties.
What is a surjective function?
Consider the mapping of inputs to outputs.
If a function is surjective and operates over a finite set, is it also bijective?
Think about what happens when the number of elements match.
Prove that every surjective function from a finite set to itself is bijective.
Consider the cardinality of the domain and codomain.
Construct a surjective function from {1, 2, 3, 4} to {A, B} that is not injective, and explain why.
Analyze how many distinct inputs share the same output.
6 more questions in this section. Enroll free to practise them all.
Enroll free