Whenever dealing with dual inverse trig terms, strictly isolate the bounding intervals [-1, 1]$[-1, 1]$ for each argument separately and use a number line intersection to find the strictest common region.
Chapter Mix
Class 12 Maths: Functions
Class 11 Maths: Linear Inequalities
Let f$f$ be a function such that 3f(x) + 2f((m)/(19x)) = 5x$3f(x) + 2f\left(\frac{m}{19x}\right) = 5x$, x ≠ 0$x \neq 0$, where m = Σi=1⁹ (i)²$m = \sum_{i=1}^{9} (i)^2$. Then f(5) - f(2)$f(5) - f(2)$ is equal to
A.-9$-9$
B.36$36$
C.18$18$
D.9$9$
Solution
Related Formula
Sum of squares: Σi=1ⁿ i² = (n(n+1)(2n+1))/(6)$$\text{Sum of squares: } \sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}$$
Functional equations of the form af(x) + bf((k)/(x)) = g(x)$af(x) + bf\left(\frac{k}{x}\right) = g(x)$ strictly require the classic substitution x → (k)/(x)$x \to \frac{k}{x}$ to create a straightforward 2 × 2$2 \times 2$ algebraic system of equations.
Chapter Mix
Class 11 Maths: Functions
Class 11 Maths: Sequences and Series
Choosing the positive sign gives (-8 - 64)/(24) = -3$\frac{-8 - 64}{24} = -3$, so we take the positive sign branch (where the inner term was 3x-16$3x-16$, wait, +4(3x-16)$+4(3x-16)$ with x=0$x=0$ is -64$-64$. So +$+$ sign works).
Composite equations resolving to quadratics in f(x)$f(x)$ typically require boundary conditions (like f(0)=-3$f(0)=-3$) to eliminate the ±$\pm$ ambiguity from the quadratic formula.
Chapter Mix
Class 11 Mathematics: Functions
Class 11 Mathematics: Quadratic Equations
Q8jee_main_2026_28_january_eveningOne-One and Many-One Functions
Given below are two statements:
Statement I: The function f: R arrow R$f: R \rightarrow R$ defined by f(x) = (x)/(1 + |x|)$f(x) = \frac{x}{1 + |x|}$ is one-one.
Statement II: The function f: R arrow R$f: R \rightarrow R$ defined by f(x) = x² + 4x - 30x² - 8x + 18$f(x) = \frac{x^{2} + 4x - 30}{x^{2} - 8x + 18}$ is many-one.
In the light of the above statements, choose the correct answer from the options given below :
f(x) = cases (x)/(1+x) & x ≥ 0 (x)/(1-x) & x < 0 cases$$f(x) = \begin{cases} \frac{x}{1+x} & x \geq 0 \\ \frac{x}{1-x} & x < 0 \end{cases}$$
The derivative f'(x) = (1)/((1+|x|)²) > 0$f'(x) = \frac{1}{(1+|x|)^2} > 0$ for all x$x$. Since it is strictly increasing, f(x)$f(x)$ is one-one. Statement I is true.
x = 0$x = 0$ or x = (7)/(2)$x = \frac{7}{2}$ (Note: the PDF says on solving x=0, -1$x=0, -1$, but algebraic check shows x=0, 7/2$x=0, 7/2$. Regardless, it maps to multiple points).
Since f(0) = f(7/2) = -(5)/(3)$f(0) = f(7/2) = -\frac{5}{3}$, the function maps distinct inputs to the same output. It is many-one. Statement II is true.
Step 1: Final Conclusion
Both Statement I and Statement II are true.
Pattern Recognition
Checking x=0$x=0$ in a rational function y = P(x)/Q(x)$y = P(x)/Q(x)$ provides a quick horizontal line test benchmark. Equating the function to f(0)$f(0)$ immediately reveals if it's many-one without computing full derivatives.
Chapter Mix
Class 12 Maths: Relations and Functions
Q15jee_main_2026_28_january_eveningSignum Function Properties
The sum of all the elements in the range of f(x) = Sgn( x) + Sgn( x) + Sgn( x) + Sgn( x), x ≠ (nπ)/(2), n in Z$f(x) = \text{Sgn}(\sin x) + \text{Sgn}(\cos x) + \text{Sgn}(\tan x) + \text{Sgn}(\cot x), x \neq \frac{n\pi}{2}, n \in \mathbf{Z}$, where Sgn(t) = cases 1, & if t > 0 -1 & if t < 0 cases$\text{Sgn}(t) = \begin{cases} 1, & \text{if} \quad t > 0 \\ -1 & \text{if} \quad t < 0 \end{cases}$, is
A.4$4$
B.2$2$
C.-2$-2$
D.0$0$
Solution
Core Logic
Analyze the signs of trigonometric functions in each quadrant:
Quadrant I: x in (0, π/2)$x \in (0, \pi/2)$. , , ,$\sin, \cos, \tan, \cot$ are all positive.
y = 1 + 1 + 1 + 1 = 4$y = 1 + 1 + 1 + 1 = 4$
When applying signum to all four base trigonometric identities, simply count the number of positive mappings per quadrant (all positive = 4, sine only = -2, tan/cot only = 0, cos only = -2).
Chapter Mix
Class 11 Maths: Trigonometric Functions
Class 12 Maths: Relations and Functions
Q54jee_main_2025_02_april_eveningRelations
Let A = 1, 2, 3, , 100$\mathrm{A} = \{1, 2, 3, \dots, 100\}$ and R$\mathrm{R}$ be a relation on A$\mathrm{A}$ such that R = (a, b) : a = 2b + 1$\mathrm{R} = \{(a, b) : a = 2b + 1\}$. Let (a₁, a₂), (a₂, a₃), (a₃, a₄), , (ak, ak+1)$(a_1, a_2), (a_2, a_3), (a_3, a_4), \dots, (a_k, a_{k+1})$ be a sequence of k$k$ elements of R$\mathrm{R}$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k$k$, for which such a sequence exists, is equal to:
To find the longest sequence of connected pairs, we trace the relation backward starting from the smallest elements in A$A$.
Step 1: Trace the relations backward
To maximize k$k$, we want the chain of elements to go down as low as possible. Let the final element in the chain be ak+1 in A$a_{k+1} \in \mathrm{A}$.
Since ak = 2 ak+1 + 1$a_k = 2 a_{k+1} + 1$:
If ak+1 = 1 ak = 3$a_{k+1} = 1 \implies a_k = 3$
If ak+1 = 2 ak = 5$a_{k+1} = 2 \implies a_k = 5$
Let's test the chain starting with ak+1 = 1$a_{k+1} = 1$:
So the maximum number of pairs in the sequence is k = 5$k = 5$.
Step 2: Check alternative chains
If we start with ak+1 = 2$a_{k+1} = 2$:
ak+1 = 2$a_{k+1} = 2$
ak = 5$a_k = 5$
ak-1 = 11$a_{k-1} = 11$
ak-2 = 23$a_{k-2} = 23$
ak-3 = 47$a_{k-3} = 47$
ak-4 = 95$a_{k-4} = 95$
ak-5 = 191 > 100$a_{k-5} = 191 > 100$
Again, the maximum number of pairs is k = 5$k = 5$. Thus, the largest integer k$k$ is 5.
Pattern Recognition
Recursive scaling: Tracing exponential chains of the form xₙ₊₁ = c xₙ + d$x_{n+1} = c x_n + d$ shows that the elements grow very quickly. Calculating the limits of growth determines the maximum possible depth of the sequence.
Chapter Mix
Class 11 Mathematics: Relations and Functions
More Functions Questions — jee_main_2026_21_jan_morning
Practice past-year questions one chapter at a time. Pick an exam → subject → chapter and get every PYQ for that topic — pulled together from all past papers — with the chapter's key formulas alongside.