Assertion (A) : Let be the set of integers. A function defined as , is a bijective.…

MATHEMATICS · Subjective · CBSE · Mathematics · Relations and Functions · Relations and Functions

Problem

Assertion (A) : Let ZZ be the set of integers. A function f:Z→Zf: Z \to Z defined as f(x)=3x−5f(x) = 3x - 5 , ∀x∈Z\forall x \in Z is a bijective. Reason (R) : A function is a bijective if it is both surjective and injective. (A) Both Assertion (A) and Reason (R) are true and the Reason (R) is the correct explanation of the Assertion (A). (B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A). (C) Assertion (A) is true, but Reason (R) is false. (D) Assertion (A) is false, but Reason (R) is true.

Related theory

Browse the problem library