Consider the following tasks related to basic types of functions.

MATHEMATICS · Multi-part · CBSE · Mathematics · Relations and Functions · Relations and Functions

Problem

Consider the following tasks related to basic types of functions. (a) Part 1: (i) Define an injective function and a surjective function. (b) Part 2: (ii) Let AA be a finite set with ∣A∣=n|A| = n. Explain why every injective function f:A→Af : A \to A must necessarily be bijective. (c) Part 3: (iii) State whether the conclusion in part (ii) remains true when AA is an infinite set, giving a brief justification or a counter-example.

Related theory

Browse the problem library