1.2 MCQs-Functions
Functions
Basic Concepts and Definitions
1. A function f from set A to set B is defined as:
A relation where each element of A is related to at least one element of B
A relation where each element of A is related to exactly one element of B
A relation where each element of B is related to at least one element of A
A relation where each element of B is related to exactly one element of A
Show me the answer
Answer: 2. A relation where each element of A is related to exactly one element of B
Explanation:
A function f:A→B is a special type of relation where:
For every element a∈A, there exists exactly one element b∈B such that (a,b)∈f.
This is often written as f(a)=b.
The set A is called the domain, and B is called the codomain.
The range is the set of all actual output values: {f(a):a∈A}⊆B.
2. Which of the following relations from A={1,2,3} to B={4,5,6} represents a function?
{(1,4),(2,5)}
{(1,4),(2,5),(3,6),(1,5)}
{(1,4),(2,5),(3,6)}
{(1,4),(2,4),(3,4)}
Show me the answer
Answer: 3. {(1,4),(2,5),(3,6)}
Explanation:
For a relation to be a function from A to B:
Every element of A must appear as the first element in at least one ordered pair.
No element of A can appear as the first element in more than one ordered pair.
Option 1 fails condition 1: element 3 from A is missing.
Option 2 fails condition 2: element 1 from A appears twice (with both 4 and 5).
Option 3 satisfies both conditions: each of 1,2,3 appears exactly once as first element.
Option 4 also satisfies both conditions (it's a constant function).
3. The domain of a function is:
The set of all possible input values
The set of all possible output values
The set of all ordered pairs (x, f(x))
The set of all points where the function is defined
Show me the answer
Answer: 1. The set of all possible input values
Explanation:
For a function f:A→B:
Domain = A = set of all input values.
Codomain = B = set of all possible output values.
Range = {f(x):x∈A} = actual set of output values.
The domain consists of all values for which the function is defined and produces an output.
In many practical problems, the domain is determined by restrictions like:
Denominator cannot be zero
Square root argument must be non-negative
Logarithm argument must be positive
4. The range of the function f(x)=x2 with domain {−2,−1,0,1,2} is:
{−4,−1,0,1,4}
{0,1,4}
{0,1,2,4}
{−2,−1,0,1,2}
Show me the answer
Answer: 2. {0,1,4}
Explanation:
Range is the set of actual output values obtained by applying the function to all elements in the domain.
Given f(x)=x2 and domain = {−2,−1,0,1,2}
Calculate: f(−2)=(−2)2=4 f(−1)=(−1)2=1 f(0)=02=0 f(1)=12=1 f(2)=22=4
Distinct output values: 0, 1, 4
Therefore, range = {0,1,4}
Note: The range is a set, so duplicates are not listed.
Types of Functions
5. A function f:A→B is said to be one-to-one (injective) if:
Every element of B has at least one pre-image in A
Different elements of A have different images in B
Every element of B has exactly one pre-image in A
The range equals the codomain
Show me the answer
Answer: 2. Different elements of A have different images in B
Explanation:
A function is injective (one-to-one) if it preserves distinctness: If a1=a2, then f(a1)=f(a2)
Equivalently: If f(a1)=f(a2), then a1=a2
Injective functions never map two different domain elements to the same codomain element.
Examples:
f(x)=2x is injective (different x give different 2x)
f(x)=x2 from R to R is NOT injective (both 2 and -2 map to 4)
6. A function f:A→B is said to be onto (surjective) if:
Every element of B has at least one pre-image in A
Different elements of A have different images in B
Every element of B has exactly one pre-image in A
The domain equals the codomain
Show me the answer
Answer: 1. Every element of B has at least one pre-image in A
Explanation:
A function is surjective (onto) if its range equals its codomain.
Formally: For every b∈B, there exists at least one a∈A such that f(a)=b.
Surjective functions "cover" the entire codomain.
Examples:
f(x)=2x from R to R is surjective
f(x)=x2 from R to [0,∞) is surjective
f(x)=x2 from R to R is NOT surjective (negative numbers have no pre-image)
7. A function that is both one-to-one and onto is called:
Injective
Surjective
Bijective
Constant
Show me the answer
Answer: 3. Bijective
Explanation:
A bijective function is both injective (one-to-one) and surjective (onto).
Properties of bijective functions:
Every element of the domain maps to a unique element of the codomain.
Every element of the codomain has exactly one pre-image.
Bijective functions establish a one-to-one correspondence between domain and codomain.
If f:A→B is bijective, then:
∣A∣=∣B∣ (sets have the same cardinality)
The inverse function f−1:B→A exists.
8. Which of the following functions is injective but not surjective?
f:R→R,f(x)=x3
f:R→R,f(x)=x2
f:R→[0,∞),f(x)=x2
f:R→R,f(x)=ex
Show me the answer
Answer: 4. f:R→R,f(x)=ex
Explanation:
Let's analyze each option:
f(x)=x3 is both injective and surjective on R, so it's bijective.
f(x)=x2 is neither injective (e.g., f(2)=f(-2)=4) nor surjective (negative numbers not in range).
f(x)=x2 with codomain [0,∞) is surjective but not injective.
f(x)=ex:
Injective: If ex1=ex2, then x1=x2.
Not surjective: Range is (0,∞), which is not all of R (negative numbers and zero have no pre-image).
9. A function where all elements of the domain map to the same element in the codomain is called:
Identity function
Constant function
Bijective function
Onto function
Show me the answer
Answer: 2. Constant function
Explanation:
A constant function has the same output value for every input.
Form: f(x)=c for all x∈A, where c is a fixed element of B.
Examples:
f:R→R,f(x)=5 for all x
f:{1,2,3}→{a,b},f(1)=f(2)=f(3)=a
Properties:
Never injective (unless domain has only one element)
Surjective only if codomain = {c} (singleton set)
Graph is a horizontal line (for real functions)
10. The identity function on a set A is defined as:
f(x)=0 for all x∈A
f(x)=1 for all x∈A
f(x)=x for all x∈A
f(x)=−x for all x∈A
Show me the answer
Answer: 3. f(x)=x for all x∈A
Explanation:
The identity function IA:A→A maps each element to itself.
Notation: IA(x)=x for all x∈A.
Properties:
Always bijective (both injective and surjective)
Its inverse is itself: IA−1=IA
Composition with any function f: f∘IA=IA∘f=f
The identity function is the neutral element for function composition.
Composition of Functions
11. If f:A→B and g:B→C are functions, then the composition g∘f is:
A function from A to C defined by (g∘f)(x)=g(f(x))
A function from B to A defined by (g∘f)(x)=f(g(x))
A function from A to C defined by (g∘f)(x)=f(g(x))
A function from C to A defined by (g∘f)(x)=g(f(x))
Show me the answer
Answer: 1. A function from A to C defined by (g∘f)(x)=g(f(x))
Explanation:
Function composition g∘f is defined only when the codomain of f equals the domain of g.
The composition is read "g circle f" or "g of f".
Order matters: g∘f means apply f first, then g.
Domain of g∘f = domain of f = A.
Codomain of g∘f = codomain of g = C.
Example: If f(x)=x2 and g(x)=x+1, then: (g∘f)(x)=g(f(x))=g(x2)=x2+1
12. For functions f:A→B and g:B→C, if both f and g are injective, then g∘f is:
Injective
Surjective
Bijective
Not necessarily injective
Show me the answer
Answer: 1. Injective
Explanation:
If f and g are both injective, then their composition g∘f is also injective.
Proof: Suppose (g∘f)(x1)=(g∘f)(x2). Then g(f(x1))=g(f(x2)). Since g is injective, f(x1)=f(x2). Since f is injective, x1=x2. Therefore, g∘f is injective.
However, g∘f may not be surjective even if both f and g are surjective.
Example: f: ℝ→(0,∞) with f(x)=e^x (injective), g: (0,∞)→ℝ with g(x)=ln(x) (injective). Then g∘f(x)=ln(e^x)=x is the identity on ℝ, which is injective.
13. For functions f:A→B and g:B→C, if both f and g are surjective, then g∘f is:
Injective
Surjective
Bijective
Not necessarily surjective
Show me the answer
Answer: 2. Surjective
Explanation:
If f and g are both surjective, then their composition g∘f is also surjective.
Proof: Let c∈C be arbitrary. Since g is surjective, there exists b∈B such that g(b)=c. Since f is surjective, there exists a∈A such that f(a)=b. Then (g∘f)(a)=g(f(a))=g(b)=c. Therefore, every c∈C has a pre-image in A, so g∘f is surjective.
However, g∘f may not be injective even if both f and g are injective.
Example: f: ℝ→(0,∞) with f(x)=e^x (surjective onto (0,∞)), g: (0,∞)→ℝ with g(x)=ln(x) (surjective onto ℝ). Then g∘f(x)=ln(e^x)=x is the identity on ℝ, which is surjective.
14. For any function f:A→A, f∘IA equals:
IA
f
f−1
IA∘f
Show me the answer
Answer: 2. f
Explanation:
The identity function IA acts as the identity element for function composition.
For any function f:A→A: f∘IA=f and IA∘f=f
Proof: For any x∈A, (f∘IA)(x)=f(IA(x))=f(x) (IA∘f)(x)=IA(f(x))=f(x)
This is analogous to multiplying by 1 in arithmetic: a×1=1×a=a.
Inverse Functions
15. A function f:A→B has an inverse function f−1:B→A if and only if:
f is injective
f is surjective
f is bijective
f is constant
Show me the answer
Answer: 3. f is bijective
Explanation:
A function has an inverse function if and only if it is bijective (both injective and surjective).
Requirements for an inverse:
Injective: Ensures f−1 is a function (each input maps to a unique output).
Surjective: Ensures domain of f−1 is all of B.
Properties of inverse functions: f−1(f(x))=x for all x∈A f(f−1(y))=y for all y∈B (f−1)−1=f
Example: f:R→R,f(x)=2x+3 is bijective, so it has inverse f−1(x)=2x−3.
16. If f(x)=2x+3, then its inverse f−1(x) is:
2x−3
2x+3
2x−3
2x+31
Show me the answer
Answer: 1. 2x−3
Explanation:
To find the inverse of f(x)=2x+3:
Write y=2x+3
Solve for x in terms of y: 2x=y−3, so x=2y−3
Swap x and y: y=2x−3
Therefore, f−1(x)=2x−3
Verification: f−1(f(x))=f−1(2x+3)=2(2x+3)−3=22x=x f(f−1(x))=f(2x−3)=2(2x−3)+3=(x−3)+3=x
17. For a bijective function f, (f−1∘f)(x) equals:
f(x)
f−1(x)
x
1
Show me the answer
Answer: 3. x
Explanation:
For a bijective function f:A→B with inverse f−1:B→A: (f−1∘f)(x)=f−1(f(x))=x for all x∈A (f∘f−1)(y)=f(f−1(y))=y for all y∈B
This is the defining property of inverse functions.
Geometrically, the graph of f−1 is the reflection of the graph of f about the line y=x.
Example: For f(x)=2x, f−1(x)=2x: f−1(f(x))=f−1(2x)=22x=x
18. The inverse of the identity function IA:A→A is:
The constant function
The zero function
IA itself
Does not exist
Show me the answer
Answer: 3. IA itself
Explanation:
The identity function IA(x)=x is its own inverse.
Since IA is bijective, it has an inverse.
Verification: IA−1(IA(x))=IA−1(x)=x IA(IA−1(x))=IA(x)=x
This shows that IA−1=IA.
In general, a function that is its own inverse is called an involution.
Special Functions
19. The greatest integer function (floor function) f(x)=⌊x⌋ gives:
The smallest integer ≥ x
The largest integer ≤ x
The integer closest to x
The absolute value of x
Show me the answer
Answer: 2. The largest integer ≤ x
Explanation:
The greatest integer function or floor function ⌊x⌋ gives the greatest integer less than or equal to x.
Also called the "integer part" of x.
Examples: ⌊3.7⌋=3 ⌊−2.3⌋=−3 (not -2, because -3 ≤ -2.3) ⌊5⌋=5
The ceiling function ⌈x⌉ gives the smallest integer ≥ x.
Properties:
⌊x⌋≤x<⌊x⌋+1
Graph consists of horizontal steps.
20. The absolute value function f(x)=∣x∣ is defined as:
∣x∣=x for all x
∣x∣=−x for all x
∣x∣={x−xif x≥0if x<0
∣x∣=x2
Show me the answer
Answer: 3. ∣x∣={x−xif x≥0if x<0
Explanation:
The absolute value of a real number x, denoted |x|, is its distance from 0 on the number line.
Equivalent definitions:
Piecewise: ∣x∣={x−xif x≥0if x<0
Using square root: ∣x∣=x2
Properties:
∣x∣≥0 for all x
∣x∣=0 if and only if x = 0
∣xy∣=∣x∣⋅∣y∣
∣x+y∣≤∣x∣+∣y∣ (triangle inequality)
Graph: V-shaped, symmetric about the y-axis.
21. A function f is called even if:
f(−x)=f(x) for all x in the domain
f(−x)=−f(x) for all x in the domain
f(x+y)=f(x)+f(y) for all x, y
f(xy)=f(x)f(y) for all x, y
Show me the answer
Answer: 1. f(−x)=f(x) for all x in the domain
Explanation:
A function f is even if it satisfies f(−x)=f(x) for all x in its domain.
Geometric interpretation: The graph is symmetric with respect to the y-axis.
Examples:
f(x)=x2 (check: f(−x)=(−x)2=x2=f(x))
f(x)=cosx
f(x)=∣x∣
Properties:
If f and g are even, then f+g, f-g, and f·g are even.
The composition of two even functions is even.
The only function that is both even and odd is the zero function.
22. A function f is called odd if:
f(−x)=f(x) for all x in the domain
f(−x)=−f(x) for all x in the domain
f(x+y)=f(x)+f(y) for all x, y
f(xy)=f(x)f(y) for all x, y
Show me the answer
Answer: 2. f(−x)=−f(x) for all x in the domain
Explanation:
A function f is odd if it satisfies f(−x)=−f(x) for all x in its domain.
Geometric interpretation: The graph is symmetric with respect to the origin (180° rotation).
Examples:
f(x)=x3 (check: f(−x)=(−x)3=−x3=−f(x))
f(x)=sinx
f(x)=x
Properties:
If f and g are odd, then f+g and f-g are odd, but f·g is even.
The composition of two odd functions is odd.
Any function can be written as the sum of an even and an odd function.
Domain and Range Calculations
23. The domain of the function f(x)=x−21 is:
All real numbers
All real numbers except 0
All real numbers except 2
All real numbers except -2
Show me the answer
Answer: 3. All real numbers except 2
Explanation:
For rational functions, the domain excludes values that make the denominator zero.
Here, denominator = x−2
Set denominator ≠ 0: x−2=0 ⇒ x=2
Therefore, domain = {x∈R:x=2}
In interval notation: (−∞,2)∪(2,∞)
The function has a vertical asymptote at x = 2.
24. The domain of the function f(x)=x−3 is:
All real numbers
x≥0
x≥3
x≤3
Show me the answer
Answer: 3. x≥3
Explanation:
For square root functions, the expression inside the square root must be non-negative.
Here: x−3≥0 ⇒ x≥3
Therefore, domain = [3,∞)
The range is [0,∞) because square root always gives non-negative outputs.
Check: f(3)=3−3=0=0 f(4)=4−3=1=1 f(7)=7−3=4=2
25. The domain of the function f(x)=log(x−1) is:
All real numbers
x>0
x>1
x≥1
Show me the answer
Answer: 3. x>1
Explanation:
For logarithmic functions, the argument must be strictly positive.
Here: x−1>0 ⇒ x>1
Therefore, domain = (1,∞)
Common mistake: x≥1 is incorrect because log(0) is undefined.
The range of logarithmic functions is all real numbers: (−∞,∞).
26. The range of the function f(x)=x2+4 is:
All real numbers
[0,∞)
[4,∞)
(−∞,4]
Show me the answer
Answer: 3. [4,∞)
Explanation:
For f(x)=x2+4:
x2≥0 for all real x
Therefore, x2+4≥4 for all real x
The minimum value occurs at x = 0: f(0)=02+4=4
As ∣x∣ increases, f(x) increases without bound.
Therefore, range = [4,∞)
Graphically, this is a parabola opening upward with vertex at (0, 4).
Composite Functions and Inverses
27. If f(x)=2x−1 and g(x)=x2+3, then (f∘g)(x) is:
2x2+5
2x2+2
4x2−4x+4
2x2+5x−1
Show me the answer
Answer: 2. 2x2+2
Explanation:
(f∘g)(x)=f(g(x))=f(x2+3)
Substitute x2+3 into f: 2(x2+3)−1
Simplify: 2x2+6−1=2x2+5
Wait, let's recalculate carefully: f(x)=2x−1 g(x)=x2+3 f(g(x))=f(x2+3)=2(x2+3)−1=2x2+6−1=2x2+5
Actually, option 1 is 2x2+5, not option 2. So the correct answer should be option 1.
Let me verify: Option 1 says 2x² + 5, option 2 says 2x² + 2.
Calculation shows 2x² + 5, so option 1 is correct.
Correction: The answer is 1. 2x2+5
28. If f(x)=2x−1 and g(x)=x2+3, then (g∘f)(x) is:
2x2+5
4x2−4x+4
4x2−4x+2
2x2+2
Show me the answer
Answer: 2. 4x2−4x+4
Explanation:
(g∘f)(x)=g(f(x))=g(2x−1)
Substitute 2x−1 into g: (2x−1)2+3
Expand: (4x2−4x+1)+3=4x2−4x+4
Therefore, (g∘f)(x)=4x2−4x+4
Note that in general, (f∘g)(x)=(g∘f)(x).
Here: (f∘g)(x)=2x2+5, while (g∘f)(x)=4x2−4x+4.
29. The inverse of f(x)=x−12x+3, for x=1, is:
f−1(x)=x−2x+3
f−1(x)=x+2x−3
f−1(x)=x−1x+3
f−1(x)=2x+3x−1
Show me the answer
Answer: 1. f−1(x)=x−2x+3
Explanation:
To find inverse of f(x)=x−12x+3:
Set y=x−12x+3
Solve for x: y(x−1)=2x+3 yx−y=2x+3 yx−2x=y+3 x(y−2)=y+3 x=y−2y+3
Swap x and y: y=x−2x+3
Therefore, f−1(x)=x−2x+3, for x=2
Verification: Check that f(f−1(x))=x and f−1(f(x))=x
30. If f(x)=3x+2 and g(x)=3x−2, then:
g is the inverse of f
f is the inverse of g
Both 1 and 2
Neither is inverse of the other
Show me the answer
Answer: 3. Both 1 and 2
Explanation:
Check if g is inverse of f: (g∘f)(x)=g(f(x))=g(3x+2)=3(3x+2)−2=33x=x (f∘g)(x)=f(g(x))=f(3x−2)=3(3x−2)+2=(x−2)+2=x
Both compositions give the identity function.
Therefore, g = f⁻¹ and f = g⁻¹.
This is symmetric: if g is the inverse of f, then f is also the inverse of g.
The functions are mutual inverses.
Last updated