Let A be a finite set. If f : A → A is injective then it is surjective.

Related MCQs

• How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?
• The function f : A → B is injective if whenever f (x)= f (y), where x, y € A, then x = y.
• If |A|=5 and |B|=4, then there exists an injective function f: B→A.
• If A be a finite set of size n, then number of elements in the power set of A x A is
• Let p be “He is tall” and let q “He is handsome”. Then the statement “It is false that he is short or handsome” is:
• Let f : X →Y and g : Y → Z. Let h = go f : X → Z. Suppose g is one-to-one and onto. Which of the following is FALSE?
• Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true?
• Let P(S) denote the power set of set S. which of the is always true
• Let R be a relation on a set A = {1, 2, 3, 4} given by R = {(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3, 3)}. Then the relation is:
• Let P(S) denotes the powerset of set S. Which of the following is always true?