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 an onto function in your own words.
Think about functions where every output has a corresponding input.
What condition must be met for a function to be considered onto?
Consider what it means for something to be covered completely.
What is an onto function?
Remember the definition of mapping in functions.
True or False: A function can be onto if the domain has fewer elements than the codomain.
Think about how functions work with outputs.
Given a set A with 6 elements and set B with 4 elements, determine how many onto functions can exist.
Break it down using f(m, n) recursively.
Explain why the number of onto functions decreases as the size of the codomain grows beyond the domain.
Think about coverage; if more elements exist in B than A, it can't map fully.
5 more questions in this section. Enroll free to practise them all.
Enroll free