Start Learning Free

Mathematics • Class 12

Relations and Functions - Class 12

Master Advanced Functions & Relations through focused practice that strengthens conceptual understanding, problem-solving skills, and the ability to recognize common traps and misconceptions. Explore challenging questions designed to develop deeper reasoning and confident application of key ideas.

Overview

This chapter explores the concepts of relations and functions in depth. It covers types of relations, functions, their properties, and composite functions. The chapter also introduces invertible functions and their applications.

Why This Chapter Matters

  • Relations and Functions form the basis of advanced topics in mathematics, such as calculus and algebra. Understanding these concepts is crucial for excelling in Class 12 board exams and competitive exams like JEE.

Real-Life Applications

  • Understanding data relationships in computer science and programming.
  • Applying functional relationships in physics and engineering problems.
  • Building a foundation for advanced studies in mathematics and science.

Skills You Will Learn

  • Identifying and analyzing different types of relations.
  • Understanding properties of functions and their applications.
  • Working with composite and invertible functions.

Core Concepts to Master

Empty and Universal Relation

The empty relation is a subset of every set; ensure the set A is non-empty before declaring.

Reflexivity in Empty Sets

A relation on an empty set is vacuously reflexive; a common edge case trap for students.

Symmetry vs. Antisymmetry

A relation can be both symmetric and antisymmetric, or neither. Do not assume mutual exclusivity.

Transitivity of Identity

Transitivity holds if (a,b) and (b,c) exist; if (a,b) exists but no (b,c) exists, it is vacuously transitive.

Equivalence Class Partitioning

Equivalence classes form a partition; every element must belong to exactly one class. Disjoint sets are mandatory.

Injective Mapping (One-One)

Check f'(x) monotonicity; if the function changes direction, it fails the horizontal line test for injectivity.

Surjective Mapping (Onto)

Ensure the codomain is explicitly defined. If codomain equals range, the function is surjective.

Bijectivity and Inverse

Inverse exists if and only if the function is bijective. Check both one-one and onto conditions rigorously.

Composition Non-Commutativity

fog(x) is rarely equal to gof(x). Apply inner function first; preserve variable mapping order strictly.

Composite Injectivity/Surjectivity

If fog is injective, g must be injective. If fog is surjective, f must be surjective. Map these dependencies.

Binary Operation Closure

An operation * on A is binary if for all a, b in A, a*b is strictly in A.

Identity Element Uniqueness

The identity element must be unique and consistent across the entire set; check boundary values carefully.

Invertibility in Binary Operations

An element is invertible if a*b = e = b*a; the inverse must exist within the defined set.

Domain Restrictions

Always verify if the function is defined for all x in the given domain, especially under square roots/denominators.

Greatest Integer Function Traps

Discontinuities in [x] affect range and surjectivity. Never assume continuous behavior for step functions.

Concept Collisions Used by Examiners

Competitive examinations rarely assess concepts in isolation. Instead, examiners intentionally combine multiple concepts from this and related chapters to create higher-order questions that test conceptual reasoning, analytical thinking, and problem-solving ability. The concept collision patterns below represent the combinations most frequently used while designing questions for this chapter.

Empty and Universal Relation
Line-Plane intersection logic
Geometric Interpretation of Cross Product
Empty and Universal Relation
Orthogonal Matrix Conditions
Modulus Inequality Logic
Geometrical Interpretation of Modulus
Empty and Universal Relation
Ratio of Division (k:1)
Octant Sign Convention
Empty and Universal Relation
Rolle's Theorem Root Existence
Chain Rule Inner Function Differentiability
Even Multiplicity Roots
Empty and Universal Relation
Sample Space Construction
Mutually Exclusive vs Independent
Reflexivity in Empty Sets
Equivalence Class Partitioning
Closed vs Open Intervals
Reflexivity in Empty Sets
Quadratic Equations with Complex Coefficients
Conjugate Root Theorem
Reflexivity in Empty Sets
Singular vs Non-Singular Matrices
Row/Column Exchange Parity
Reflexivity in Empty Sets
Standard Ellipse/Circle Area
The Modulus Trap
Symmetry vs. Antisymmetry
Invertibility in Binary Operations
Integral Part and Fractional Part
Symmetry vs. Antisymmetry
Linear Independence vs Dependence
Dot Product Projection Sign
Symmetry vs. Antisymmetry
String Method (Adjacency)
Modulus Function Breakdown
Transitivity of Identity
Condition for Common Roots
The Zero-Factor Cancellation Trap
Transitivity of Identity
Indicator Function Logic
Sample Space Partitioning
Transitivity of Identity
Linear Dependency of Rows
Greatest Integer Function Traps
Transitivity of Identity
The Sum-Difference Formula Constraints
Principal Value Branch Boundaries
Equivalence Class Partitioning
De Moivre’s Theorem Applications
Geometry of Complex Inequalities
Equivalence Class Partitioning
Division into Groups
Selection from Identical Items
Equivalence Class Partitioning
Domain Constraint Intersections
Modulus Inequality Logic
Equivalence Class Partitioning
Inversion and Determinant Product
Inverse Existence Criterion
Equivalence Class Partitioning
Sample Space Partitioning
Equiprobable Outcomes
Equiprobability Fallacy
Injective Mapping (One-One)
Composite Injectivity/Surjectivity
Principal Value Branch Boundaries
The Sum-Difference Formula Constraints
Injective Mapping (One-One)
Locus Problems via Transformation
The Modulus Trap
Injective Mapping (One-One)
Newton-Leibniz Formula with variable limits
Bounded vs Unbounded Regions
Injective Mapping (One-One)
Rolle's Theorem Root Existence
Parametric Derivative Endpoint Trap
Second Derivative Test Limitations
Injective Mapping (One-One)
System of Linear Equations (Cramer/Inverse)
Quadratic Equations with Complex Coefficients
Surjective Mapping (Onto)
Idempotent and Involutory Properties
Transpose of Product
Surjective Mapping (Onto)
Mean Value Theorem Applicability
L'Hopital's Pitfall
Surjective Mapping (Onto)
Roots of Unity Properties
Argument and Principal Value
Surjective Mapping (Onto)
The Telescopic Series Trap
Logarithmic Series
Surjective Mapping (Onto)
Variable Transformation Substitution
Implicit to Explicit Conversion
Bijectivity and Inverse
Logarithmic Differentiation Domain
Modulus Function Breakdown
Bijectivity and Inverse
Orthogonal projection of a line
Direction Cosines constraint
Bijectivity and Inverse
Properties of Transpose Determinant
Matrix Multiplication Non-Commutativity
Bijectivity and Inverse
Skew-Symmetric Determinant
Modulus Function Breakdown
Bijectivity and Inverse
Sum to n terms vs. General Term
Wavy Curve (Method of Intervals)
Composition Non-Commutativity
Arithmetic Mean Inequality
Inequalities in Definite Integrals
Composition Non-Commutativity
Inverse Existence Criterion
The L'Hôpital's Rule Misuse
Composition Non-Commutativity
Matrix Multiplication Non-Commutativity
Greatest Integer Function Traps
Square Root and Modulus Logic
Composition Non-Commutativity
Quadratic Roots in Sequences
Greatest Integer Function Traps
Composition Non-Commutativity
Surjective Mapping (Onto)
Function Definition (The 'One-to-One' Constraint)
Composite Injectivity/Surjectivity
Bernoulli Equation Transformation
Integration Constant Trap
Second Derivative Test Limitations
Composite Injectivity/Surjectivity
Insertion of Means
Multinomial Theorem
Complementary Counting
Composite Injectivity/Surjectivity
Shortest distance between skew lines
Collinearity vs Coplanarity
Cross Multiplication Trap
Binary Operation Closure
Combinatorial Counting (P&C Integration)
Complementary Counting
Binary Operation Closure
Geometric Interpretation of Cross Product
Lagrange Identity
Binary Operation Closure
Greatest Integer Function (GIF)
Signum Function Discontinuity
Binary Operation Closure
Inverse Existence Criterion
Nilpotent Matrix Logic
Identity Element Uniqueness
Composite Injectivity/Surjectivity
Tangent Half-Angle Substitution
Inverse Function Periodicity
Identity Element Uniqueness
Matrix Multiplication Non-Commutativity
Triangular/Diagonal Matrix Shortcut
Identity Element Uniqueness
Method of Differences
Denominator Restriction
Invertibility in Binary Operations
Algebra of Functions
Trigonometric Standard Limits
Invertibility in Binary Operations
Newton-Leibniz Formula with variable limits
Modulus Function Breakdown
Invertibility in Binary Operations
Sigma Notation Properties
Integral Part and Fractional Part
Invertibility in Binary Operations
Symmetry vs. Antisymmetry
Cardinality of Power Sets
Domain Restrictions
Condition of Tangency
Domain and Range Nuance
Domain Restrictions
Mean Value Theorem Applicability
Signum Function Discontinuity
Domain Restrictions
Newton-Leibniz Formula with variable limits
The Modulus Trap
Greatest Integer Function Traps
Indeterminate Forms
Modulus Sign Dependency
Greatest Integer Function Traps
Injective Mapping (One-One)
Bijectivity and Inverse
Greatest Integer Function Traps
Linearity and Partitioning
Even and Odd Function Symmetry
Greatest Integer Function Traps
Rolle's Theorem Root Existence
Parametric Derivative Endpoint Trap
Greatest Integer Function Traps
Substitution Logic in Homogeneous DE
Integration Constant Trap

Exam Coverage

Understand how this chapter is tested across major competitive examinations.

JEE Advanced

India · Competitive Exam · Undergraduate

JEE Main

India · Competitive Exam · Undergraduate

BITSAT

India · Competitive Exam · Undergraduate

IISER Aptitude Test (IAT)

India · Competitive Exam · Undergraduate

NEST

India · Competitive Exam · Undergraduate

ISI Admission Test

India · Competitive Exam · Undergraduate

CMI Entrance

India · Competitive Exam · Undergraduate

IOQM / INMO

India · Olympiad · High School

SAT Math

United States · Curriculum · High School

A-Level Mathematics

United Kingdom · Curriculum · Advanced Level

A-Level Further Mathematics

United Kingdom · Curriculum · Advanced Level

IB Mathematics AA HL

International · Curriculum · IB Diploma

Singapore A-Level Mathematics

Singapore · Curriculum · Advanced Level

Cambridge International A-Level Mathematics

International · Curriculum · Cambridge

International Mathematical Olympiad (IMO)

International · Olympiad · International

Practice Questions

Strengthen your understanding by solving carefully selected questions from this chapter.

50 Questions
1

Let S={A∈M3(R)∣ATA=I and det⁡(A)=1}S = \{ A \in M_3(\mathbb{R}) \mid A^T A = I \text{ and } \det(A) = 1 \}. For any matrix M∈M3(R)M \in M_3(\mathbb{R}), its Frobenius norm is defined as ∣∣M∣∣=Tr(MTM)||M|| = \sqrt{\text{Tr}(M^T M)}. Two relations R1\mathcal{R}_1 and R2\mathcal{R}_2 are defined on SS as follows: A R1 B  ⟺  ∣∣A−B∣∣2<pA \ \mathcal{R}_1 \ B \iff ||A - B||^2 < p A R2 B  ⟺  ∣∣A−B∣∣2>qA \ \mathcal{R}_2 \ B \iff ||A - B||^2 > q If pp is the smallest integer such that R1\mathcal{R}_1 is the universal relation on SS, and qq is the smallest integer such that R2\mathcal{R}_2 is the empty relation on SS, then the value of p+qp + q is:

2

Let X={1,2,3}X = \{1, 2, 3\}. A relation RR on XX is chosen at random from the set of all possible relations on XX. Let E1E_1 be the event that RR is the universal relation on XX and is also anti-symmetric. Let E2E_2 be the event that RR is an equivalence relation on XX. Which of the following statements is true regarding the events E1E_1 and E2E_2?

3

Let f(x)=∫0x(t2−2∣t∣+1)2(t2−9)2dtf(x) = \int_0^x (t^2 - 2|t| + 1)^2 (t^2 - 9)^2 dt. Let S={x∈R:f′(x)=0}S = \{x \in \mathbb{R} : f'(x) = 0\}. A relation RR is defined on SS such that for a,b∈Sa, b \in S, aRba R b if and only if a<ba < b and there exists c∈(a,b)c \in (a, b) satisfying f′′(c)=0f''(c) = 0. Find the number of elements in RR.

4

Let SS be the set of all points that divide the line segment joining A(2,−3,4)A(2, -3, 4) and B(−1,1,−1)B(-1, 1, -1) strictly internally. A relation RnR_n on SS is defined as (P,Q)∈Rn(P, Q) \in R_n if and only if both PP and QQ lie strictly inside the nthn^{\text{th}} octant. Let EE be the set of all octant numbers n∈{1,2,…,8}n \in \{1, 2, \dots, 8\} for which RnR_n is an empty relation. If PαP_\alpha and PβP_\beta are the boundary points of the segment of ABAB that lies in the 3rd3^{\text{rd}} octant, find the value of ∑n∈En+9×(sum of all coordinates of Pα and Pβ)\sum_{n \in E} n + 9 \times (\text{sum of all coordinates of } P_\alpha \text{ and } P_\beta).

5

Let SS be the set of all points on the line L:x−21=y−12=z−32L: \frac{x-2}{1} = \frac{y-1}{2} = \frac{z-3}{2}. Let Π\Pi be the plane containing the point B(1,0,−1)B(1, 0, -1) and parallel to the vectors p⃗=i^+αj^+k^\vec{p} = \hat{i} + \alpha\hat{j} + \hat{k} and q⃗=2i^−j^+βk^\vec{q} = 2\hat{i} - \hat{j} + \beta\hat{k}, where α,β∈Z+\alpha, \beta \in \mathbb{Z}^+ and α<β\alpha < \beta. A relation RR on SS is defined as: for X,Y∈SX, Y \in S, XRYX R Y if and only if the midpoint of the line segment XYXY lies on the plane Π\Pi. If RR is an empty relation on SS, find the value of (α+β)(αβ)(\alpha + \beta)(\alpha \beta).

6

Let SS be the set of all 3×33 \times 3 matrices over R\mathbb{R} with entries from {0,1}\{0, 1\}. We define three subsets of SS as follows: X={A∈S∣det⁡(A)=0 and det⁡(R12(A))≠0}X = \{ A \in S \mid \det(A) = 0 \text{ and } \det(R_{12}(A)) \neq 0 \} Y={A∈S∣det⁡(A)≠0 and det⁡(R12(A))=det⁡(A)}Y = \{ A \in S \mid \det(A) \neq 0 \text{ and } \det(R_{12}(A)) = \det(A) \} W={A∈S∣AT=−A and A≠O}W = \{ A \in S \mid A^T = -A \text{ and } A \neq O \} where R12(A)R_{12}(A) denotes the matrix obtained by swapping the first and second rows of AA, and OO is the 3×33 \times 3 null matrix. Let Z=X∪Y∪WZ = X \cup Y \cup W. Let nn be the number of reflexive relations on ZZ, and mm be the number of symmetric relations on ZZ. Find the value of n+mn + m.

7

Let S={z∈C∣z2−2iz−2=0 and zˉ2−2izˉ−2=0}S = \{ z \in \mathbb{C} \mid z^2 - 2iz - 2 = 0 \text{ and } \bar{z}^2 - 2i\bar{z} - 2 = 0 \}. Let RR be a relation on SS defined by z1Rz2  ⟺  z1+z2=0z_1 R z_2 \iff z_1 + z_2 = 0. Which of the following statements is true?

8

Let SS be the set of all ellipses E:x2a2+y2b2=1E: \frac{x^2}{a^2} + \frac{y^2}{b^2} = 1 (a>b>0a > b > 0) such that their eccentricity ee satisfies ∫0e∣3t−1∣ dt=56\int_{0}^{e} |3t - 1| \, dt = \frac{5}{6} A relation RR is defined on SS by E1RE2E_1 R E_2 if and only if the area of E1E_1 is strictly less than the area of E2E_2. Which of the following statements is true about the relation RR?

9

Let X={1,2,3,…,20}X = \{1, 2, 3, \dots, 20\}. For each x∈Xx \in X, define the set SxS_x as the interval: Sx=[⌊x4⌋,⌊x4⌋+log⁡2(1+sin⁡2(πx2)))S_x = \left[ \left\lfloor \frac{x}{4} \right\rfloor, \left\lfloor \frac{x}{4} \right\rfloor + \log_2\left(1 + \sin^2\left(\frac{\pi x}{2}\right)\right) \right) where ⌊⋅⌋\lfloor \cdot \rfloor denotes the greatest integer function. A relation RR is defined on XX such that xRyx R y if and only if Sx∩Sy≠∅S_x \cap S_y \neq \emptyset. Which of the following statements is true?

10

Let M(x)=([x][x+13][x+23][x+13][x+23][x+1][x+23][x+1][x+43])M(x) = \begin{pmatrix} [x] & [x+\frac{1}{3}] & [x+\frac{2}{3}] \\ [x+\frac{1}{3}] & [x+\frac{2}{3}] & [x+1] \\ [x+\frac{2}{3}] & [x+1] & [x+\frac{4}{3}] \end{pmatrix}, where [t][t] denotes the greatest integer less than or equal to tt. Let S={M(x)∣x∈[0,10]}S = \{ M(x) \mid x \in [0, 10] \}. A relation RR is defined on SS such that M(x)RM(y)  ⟺  det⁡(M(x))=det⁡(M(y))M(x) R M(y) \iff \det(M(x)) = \det(M(y)). Let NN be the number of distinct equivalence classes of RR, and I=∫010∣det⁡(M(x))∣ dxI = \int_{0}^{10} |\det(M(x))| \, dx. Find the value of N+3IN + 3I.

11

Define a relation ∼\sim on R\mathbb{R} by α∼β  ⟺  sin⁡α=sin⁡β\alpha \sim \beta \iff \sin \alpha = \sin \beta. For x>1x > 1, consider the function S(x)=arcsin⁡(2x1+x2)+arccos⁡(1−x21+x2)+arctan⁡(2x1−x2)S(x) = \arcsin\left(\frac{2x}{1+x^2}\right) + \arccos\left(\frac{1-x^2}{1+x^2}\right) + \arctan\left(\frac{2x}{1-x^2}\right) Let P(x)P(x) be the unique value in [−π2,π2]\left[-\frac{\pi}{2}, \frac{\pi}{2}\right] such that P(x)∼S(x)P(x) \sim S(x). Which of the following expressions is identically equal to P(x)P(x) for all x>1x > 1?

12

Let SS be the family of equations Ea:ax2+(a2+4)x+4a=0E_a : a x^2 + (a^2 + 4) x + 4a = 0 for a∈Ra \in \mathbb{R}. A relation RR is defined on SS such that EaREbE_a R E_b if and only if EaE_a and EbE_b have the exact same set of real roots. Let [Ea][E_a] denote the equivalence class of EaE_a under RR. Find the number of values of a∈Ra \in \mathbb{R} for which [Ea][E_a] contains exactly one element.

13

Let A,B,A, B, and CC be three events in a probability space such that P(A)=P(B)=P(C)>0P(A) = P(B) = P(C) > 0. Let IEI_E denote the indicator function of an event EE. If the relation ∣IA−IC∣=∣IA−IB∣+∣IB−IC∣|I_A - I_C| = |I_A - I_B| + |I_B - I_C| holds almost surely, and P(A∣B)=P(B∣C)=34P(A|B) = P(B|C) = \frac{3}{4}, find the value of P(A∣C)P(A|C).

14

Let S5S_5 be the set of all permutations of the set {1,2,3,4,5}\{1, 2, 3, 4, 5\}. An equivalence relation ∼\sim is defined on S5S_5 such that for σ,τ∈S5\sigma, \tau \in S_5, σ∼τ\sigma \sim \tau if and only if σ\sigma and τ\tau have the exact same number of fixed points. A permutation σ\sigma is chosen uniformly at random from S5S_5. Let [σ][\sigma] denote the equivalence class containing σ\sigma. What is the expected value of ∣[σ]∣|[\sigma]|, the cardinality of the equivalence class containing σ\sigma?

15

Let SS be the set of all 3×33 \times 3 matrices with real entries. A relation RR on SS is defined by ARB  ⟺  det⁡(A)=det⁡(B)A R B \iff \det(A) = \det(B). Let [M][M] denote the equivalence class of a matrix M∈SM \in S. Consider the matrix P=(123246369)P = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 3 & 6 & 9 \end{pmatrix}. If a matrix A∈[P]A \in [P] satisfies the equation A⋅adj(A)+3A=A2+kIA \cdot \text{adj}(A) + 3A = A^2 + k I for some real number kk, which of the following statements is ALWAYS true?

16

Let S={z∈C:z40=1}S = \{ z \in \mathbb{C} : z^{40} = 1 \} and A={z∈S:∣z2−1∣≤2}A = \{ z \in S : |z^2 - 1| \le \sqrt{2} \}. An equivalence relation RR is defined on AA by z1Rz2  ⟺  z14=z24z_1 R z_2 \iff z_1^4 = z_2^4. If NN is the number of elements in AA, and MM is the number of equivalence classes of RR on AA, find the value of N+MN + M.

17

Let X=[0,2π]X = [0, 2\pi]. A relation RR is defined on XX by xRy  ⟺  f(x)=f(y)x R y \iff f(x) = f(y), where f(x)=cos⁡−1(cos⁡x)−∣sin⁡−1(sin⁡x)+π6∣f(x) = \cos^{-1}(\cos x) - \left| \sin^{-1}(\sin x) + \frac{\pi}{6} \right| Let ExE_x denote the equivalence class of xx under RR. Let SS be the set of all c∈Rc \in \mathbb{R} such that the equation f(x)=cf(x) = c has exactly 22 solutions in XX (i.e., ∣Ex∣=2|E_x| = 2 for any xx with f(x)=cf(x) = c). If SS can be expressed as the union of two disjoint open intervals (a,b)∪(c,d)(a, b) \cup (c, d) with a<b≤c<da < b \le c < d, then the value of a+b+c+da+b+c+d is:

18

Let SS be a multiset containing 12 elements, consisting of 6 identical items of type XX and 6 distinct items Y1,Y2,Y3,Y4,Y5,Y6Y_1, Y_2, Y_3, Y_4, Y_5, Y_6. Find the number of ways to partition the multiset SS into 6 unordered pairs.

19

A curve is defined parametrically by x(t)=t−asin⁡tx(t) = t - a \sin t and y(t)=t−bsin⁡ty(t) = t - b \sin t, where t∈Rt \in \mathbb{R} and a,b∈Ra, b \in \mathbb{R}. The set of all pairs (a,b)(a, b) for which yy can be expressed as a single-valued injective function of xx on the entire real line R\mathbb{R} is:

20

Let S={z∈C:∣z∣=1,z≠1}S = \{ z \in \mathbb{C} : |z| = 1, z \neq 1 \}. A function f:S→Cf: S \to \mathbb{C} is defined as f(z)=zz−1∣z−1∣f(z) = z \frac{z-1}{|z-1|}. Let N(w)N(w) denote the number of distinct solutions z∈Sz \in S to the equation f(z)=wf(z) = w. Which of the following statements is TRUE?

21

The number of real roots of the equation tan⁡−1(2x1−x2)+tan⁡−1(3x−x31−3x2)=π4\tan^{-1}\left(\frac{2x}{1-x^2}\right) + \tan^{-1}\left(\frac{3x-x^3}{1-3x^2}\right) = \frac{\pi}{4} is

22

Let f:R→Rf: \mathbb{R} \to \mathbb{R} be a function defined by f(x)=∫0xt2−at+1(t2+1)2 dtf(x) = \int_0^x \frac{t^2 - at + 1}{(t^2+1)^2} \, dt Which of the following represents the set of all real values of aa for which ff is bijective?

23

Let A=(4−i−2+2i11)A = \begin{pmatrix} 4-i & -2+2i \\ 1 & 1 \end{pmatrix} and II be the 2×22 \times 2 identity matrix. A linear transformation Tx:C2→C2T_x: \mathbb{C}^2 \to \mathbb{C}^2 is defined as Tx(v)=(A−xI)vT_x(\mathbf{v}) = (A - xI)\mathbf{v}, where x∈Rx \in \mathbb{R}. If SS is the set of all real values of xx for which TxT_x is NOT an injective mapping, then SS is equal to:

24

Let f:[0,2π]→[0,2π+4π2]f: \left[0, \frac{2}{\pi}\right] \rightarrow \left[0, \frac{2}{\pi} + \frac{4}{\pi^2}\right] be defined as: f(x)={x+x2sin⁡(1x),x∈(0,2π]0,x=0f(x) = \begin{cases} x + x^2 \sin\left(\frac{1}{x}\right), & x \in \left(0, \frac{2}{\pi}\right] \\ 0, & x = 0 \end{cases} Consider the following statements: I. ff is a surjective function. II. ff is strictly increasing on its domain. III. ff is not differentiable at x=0x=0 because lim⁡x→0+f′(x)\lim_{x \to 0^+} f'(x) does not exist.

Which of the following represents the correct truth values of (I, II, III)?

25

Let Un={z∈C:zn=1}U_n = \{z \in \mathbb{C} : z^n = 1\}. For each integer n≥3n \ge 3, define the mapping fn:Un→Unf_n: U_n \to U_n by fn(z)=z5exp⁡(12(Log(z)+Log(zˉ)))f_n(z) = z^5 \exp\left( \frac{1}{2} (\text{Log}(z) + \text{Log}(\bar{z})) \right) where Log(z)\text{Log}(z) denotes the principal branch of the complex logarithm, with its imaginary part in (−π,π](-\pi, \pi]. Let SS be the set of all integers n∈{10,11,…,20}n \in \{10, 11, \dots, 20\} such that fnf_n is a bijective mapping. Find the sum of the elements of SS.

26

Let f:R→Sf: \mathbb{R} \to S be a surjective, twice-differentiable function satisfying the differential equation e2f(x)(f′(x))2−2xef(x)f′(x)+x2(1−e2x)=0e^{2f(x)} (f'(x))^2 - 2x e^{f(x)} f'(x) + x^2 (1 - e^{2x}) = 0 for all x∈Rx \in \mathbb{R}, with f(0)=0f(0) = 0. Which of the following sets represents SS?

27

Let f:N→Zf: \mathbb{N} \to \mathbb{Z} be defined by f(n)=⌊∑k=1nlog⁡3(1+107k2+108k)⌋f(n) = \left\lfloor \sum_{k=1}^n \log_3 \left( 1 + \frac{107}{k^2 + 108k} \right) \right\rfloor where ⌊x⌋\lfloor x \rfloor denotes the greatest integer less than or equal to xx. Let SS be the range of ff. Which of the following represents the cardinality of SS?

28

Let Mn(R)M_n(\mathbb{R}) be the set of all n×nn \times n real matrices (n≥2n \ge 2). Define a mapping f:Mn(R)→Mn(R)f: M_n(\mathbb{R}) \to M_n(\mathbb{R}) by f(A)=ATAf(A) = A^T A. Let V={A∈Mn(R)∣A2=In}V = \{A \in M_n(\mathbb{R}) \mid A^2 = I_n\} be the set of all involutory matrices, and let W=f(V)W = f(V) be the image of VV under ff. Which of the following statements is ALWAYS true?

29

Let AA be a 3×33 \times 3 skew-symmetric matrix with real entries. Let f(x)=det⁡(A−xI)f(x) = \det(A - xI). If the function g:R→Rg: \mathbb{R} \to \mathbb{R} defined by g(x)=f(x)+245∣x−det⁡(A)∣g(x) = f(x) + 245|x - \det(A)| is bijective, then the minimum possible value of Tr(ATA)\text{Tr}(A^T A) is

30

Consider the function f:[−1,∞)→[−13,∞)f: [-1, \infty) \to \left[-\frac{1}{3}, \infty\right) defined by f(x)=x33+2x2+3x+∑n=1∞x2(1+x2)nf(x) = \frac{x^3}{3} + 2x^2 + 3x + \sum_{n=1}^{\infty} \frac{x^2}{(1+x^2)^n} Which of the following statements is true?

31

Let S={(x,y,z)∈R3:x2+y2+z2=1}S = \{(x, y, z) \in \mathbb{R}^3 : x^2 + y^2 + z^2 = 1\}. A function f:S→Rf: S \to \mathbb{R} is defined such that f(x,y,z)f(x, y, z) is the square of the length of the orthogonal projection of the vector v⃗=xi^+yj^+zk^\vec{v} = x\hat{i} + y\hat{j} + z\hat{k} onto the plane x+y+z=0x+y+z=0. If LL is the total length of the curve(s) forming the pre-image f−1(12)f^{-1}\left(\frac{1}{2}\right), find the value of L2π2\frac{L^2}{\pi^2}.

32

Let f:R→Rf: \mathbb{R} \to \mathbb{R} be defined as f(x)=∣ln⁡(x2−x+1x2+x+1)∣f(x) = \left| \ln \left( \frac{x^2 - x + 1}{x^2 + x + 1} \right) \right|. The set of all real values of kk for which the equation f(x)=kf(x) = k has exactly 44 distinct real solutions is:

33

Let M2(R)M_2(\mathbb{R}) be the vector space of all 2×22 \times 2 real matrices and S={X∈M2(R)∣X=XT}S = \{X \in M_2(\mathbb{R}) \mid X = X^T\} be the subspace of symmetric matrices. For a fixed matrix A∈M2(R)A \in M_2(\mathbb{R}), define linear transformations T1,T2:M2(R)→M2(R)T_1, T_2 : M_2(\mathbb{R}) \to M_2(\mathbb{R}) by T1(X)=AX−XAT_1(X) = AX - XA T2(X)=AX−XATT_2(X) = AX - XA^T Let k1=min⁡A∈M2(R)(dim⁡(ker⁡T1))k_1 = \min_{A \in M_2(\mathbb{R})} (\dim(\ker T_1)) and k2=min⁡A∈M2(R)(dim⁡(ker⁡(T2∣S)))k_2 = \min_{A \in M_2(\mathbb{R})} (\dim(\ker (T_2|_S))), where T2∣ST_2|_S is the restriction of T2T_2 to SS. What is the value of k12+k22k_1^2 + k_2^2?

34

Let A=(2201)A = \begin{pmatrix} 2 & 2 \\ 0 & 1 \end{pmatrix} and B=(1−612)B = \begin{pmatrix} 1 & -6 \\ 1 & 2 \end{pmatrix}. For any 2×22 \times 2 matrix M=(abcd)M = \begin{pmatrix} a & b \\ c & d \end{pmatrix}, define the transformation TM(x)=ax+bcx+dT_M(x) = \frac{ax + b}{cx + d}. Let f(x)=TA(x)f(x) = T_A(x) and g(x)=TB(x)g(x) = T_B(x). Let SS be the set of all real numbers xx satisfying the equation f(g(h(x)))=g(f(h(x)))f(g(h(x))) = g(f(h(x))), where h(x)=∣[x]∣h(x) = \sqrt{|[x]|} and [⋅][ \cdot ] denotes the greatest integer function. Find the value of ∫S(3x2+202x) dx\int_{S} (3x^2 + 202x) \, dx

35

Let f:R→Rf: \mathbb{R} \to \mathbb{R} and g:R→Rg: \mathbb{R} \to \mathbb{R} be defined as: f(x)=x2−x+1x2+x+1f(x) = \frac{x^2 - x + 1}{x^2 + x + 1} g(x)=x3−3x2+3x+2g(x) = x^3 - 3x^2 + 3x + 2 Let A=[α,β]A = [\alpha, \beta] be the range of h(x)=g(f(x))h(x) = g(f(x)) and B=[γ,δ]B = [\gamma, \delta] be the range of k(x)=f(g(x))k(x) = f(g(x)). Let n1n_1 be the number of real roots of the equation h(x)=4h(x) = 4, and n2n_2 be the number of real roots of the equation k(x)=1k(x) = 1. Find the value of 27α+β+3γ+δ+n1+n227\alpha + \beta + 3\gamma + \delta + n_1 + n_2.

36

Let f:(−π2,π2)→Rf: \left(-\frac{\pi}{2}, \frac{\pi}{2}\right) \to \mathbb{R} be defined by f(x)={x2sin⁡x+x2sin⁡(1x)if x≠00if x=0f(x) = \begin{cases} \frac{x^2}{\sin x} + x^2 \sin\left(\frac{1}{x}\right) & \text{if } x \neq 0 \\ 0 & \text{if } x = 0 \end{cases} Let g(x)=2π−xg(x) = \frac{2}{\pi} - x. Consider the composite functions H1(x)=f(g(x))H_1(x) = f(g(x)) and H2(x)=g(f(x))H_2(x) = g(f(x)). Which of the following statements is TRUE regarding the existence of local inverses for H1H_1 and H2H_2 in some neighborhood (−δ,δ)(-\delta, \delta) of x=0x = 0 (where δ>0\delta > 0 is sufficiently small)?

37

Let f(x)=x+1xf(x) = x + \frac{1}{x} and g(x)=exg(x) = e^x. Define the integrals I1=∫1/22f(g(x)) dxI_1 = \int_{1/2}^{2} f(g(x)) \, dx and I2=∫1/22g(f(x)) dxI_2 = \int_{1/2}^{2} g(f(x)) \, dx. Which of the following inequalities is correct?

38

Let α,β\alpha, \beta (where α<β\alpha < \beta) be the roots of the equation x2−7x+12=0x^2 - 7x + 12 = 0. Let f(x)=αx−[αx]f(x) = \alpha x - [\alpha x] and g(x)=x+1βg(x) = x + \frac{1}{\beta}, where [t][t] denotes the greatest integer less than or equal to tt. Two sequences {xn}\{x_n\} and {yn}\{y_n\} are defined as follows: x1=0,xn+1=f(g(xn)) for n≥1x_1 = 0, \quad x_{n+1} = f(g(x_n)) \text{ for } n \ge 1 y1=0,yn+1=g(f(yn)) for n≥1y_1 = 0, \quad y_{n+1} = g(f(y_n)) \text{ for } n \ge 1 Find the value of ∑n=1120(xn+yn)\sum_{n=1}^{120} (x_n + y_n).

39

Let f:R→(0,∞)f: \mathbb{R} \to (0, \infty) be a differentiable function satisfying the differential equation dydx+y=y3(1+3−2x4e2x)\frac{dy}{dx} + y = y^3 \left( 1 + \frac{3-2x}{4}e^{2x} \right) If f(x)f(x) is an injective function on R\mathbb{R}, then the maximum possible value of f(0)f(0) is:

40

Let SS be the set of all sequences (x1,x2,x3)(x_1, x_2, x_3) of positive integers such that x1+x2+x3=92x_1 + x_2 + x_3 = 92. A function f:S→Zf: S \to \mathbb{Z} is defined by f(x1,x2,x3)=x1+2x2+3x3f(x_1, x_2, x_3) = x_1 + 2x_2 + 3x_3. If A⊆SA \subseteq S is the largest possible subset such that the restriction f∣Af|_A is injective, find the cardinality of AA.

41

Let L1L_1 and L2L_2 be two lines in R3\mathbb{R}^3 given by: L1:r⃗=λ(i^+2j^)L_1: \vec{r} = \lambda(\hat{i} + 2\hat{j}) L2:r⃗=(i^−2j^+k^)+μ(2j^+k^)L_2: \vec{r} = (\hat{i} - 2\hat{j} + \hat{k}) + \mu(2\hat{j} + \hat{k}) Let dd be the shortest distance between L1L_1 and L2L_2. Let f:R→Rf: \mathbb{R} \to \mathbb{R} be defined as f(x)=x3−3dx2+3(3d−2)xf(x) = x^3 - 3dx^2 + 3(3d-2)x. Consider the vectors u⃗=xi^+j^+k^\vec{u} = x\hat{i} + \hat{j} + \hat{k}, v⃗=i^+xj^+k^\vec{v} = \hat{i} + x\hat{j} + \hat{k}, and w⃗=i^+j^+xk^\vec{w} = \hat{i} + \hat{j} + x\hat{k}. A function g:R→Rg: \mathbb{R} \to \mathbb{R} is defined as: g(x)={[u⃗ v⃗ w⃗]∣u⃗×v⃗∣2if u⃗ and v⃗ are non-collinearkif u⃗ and v⃗ are collinearg(x) = \begin{cases} \frac{[\vec{u} \ \vec{v} \ \vec{w}]}{|\vec{u} \times \vec{v}|^2} & \text{if } \vec{u} \text{ and } \vec{v} \text{ are non-collinear} \\ k & \text{if } \vec{u} \text{ and } \vec{v} \text{ are collinear} \end{cases} If g(x)g(x) is continuous for all x∈Rx \in \mathbb{R}, which of the following is true?

42

Let M=(010001000)M = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix} and S={aM+bM2∣a,b∈R}S = \{ aM + bM^2 \mid a, b \in \mathbb{R} \}. A binary operation ∗* on SS is defined by A∗B=A+B+cABA * B = A + B + c AB, where cc is a non-zero real constant. For any A∈SA \in S, let A∘n=A∗A∗⋯∗AA^{\circ n} = A * A * \dots * A (nn times). If X∈SX \in S is the inverse of M∘5M^{\circ 5} under the operation ∗*, then XX is equal to:

43

Let S={1,2,3,4,5,6,7,8,9}S = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}. A binary operation ∗* on the power set P(S)\mathcal{P}(S) is defined as A∗B=(A∖B)∪(B∖A)A * B = (A \setminus B) \cup (B \setminus A). Let I\mathcal{I} be the family of all proper subsets of SS that do not contain any two consecutive integers. If C\mathcal{C} is the closure of I\mathcal{I} under the operation ∗*, find the number of elements in the set V={A∈C∖{S}∣A∉I}\mathcal{V} = \{ A \in \mathcal{C} \setminus \{S\} \mid A \notin \mathcal{I} \}.

44

Let a binary operation ∗* be defined on a subset S⊆RS \subseteq \mathbb{R} as a∗b=[sgn(a)cos⁡2(πb2)]a * b = \left[ \text{sgn}(a) \cos^2\left(\frac{\pi b}{2}\right) \right] where [⋅][\cdot] denotes the greatest integer function and sgn(⋅)\text{sgn}(\cdot) denotes the signum function. For which of the following sets SS is ∗* a closed binary operation?

45

Let B={v⃗∈R3:∣v⃗∣≤1}B = \{ \vec{v} \in \mathbb{R}^3 : |\vec{v}| \le 1 \} be the closed unit ball in R3\mathbb{R}^3. A binary operation ⋆\star is defined on BB by u⃗⋆v⃗=λ(u⃗⋅v⃗)(u⃗×v⃗)\vec{u} \star \vec{v} = \lambda (\vec{u} \cdot \vec{v}) (\vec{u} \times \vec{v}) where λ>0\lambda > 0 is a real constant. What is the maximum value of λ\lambda such that BB is closed under the operation ⋆\star?

46

Let SS be the set of all 2×22 \times 2 matrices of the form M(x,y)=(xy01x)M(x, y) = \begin{pmatrix} x & y \\ 0 & \frac{1}{x} \end{pmatrix}, where x∈R∖{0}x \in \mathbb{R} \setminus \{0\} and y∈Ry \in \mathbb{R}. A binary operation ⋆\star is defined on SS by A⋆B=ABA−1A \star B = A B A^{-1} for all A,B∈SA, B \in S. Let LL be the set of all left identities and RR be the set of all right identities for the operation ⋆\star in SS. Which of the following statements is correct?

47

Let S=R∖{(2k+1)π:k∈Z}S = \mathbb{R} \setminus \{ (2k+1)\pi : k \in \mathbb{Z} \}. A binary operation ∗* on SS is defined as x∗y=2tan⁡−1(tan⁡x2+tan⁡y2)x * y = 2 \tan^{-1} \left( \tan \frac{x}{2} + \tan \frac{y}{2} \right) Consider the following three statements: S1S_1: The operation ∗* admits an identity element in SS. S2S_2: The operation ∗* is associative on SS. S3S_3: The function f:S→(−π,π)f: S \to (-\pi, \pi) defined by f(x)=x∗0f(x) = x * 0 is surjective but not injective. Which of the following is correct?

48

Let S=R∖{α}S = \mathbb{R} \setminus \{\alpha\}. A binary operation ∗* is defined on SS by x∗y=xy−λx−λy+λ2+λx * y = x y - \lambda x - \lambda y + \lambda^2 + \lambda where λ=∑n=2∞2n+6n3−n\lambda = \sum_{n=2}^{\infty} \frac{2n+6}{n^3-n}. If the operation ∗* admits a unique identity element in SS, what is the value of α\alpha?

49

Let f(t)=1−∣t−1∣f(t) = \sqrt{1 - |t-1|} and F(x)=∫x2xf(t)dtF(x) = \int_{x}^{2x} f(t) dt. Let MM be the maximum value of F(x)F(x) on its domain. Then the value of 9M9M is:

50

Let a,b∈Ra, b \in \mathbb{R} and k∈Zk \in \mathbb{Z}. Consider the function f(x)=2x3+ax2+bx+(k2−4)sgn(x)f(x) = 2x^3 + a x^2 + b x + (k^2 - 4)\text{sgn}(x) defined on the interval [−2,2][-2, 2]. It is given that Lagrange's Mean Value Theorem is applicable to f(x)f(x) on [−2,2][-2, 2]. Let SS be the set of all points c∈(−2,2)c \in (-2, 2) satisfying the conclusion of the theorem for ff on [−2,2][-2, 2]. If S={c1,c2}S = \{c_1, c_2\} and c1+c2=1c_1 + c_2 = 1, find the maximum possible value of a+ka + k.

Related Chapters

Explore other chapters from the same academic theme.

Ready to Master This Chapter?

Practice 50 carefully selected questions designed to strengthen your concepts, avoid common traps, and build confidence for competitive examinations.

Start Free Practice