Q.Prove that the Greatest Integer Function f:R→R, given by f(x)=[x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
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.
f:A→B is bijective ⟺ there is f−1:B→A with f−1(f(x))=x for all x∈A and f(f−1(y))=y for all y∈B.
| Property | Meaning |
|---|---|
| One-one | f(x1)=f(x2)⇒x1=x2 |
| Onto | ∀y∈B, ∃x∈A: f(x)=y |
| Bijective | both hold — a perfect pairing |
One-one onto (bijective) functions are a core topic of the CBSE Class 12 Relations and Functions chapter, since only a bijection guarantees the existence of a genuine inverse function — a result tested through "prove function is one-one onto" style board exam questions. This concept is equally important for JEE Main, where checking injectivity and surjectivity together is a common problem-solving step.
One-one and onto. To disprove one-one, exhibit two distinct inputs with the same output; to disprove onto, exhibit a codomain value that is never an output. We apply both tests to f(x)=[x].
Step 1 (not one-one): Take x1=1.2 and x2=1.5. Then f(1.2)=[1.2]=1 and f(1.5)=[1.5]=1. Two different inputs give the same output, so f is not injective. (In general, every x∈[n,n+1) maps to the same integer n.)
Step 2 (not onto): For every x, [x] is an integer, so the range is Z. Pick a non-integer such as 0.5∈R: no real x satisfies [x]=0.5. So 0.5 has no preimage and f is not surjective.
The greatest integer function f(x)=[x] is neither one-one nor onto — many inputs share the same integer output, and no non-integer (e.g. 0.5) is ever attained.
The greatest integer function f(x)=[x] is not one-one because many real numbers map to the same integer (e.g., 1.2 and 1.9 both give 1), and not onto because non-integer real numbers (like 0.5) have no preimage — the range is only Z, not R.
Why this approach works
To prove a function is not one-one, we just need to find two different inputs that give the same output. For [x], any two numbers in the same integer interval [n,n+1) map to the same n — so that's immediate.
To prove it's not onto, we need to show there's some real number that never appears as f(x). Since [x] always spits out an integer, any non-integer (like 0.5) can never be the output. That's the whole idea.
Step-by-step proof
1. Not one-one
Take any integer n. For any x in the interval [n,n+1), the definition says [x]=n. So pick two distinct numbers in that interval, say:
x1=n+0.2,x2=n+0.7
Both are in [n,n+1), so:
f(x1)=[n+0.2]=n,f(x2)=[n+0.7]=n
Thus x1=x2 but f(x1)=f(x2). Hence f is not injective.
A common mistake is to think "it's not one-one because it's constant on intervals" — that's exactly right, but you must explicitly pick two different x values and show they give the same f(x). Just saying "it's constant" isn't enough for a formal proof.
2. Not onto
The codomain is R (all real numbers). But what values does f actually take? For any x∈R, [x] is always an integer. So:
Range(f)=Z⊂R
Pick any non-integer real number, say y=0.5. Is there any x such that [x]=0.5? No — because [x] is always an integer. So 0.5 has no preimage.
You don't need to check every non-integer — just one counterexample is enough to disprove onto-ness. y=0.5 works perfectly, but y=π or y=−1.3 would also do.
Thus f is not surjective.
The greatest integer function f(x)=[x] is neither one-one nor onto — it fails injectivity because all numbers in [n,n+1) map to the same n, and it fails surjectivity because no non-integer real number is ever an output.
Method: Proving a function is neither one-one nor onto
To DISPROVE a property you need only one counterexample — far quicker than a general proof.
Steps
Step 1: Disprove one-one with two distinct inputs sharing an output
Find explicit x1=x2 with f(x1)=f(x2). For a step function like [x], any two numbers in the same interval [n,n+1) work, e.g. [1.2]=[1.5]=1.
Step 2: Disprove onto by exhibiting an unreached codomain value
Identify the actual range of f and pick one codomain element outside it. Since [x] only outputs integers, any non-integer such as 0.5 has no preimage.
Step 3: State both counterexamples explicitly — "constant on intervals" or "the range is small" is not a proof on its own; name the specific values that break each property.
Common Mistakes
Mistake 1: Saying "not one-one because it is constant on intervals" without a concrete counterexample.
Why it's wrong: a formal disproof needs two explicit distinct inputs with equal output. Correct approach: state e.g. [1.2]=[1.5]=1 while 1.2=1.5.
Mistake 2: Thinking the range of [x] is all of R.
Why it's wrong: [x] only outputs integers, so its range is Z, and non-integers like 0.5 have no preimage. Correct approach: compare range Z with codomain R to see it is not onto.
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
f(x)=1−1+x1∈[0,1).
The value 1 is never reached because that would require 1+x1=0, impossible for finite x.
Also, any number y≥1 is never an output. For example, take y=2. Is there an x such that 1+xx=2? That would give x=2+2x → −x=2 → x=−2, not in the domain.
Thus the range is [0,1), a proper subset of [0,∞). So f is not onto.
Watch outA common mistake: seeing that f(x) can be made arbitrarily close to 1 and thinking that means 1 is attained. It is not — “approaches” is not “equals.” Onto requires actual equality, not just a limit.
4. Conclusion
The function is one‑one but not onto.
✓Final answerThe correct option is (B).
ANSWER: B
- 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
The outputs cover all real numbers from −∞ up to and including 0. That is the interval (−∞,0].
-
Match to the options
For f to be onto B, we need B=(−∞,0]. This corresponds to option (C).
Watch outA common mistake is to think log10(x−1) can produce positive values when x>2, but here x is capped at 2, so x−1≤1 and the log is ≤0. Also note that 0 is included because x=2 is in the domain.
TipFor any strictly monotonic continuous function on an interval, the range is exactly the interval between the limits at the endpoints (including or excluding endpoints as the domain does). This saves you from plotting or testing random points.
✓Final answerThe correct option is (C).
ANSWER: C
-
- 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.
Then g∘f maps both 1 and 2 to c, so it is onto C.
So f need not be one‑one either.
-
Check the options
- (A) f is onto — false, as shown.
- (B) g is onto — true, proven.
- (C) Both f and g are onto — false because f need not be.
- (D) f is one‑one and g is onto — false because f need not be one‑one.
Watch outA common mistake is to think that if the composition is onto, then both functions must be onto. But f only needs to map into the part of B that g uses to cover C; f can leave other parts of B untouched.
TipTo remember: “onto” for a composition forces the second function (g) to be onto, but the first (f) can be anything as long as its image is a “sufficiently large” subset of B.
✓Final answerThe correct option is (B).
ANSWER: B
-
- 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.
- Injectivity: if f(a)=f(b) with a,b both even (or both odd), the linear formula forces a=b; if one is even and the other odd, their images have different parity (one odd, one even) so they can never coincide.
- Hence f is both injective (one-one) and surjective (onto) — a bijection.
Common Mistakes
- Testing only a few small values and concluding "not one-one" from an apparent coincidence without checking the parity split rigorously.
- Forgetting that codomain is Z (all integers), and mistakenly restricting to non-negative integers when checking onto-ness.
✓Final answerThe correct option is (C) — both one-one and onto.
ANSWER: C
- 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.
- Check onto. f is a polynomial, hence continuous everywhere on R. As x→+∞, f(x)=x3−x→+∞; as x→−∞, f(x)→−∞. By the Intermediate Value Theorem, a continuous function that takes arbitrarily large positive and arbitrarily large negative values must take every real value in between at some point.
- Therefore f is onto (its range is all of R) but not one-one.
Common Mistakes
- Assuming a cubic is automatically one-one because 'odd functions/odd degree polynomials are increasing' — this is only true if the derivative never changes sign; here f′(x)=3x2−1 does change sign, so it is not monotonic.
- Confusing 'onto' with 'one-one' — every odd-degree real polynomial is onto R regardless of whether it's monotonic, but that says nothing about injectivity.
✓Final answerThe correct option is (C) — onto but not one – one.
ANSWER: C
- 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).
- Minimum value overall is 5/2, attained uniquely at x=−1/2. Since the function ranges continuously from 5/2 up to ∞ (via either the decreasing branch alone, or via the two increasing branches), every value in [5/2,∞) is hit — the function is onto its stated codomain.
- Check one-one: take a value like f=3. On the decreasing branch: −3x+1=3⇒x=−2/3 (valid, since −2/3<−1/2). On the increasing branch: x+3=3⇒x=0 (valid, since 0∈[−1/2,2]). Two different x values (−2/3 and 0) give the same f-value 3 — so f is not one-one.
Common Mistakes
- Assuming a function that attains its minimum equal to the codomain's lower bound must automatically be a bijection — being onto only requires hitting every value at least once; here many values are hit twice (once on the decreasing branch, once on an increasing branch), breaking injectivity.
✓Final answerThe correct option is (B) — Onto function but not one-one.
ANSWER: B
- 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
(−∞,1)∪{1}∪(1,∞)=R ⇒ f is onto
(assuming codomain R).
6. Conclusion: only onto, not one-one.
Common Mistakes
- Assuming a function built from ⋅ and division "looks complicated" and must fail to be onto — actually checking the two branches' ranges is what settles it.
- Missing that f(a)=f(−a) at the endpoints simply because a2−x2 vanishes there, which is the cleanest way to disprove one-one-ness without messy algebra.
- Forgetting to exclude x=0 from the domain, which doesn't change the range argument but is needed to justify why the two continuous branches don't touch at 0.
✓Final answerThe correct option is (B) — only onto.
ANSWER: B
- 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.
- Since f fails both properties, the correct classification is: neither one-one nor onto.
Common Mistakes
- Assuming any polynomial function on R→R must be onto — only odd-degree polynomials with real coefficients are guaranteed onto R (since they go from −∞ to +∞); even-degree ones are bounded on one side and are never onto R.
- Overlooking the pairing f(x)=f(−x) from the even power, which is the quickest way to see the failure of one-one-ness.
✓Final answerThe correct option is (D) — f is neither one-one nor onto.
ANSWER: D
- 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.
- A negative number is not in R+, so this x (a valid domain element) maps outside the stated codomain.
- Therefore the given rule does not define a function from R+ to R+.
Common Mistakes
- Jumping straight to checking one-one/onto without first verifying the rule actually respects the stated codomain — this is the classic trap in this question.
- Assuming R+ includes zero or negative numbers (it doesn't; it's strictly positive reals), which is why even x close to 0 causes the failure.
✓Final answerThe correct option is (D) — not a function.
ANSWER: D
- 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).
- Since f is continuous, strictly increasing, and f(x)→±∞ as x→±∞, its range is all of R — so it is onto (surjective).
- Hence f is a bijection.
Common Mistakes
- Assuming ∣x∣ always makes a function many-one — here the sign flip on the other factor compensates and preserves monotonicity.
- Forgetting to check the range actually covers all of R (unboundedness in both directions).
✓Final answerThe correct option is (C) — f is both one-one and onto.
ANSWER: C
- 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.
- Check injectivity with a concrete example: f(−1)=1+2−3=0 and f(3)=9−6−3=0; two different inputs (−1 and 3) give the same output (0), so f is NOT one-one.
- Since f is neither injective nor surjective, the correct classification is "neither one-one nor onto".
Common Mistakes
- Only checking one of injectivity/surjectivity and assuming the other follows — they must be checked independently.
- Forgetting that a quadratic R→R (with unrestricted domain) is essentially never one-one, since the vertex creates a symmetric pairing of inputs.
✓Final answerThe correct option is (C) — neither one-one nor onto.
ANSWER: C
- 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.
- Not onto R: the range is exactly [2,∞), so no value less than 2 is ever attained, even though the codomain is stated as all of R.
- Hence f is neither one-one nor onto.
Common Mistakes
- Assuming a "max of lines" function is automatically injective because each individual piece (like x+1) is injective — the flat middle piece breaks that.
- Overlooking that codomain R combined with range [2,∞) immediately rules out onto-ness.
✓Final answerThe correct option is (C) — Neither one – one nor onto.
ANSWER: C
🎓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.