Back to all chapters
# Bijections

Bijections, surjections, and injections are three types of functions which associate the elements between two sets. For example, each word in this sentence can be mapped to exactly one in the last.

A function \(f\) maps the elements of \(A = \{14, 16, 18, 20\}\) to elements of \(B =\{55, 66, 77, 88, 99\}.\) How many of the possible maps \(f\) are not injective?

**Details and assumptions**

A function is **injective** if each element in the codomain is mapped onto by at most one element in the domain.

×

Problem Loading...

Note Loading...

Set Loading...