Beginner
Discrete Mathematics & Math
Q31 / 100
What is a bijection?
Correct! Well done.
Incorrect.
The correct answer is B) A function that is both injective (one-to-one) and surjective (onto), enabling a perfect pairing between domain and codomain
B
Correct Answer
A function that is both injective (one-to-one) and surjective (onto), enabling a perfect pairing between domain and codomain
Explanation
Bijections (1-1 correspondences) prove two sets have the same cardinality. Inverses always exist for bijections. Bijections from a set to itself are permutations. Cantor used bijections to compare infinite set sizes.
Progress
31/100