Q.An organization conducted a bike race under 2 different categories — boys and girls. In all, there were 250 participants. Among all of them finally three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B={b1,b2,b3}, G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race. Ravi decides to explore these sets for various types of relations and functions. On the basis of the above information, answer the following questions:
(iii)(A) Ravi defines a relation from B to B as R1={(b1,b2),(b2,b1)}. Write the minimum ordered pairs to be added in R1 so that it becomes
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Part (a)Concept understanding — Cartesian Product Cardinality
Cartesian Product Cardinality: From Intuition to Precision
Imagine ordering a meal: 3 types of bread (roti, naan, paratha) and 4 types of curry (dal, paneer, chicken, fish). How many combinations of one bread and one curry can you make? For each bread you can pair any of the 4 curries, giving 3×4=12 meals. This multiplication is the heart of Cartesian product cardinality.
What is a Cartesian Product?
Given two sets A and B, their Cartesian product A×B is the set of all ordered pairs (a,b) where a∈A and b∈B.
A×B={(a,b)∣a∈A,b∈B}
With A={roti,naan,paratha} and B={dal,paneer,chicken,fish}, A×B contains 12 pairs like (roti, dal), (naan, paneer), etc.
The Cardinality Statement
∣A×B∣=∣A∣×∣B∣
The cardinality of the Cartesian product equals the product of the individual set sizes: for each of the ∣A∣ choices from A, you have ∣B∣ choices from B, and multiplication counts all pairings.
This works for finite sets. For infinite sets, cardinal arithmetic gets more nuanced, but the same multiplicative idea extends.
This generalises to n sets:
∣A1×A2×⋯×An∣=∣A1∣×∣A2∣×⋯×∣An∣
A Common Pitfall
Don't confuse Cartesian product with union. The union A∪B counts elements in either set (addition, with overlap correction). The Cartesian product counts pairs — it's fundamentally multiplicative.
For A={1,2} and B={x,y}:
- A∪B={1,2,x,y} has size 4
- A×B={(1,x),(1,y),(2,x),(2,y)} has size 2×2=4 …
Part (b)Concept understanding — One One Onto
One-One Onto (Bijective) Functions
Picture seating students on chairs so that every student gets a chair, every chair is used, no two students share one and none is left empty. A function that manages this perfect pairing between its domain and codomain is one-one onto, or bijective.
One-one (injective)
f is one-one if different inputs always give different outputs — no two students on one chair. Formally, f(x1)=f(x2)⟹x1=x2 (equivalently x1=x2⟹f(x1)=f(x2)).
f(x)=2x on R is one-one, since 2a=2b⇒a=b. But f(x)=x2 is not: f(2)=f(−2)=4 while 2=−2.
Onto (surjective)
f is onto if every element of the codomain is actually hit — no chair left empty. Formally, for every y in the codomain there is some x with f(x)=y. Here f(x)=2x is onto (take x=y/2), whereas f:R→R, f(x)=x2 is not, since negative values are never outputs.
Both together — bijective
A function that is one-one and onto is bijective: a one-to-one correspondence in which the two sets match up exactly.
One-one and onto are independent properties. f(x)=ex (from R to R) is one-one but not onto; f(x)=x3−x is onto but not one-one. You must verify both.
Why it matters
Only a bijection has a genuine inverse function: because each output comes from exactly one input (one-one) and every codomain element is used (onto), the map can be reversed unambiguously. …
(i) Relations from B to G. ∣B×G∣=3×2=6, so number of relations =26=64.
(ii) Smallest equivalence relation on G. The identity {(g1,g1),(g2,g2)}.
Part (a)
(iii)(A). Pairs to add to R1={(b1,b2),(b2,b1)}:
- (a) Reflexive but not symmetric: add (b1,b1),(b2,b2),(b3,b3) and one one-way pair (b1,b3) — 4 pairs. …
(i) 26=64 relations; (ii) smallest equivalence relation is {(g1,g1),(g2,g2)}; (iii)(A) add 4 pairs for "reflexive not symmetric" and 5 pairs for "reflexive & symmetric but not transitive"; (iii)(B) the track y=x2/4 is a bijection (one-one and onto).
Here B={b1,b2,b3} and G={g1,g2}.
(i) Number of relations from B to G. A relation from B to G is any subset of B×G. Since ∣B×G∣=3×2=6, the number of subsets is 26=64.
(ii) Smallest equivalence relation on G. Reflexivity already forces (g1,g1) and (g2,g2); this set is symmetric and transitive with nothing more to add, so the smallest equivalence relation is {(g1,g1),(g2,g2)}.
Part (a)
(iii)(A). Adding pairs to R1={(b1,b2),(b2,b1)}.
(a) Reflexive but not symmetric. Reflexivity needs the three diagonal pairs (b1,b1),(b2,b2),(b3,b3). To break symmetry add a single one-way pair whose reverse is absent, e.g. (b1,b3) (without (b3,b1)). Minimum =4 pairs. …
Method: Counting relations and building minimal relations with prescribed properties
This case-study bundles several distinct techniques; recognise which sub-tool each part needs.
Steps
Step 1: Count all relations from A to B
A relation is any subset of A×B, so the number of relations is
2∣A×B∣=2∣A∣⋅∣B∣.
Step 2: Smallest equivalence relation on a set
Reflexivity forces every diagonal pair (a,a); the diagonal alone is already symmetric and transitive, so the smallest equivalence relation is exactly the identity relation.
Step 3: Add the minimum pairs to force a property combination …
Common Mistakes
Mistake 1: Writing the number of relations as ∣A∣⋅∣B∣ instead of 2∣A∣⋅∣B∣
Why it's wrong: ∣A×B∣=6 is the number of pairs; the number of subsets (relations) is 26=64. Correct approach: count subsets of A×B, not elements.
Mistake 2: Over-filling the "reflexive but not symmetric" set
Why it's wrong: adding both (b1,b3) and (b3,b1) makes it symmetric again, defeating the requirement. Correct approach: add exactly one one-way pair whose reverse is absent. …
Showing the 12 most recent of 14 on this concept.
- AP EAPCET 2026Set eng-2026-05-14-AN1 markMCQQ.The function f:[0,∞)→[0,∞) defined by f(x)=1+xx is (A) one - one and onto (B) one - one but not onto (C) onto but not one - one (D) neither one-one nor onto
›Reveal solutionSolution
The function f(x)=1+xx is strictly increasing (hence one‑one) but never reaches the value 1, so it is not onto. The correct option is (B).
We are asked to decide whether f:[0,∞)→[0,∞) given by f(x)=1+xx is one‑one (injective), onto (surjective), both, or neither.
1. Intuition: What does the function look like?
For x≥0, the denominator 1+x is always larger than the numerator x, so every output is less than 1. As x grows very large, f(x) gets closer and closer to 1 but never reaches it. At x=0, f(0)=0. So the range is [0,1), not the whole codomain [0,∞). That already suggests “not onto.”
Also, the function is increasing: if you increase x, the fraction increases. That suggests “one‑one.”
Let’s verify both properties rigorously.
2. Checking one‑one (injectivity)
A function is one‑one if different inputs give different outputs. Equivalently: if f(a)=f(b) then a=b.
Assume
1+aa=1+bb.
Cross‑multiply:
a(1+b)=b(1+a)⇒a+ab=b+ab.
Cancel ab from both sides:
a=b.
So indeed f(a)=f(b) forces a=b. Hence f is one‑one.
TipA faster way: compute the derivative for x>0:
f′(x)=(1+x)21>0.
A strictly positive derivative on an interval means the function is strictly increasing, which guarantees injectivity.
3. Checking onto (surjectivity)
A function is onto if every element of the codomain [0,∞) is actually attained as an output.
We already suspect the range is only [0,1). Let’s prove it.
For any x≥0:
f(x)=1+xx=1−1+x1.
Since 1+x≥1, we have 1+x1∈(0,1], so …
- AP EAPCET 2026Set eng-2026-05-15-FN1 markMCQQ.If a real valued function f:(1,2]→B defined by f(x)=log10(x−1) is a bijection, then B= (A) [0,∞) (B) R (C) (−∞,0] (D) (0,∞)
›Reveal solutionSolution
A bijection requires the function to be both one‑to‑one and onto; here f(x)=log10(x−1) on (1,2] is strictly increasing and its range is (−∞,0], so B must be (−∞,0].
Concept and intuition (One‑One Onto)
A bijection means every element of the domain maps to a distinct element of the codomain (one‑to‑one) and every element of the codomain is actually hit by some input (onto). For a strictly monotonic function on an interval, one‑to‑one is automatic. The real work is finding the range of f on the given domain — that range must be exactly the set B for the function to be onto. Here f(x)=log10(x−1) is defined only for x>1, and the domain (1,2] is a half‑open interval. We’ll compute the outputs at the endpoints and see how the function behaves between them.
-
Understand the domain and function
Domain: (1,2], meaning 1<x≤2.
The argument of the log is x−1, so as x approaches 1 from the right, x−1→0+. As x increases to 2, x−1 increases to 1.
-
Find the range by evaluating endpoints
- At x=2: f(2)=log10(2−1)=log10(1)=0.
- As x→1+: x−1→0+, and log10(t)→−∞ when t→0+. So f(x)→−∞.
-
Monotonicity and continuity
The function g(t)=log10t is strictly increasing for t>0, and t=x−1 is also strictly increasing in x. Hence f is strictly increasing on (1,2].
Since f is continuous on (1,2] (the log is continuous on its domain), it takes every value between its infimum (−∞) and its maximum (0). Because the domain is open at 1, the value −∞ is never actually attained, but every finite real number less than or equal to 0 is attained exactly once.
-
Conclude the range …
-
- AP EAPCET 2026Set eng-2026-05-18-AN1 markMCQQ.If f:A→B, g:B→C are two functions such that g∘f:A→C is an onto function, then it is necessary that (A) f is onto function (B) g is onto function (C) Both f and g are onto functions (D) f is one-one and g is onto
›Reveal solutionSolution
If the composition g∘f is onto, then g must be onto (surjective), but f need not be onto or one‑one. The correct choice is (B).
Why this approach works
The key is to think about what “onto” (surjective) means for a composition.
If g∘f hits every element of C, then every c∈C has some a∈A with g(f(a))=c. That c is reached by g from the element f(a)∈B, so g itself must be able to reach every c — that is, g is onto.
But f might not be onto: it could miss some parts of B, as long as the part it does hit is enough for g to cover all of C.
Also, f need not be one‑one; multiple a’s could map to the same b, and that doesn’t break surjectivity of the composition.
Step‑by‑step reasoning
-
Recall the definition of onto (surjective)
A function h:X→Y is onto if for every y∈Y, there exists some x∈X such that h(x)=y.
-
Apply this to g∘f
Since g∘f:A→C is onto, for every c∈C there exists some a∈A with
(g∘f)(a)=g(f(a))=c.
-
What does this tell us about g?
Let b=f(a)∈B. Then g(b)=c.
So for every c∈C, we have found a b∈B (namely b=f(a)) such that g(b)=c.
That is exactly the definition of g being onto.
Hence g must be onto.
-
What about f?
Could f fail to be onto? Yes.
Example: Let A={1}, B={x,y}, C={z}.
Define f(1)=x, and g(x)=z, g(y)=z.
Then g∘f(1)=z, so g∘f is onto C, but f is not onto B (it never hits y).
So f need not be onto.
-
Could f be one‑one?
Not necessary.
Example: Let A={1,2}, B={b}, C={c}.
Define f(1)=b, f(2)=b (not one‑one), and g(b)=c. …
-
- AP EAPCET 2025Set eng-2025-05-21-AN1 markMCQQ.If a function f:Z→Z is defined by f(x)=x−(−1)x, then f(x) is (A) one-one, but not onto (B) onto, but not one-one (C) both one-one and onto (D) neither one-one nor onto
›Reveal solutionSolution
Splitting f(x)=x−(−1)x by parity of x shows even inputs map bijectively onto all odd integers and odd inputs map bijectively onto all even integers — together this is a bijection of Z onto itself.
Concept and Intuition
(−1)x depends only on the parity of x: it's +1 for even x and −1 for odd x. So f behaves like two separate linear functions glued together by parity, and checking one-one/onto means checking both the "same output can't come from two different parities" question and the "does every integer get hit" question.
Step-by-Step Solution
- For x=2k (even): f(2k)=2k−(−1)2k=2k−1.
- For x=2k+1 (odd): f(2k+1)=2k+1−(−1)2k+1=2k+1−(−1)=2k+2.
- As k ranges over all integers, 2k−1 takes every odd integer exactly once (injective in k), and 2k+2 takes every even integer exactly once (injective in k).
- Odd-image and even-image sets are disjoint, and their union is all of Z — so every integer in the codomain is hit exactly once. …
- AP EAPCET 2024Set eng-2024-05-18-FN1 markMCQQ.If a function f:R→R is defined by f(x)=x3−x, then f is (A) one – one and onto (B) one – one but not onto (C) onto but not one – one (D) neither one – one nor onto
›Reveal solutionSolution
This tests checking one-one (injectivity) and onto (surjectivity) for the cubic function f(x)=x3−x on R; it fails to be one-one (multiple roots share the same output) but, being a continuous unbounded cubic, it is onto.
Concept and Intuition
A function f:R→R is one-one (injective) if distinct inputs always give distinct outputs, and onto (surjective) if every real number in the codomain is actually achieved by some input. For a cubic polynomial like x3−x, the derivative test tells us whether the function is monotonic (which would guarantee one-one), while the end behaviour (as x→±∞) combined with continuity guarantees onto for any odd-degree polynomial.
Step-by-Step Solution
- Check one-one directly. Factor: f(x)=x3−x=x(x−1)(x+1). So f(0)=0, f(1)=0, and f(−1)=0 — three distinct values of x all map to the same output 0. This single counterexample is enough to conclude f is not one-one.
- Alternatively, check via calculus: f′(x)=3x2−1, which is zero at x=±31 and changes sign there — so f increases, then decreases, then increases again, confirming it is not monotonic and therefore not injective. …
- AP EAPCET 2024Set eng-2024-05-21-AN1 markMCQQ.The real valued function f:R→[25,∞) defined by f(x)=∣2x+1∣+∣x−2∣ is (A) One-one function but not onto (B) Onto function but not one-one (C) Bijection (D) Neither one-one function nor onto
›Reveal solutionSolution
This piecewise-linear V-shaped-with-a-kink function has minimum value 5/2 (matching the stated codomain) and covers all values from 5/2 to ∞, so it's onto — but the decreasing branch and the increasing branch overlap in output values, so it's not one-one.
Concept and Intuition
A sum of absolute values ∣2x+1∣+∣x−2∣ is piecewise linear, changing slope at the "kink" points where each absolute-value expression changes sign (x=−1/2 and x=2). Between consecutive kinks the function is linear; outside the kinks it becomes steeper (sum of both slopes). Onto-ness is checked by comparing the range of f to the stated codomain; one-one-ness is checked for any repeated output value.
Step-by-Step Solution
- Break into three pieces based on the sign changes at x=−1/2 (where 2x+1=0) and x=2 (where x−2=0):
- x<−1/2: both expressions negative inside: f(x)=−(2x+1)−(x−2)=−3x+1.
- −1/2≤x≤2: 2x+1≥0, x−2≤0: f(x)=(2x+1)−(x−2)=x+3.
- x>2: both non-negative: f(x)=(2x+1)+(x−2)=3x−1.
- Evaluate at kinks: f(−1/2)=−1/2+3=5/2; f(2)=2+3=5.
- Behaviour: on (−∞,−1/2), f decreases from +∞ down to 5/2 (slope −3). On [−1/2,2], f increases from 5/2 to 5 (slope +1). On (2,∞), f increases from 5 to +∞ (slope +3). …
- Break into three pieces based on the sign changes at x=−1/2 (where 2x+1=0) and x=2 (where x−2=0):
- AP EAPCET 2023Set eng-2023-05-15-AN1 markMCQQ.If a real valued function f is defined by f(x)=bxax+a2−x2, then f is (A) only one-one (B) only onto (C) both one-one and onto (D) neither one-one nor onto
›Reveal solutionSolution
f(x)=bxax+a2−x2 has a bounded domain [−a,a]−{0}. Checking
the endpoints shows f(a)=f(−a) (not one-one), while the function's range across
the two branches covers all of R (onto).
Concept and Intuition
Whenever a2−x2 appears, the domain is forced to be the bounded interval
[−a,a] (need a2−x2≥0). Here we additionally need x=0 (division by bx).
So f lives only on [−a,a]−{0} — a small, symmetric, bounded set. On such a
restricted domain, checking one-one/onto is best done by direct evaluation at a few
strategic points (especially the endpoints, where a2−x2=0 and the formula
collapses) rather than trying to argue in the abstract.
Step-by-Step Solution
- Take representative values a=1, b=1 (the qualitative behaviour — bounded domain, symmetric endpoints — is the same for any nonzero a,b): domain is [−1,1]−{0}, f(x)=xx+1−x2=1+x1−x2.
- Evaluate at the endpoints, where 1−x2=0:
f(1)=1+0=1,f(−1)=1+0=1.
Two distinct domain points, x=1 and x=−1, both map to the same value 1
⇒ f is not one-one.
3. Check the range on (0,1): as x→0+, 1−x2/x→+∞, so
f→+∞; at x=1, f=1. Since f is continuous and monotonic on this
branch, it sweeps out (1,∞).
4. Check the range on (−1,0): as x→0−, 1−x2/x→−∞, so
f→−∞; at x=−1, f=1. This branch sweeps out (−∞,1).
5. Combining both branches and the shared endpoint value 1: the total range is …
- AP EAPCET 2022Set eng-2022-07-06-FN1 markMCQQ.Let f: R→R defined by f(x) = 5x^4+2. Then (A) f is one-one but not onto (B) f is onto but not one-one (C) f is both one-one and onto (D) f is neither one-one nor onto
›Reveal solutionSolution
f(x)=5x4+2 fails to be one-one because even powers make f(x)=f(−x), and it fails to be onto because x4≥0 restricts the range to [2,∞), missing most of R.
Concept and Intuition
A function is one-one (injective) if distinct inputs always give distinct outputs, and onto (surjective) if every element of the codomain is actually achieved by some input. Even-degree power functions like x4 are inherently "two-to-one" away from zero, since (−x)4=x4 — this immediately breaks injectivity for any function built purely from an even power (plus a constant/linear combination that doesn't fix this symmetry). Also, because x4 can never be negative, adding a positive constant just shifts the range upward, but the range is still bounded below — it can never cover the whole real line, so it cannot be onto R.
Step-by-Step Solution
- Check one-one: pick x=1 and x=−1. f(1)=5(1)4+2=7 and f(−1)=5(−1)4+2=5(1)+2=7. Since f(1)=f(−1) but 1=−1, f is not one-one.
- Check onto: for any real x, x4≥0, so f(x)=5x4+2≥2. This means f's range is [2,∞), a proper subset of the codomain R (e.g. f(x)=0 has no real solution). So f is not onto. …
- AP EAPCET 2022Set eng-2022-07-07-AN1 markMCQQ.If f is a relation from set of positive real numbers to the set of positive real numbers defined by f(x)=3x2−2 then f is (A) one-one but not onto (B) onto but not one-one (C) a bijection (D) not a function
›Reveal solutionSolution
For f(x)=3x2−2 to be a function R+→R+, every output for a positive-real input must itself be a positive real — but this fails for small x, so the relation is not a valid function on the stated codomain.
Concept and Intuition
A relation qualifies as a function from a set A to a set B only if every element of A maps to an element that actually lies in B (as well as each input having a unique output). Here A=B=R+ (positive reals). The rule is f(x)=3x2−2.
Check whether f(x)∈R+ for every x∈R+:
f(x)>0⟺3x2>2⟺x>2/3≈0.816
So for any x in (0,2/3) — which is a perfectly valid part of the domain R+ — the output f(x) is negative, i.e. it does not belong to the codomain R+. Since the rule fails to land every domain element inside the stated codomain, it does not define a valid function from R+ to R+ at all — the question about one-one/onto doesn't even arise until the codomain condition is satisfied.
Step-by-Step Solution
- Domain and codomain are both stated as R+ (strictly positive reals).
- Test a small positive x, e.g. x=0.5: f(0.5)=3(0.25)−2=0.75−2=−1.25, which is negative. …
- AP EAPCET 2022Set eng-2022-07-08-AN1 markMCQQ.If the function f : R → R is defined by f(x) = x|x|, then (A) f is one-one but not onto (B) f is onto but not one-one (C) f is both one-one and onto (D) f is neither one-one nor onto
›Reveal solutionSolution
This tests recognizing f(x)=x∣x∣ as a strictly monotonic, unbounded, continuous function — hence a bijection on R.
Concept and Intuition
The absolute value splits the domain, but here it does so in a way that keeps the function moving in the same direction throughout — that's the key insight, not the piecewise formula itself.
Step-by-Step Solution
- Write f(x)=x2 for x≥0 and f(x)=−x2 for x<0.
- On x≥0, f is increasing (it's x2 restricted to non-negative x). On x<0, f(x)=−x2 is also increasing as x increases (e.g. f(−2)=−4, f(−1)=−1, increasing toward 0).
- At the junction x=0, both pieces give f(0)=0, so the function is continuous and strictly increasing across all of R.
- A strictly monotonic function is automatically one-one (injective). …
- AP EAPCET 2022Set eng-2022-07-08-FN1 markMCQQ.If f: R→R is defined as f(x) = x^2-2x-3 then f is (A) one-one but not onto (B) onto but not one-one (C) neither one-one nor onto (D) a bijection
›Reveal solutionSolution
f(x)=x2−2x−3 is a parabola with vertex at (1,−4); it fails injectivity (symmetric pairs give equal outputs) and fails surjectivity onto R (its range is bounded below at −4), so it is neither one-one nor onto.
Concept and Intuition
A quadratic function f:R→R can never be one-one over all of R, because a parabola is symmetric about its vertex — for any value above the minimum, there are always two distinct x-values (symmetric about the vertex) giving the same y-value. Also, since the parabola opens upward, its range is bounded below by the vertex's y-value and never reaches values below that, so it cannot be onto R either.
Step-by-Step Solution
- Complete the square: f(x)=x2−2x−3=(x2−2x+1)−4=(x−1)2−4.
- This is an upward parabola with vertex at (1,−4); its minimum value is −4, so the range of f is [−4,∞).
- Since the range [−4,∞)=R (codomain), f is NOT onto. …
- AP EAPCET 2021Set eng-2021-08-23-AN1 markMCQQ.Define f:R→R by f(x)=max{x+1,1−x,2}. Then f is ____ (A) One – one but not onto (B) Onto but not one – one (C) Neither one – one nor onto (D) Both one – one and onto
›Reveal solutionSolution
Piecewise analysis shows f is constant (=2) on [−1,1] (so not injective) and its range is only [2,∞), never covering all of R (so not surjective onto R). Hence neither one-one nor onto.
Concept and Intuition
f(x)=max{x+1, 1−x, 2} picks, at each x, the largest of three lines/constant. To understand its shape, find where each pair of expressions crosses, since the max switches from one expression to another exactly at those crossing points.
Step-by-Step Solution
- x+1 vs 1−x: equal when x+1=1−x⇒x=0; for x>0, x+1>1−x.
- x+1 vs 2: equal when x=1; for x>1, x+1>2.
- 1−x vs 2: equal when x=−1; for x<−1, 1−x>2.
- Combine: for x≤−1: 1−x≥2 and 1−x≥x+1 (since x≤0), so f(x)=1−x. For −1≤x≤1: check e.g. x=0: values are 1,1,2, so f=2; in fact throughout this interval both x+1≤2 and 1−x≤2, so f(x)=2 (constant). For x≥1: x+1≥2 and x+1≥1−x (since x≥0), so f(x)=x+1.
- So f(x)=⎩⎨⎧1−x,2,x+1,x≤−1−1≤x≤1x≥1, and f(x)≥2 everywhere.
- Not one-one: infinitely many x in [−1,1] all map to the same value 2. …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.