Mathematics - MCQ Practice Questions
Practice free Mathematics multiple-choice questions with detailed answers and explanations. Perfect for competitive exam preparation.
190 questions | 100% Free
Let f:R→R be defined by f(x)=x2+1x2−1. Which of the following statements is true?
Understanding:
We need to check whether f(x)=x2+1x2−1 is one-one (injective) and onto (surjective) from R to R.
Formula:
A function is one-one if f(a)=f(b)⇒a=b.
A function is onto if for every y∈R, there exists x∈R with f(x)=y.
Step 1: Check one-one
Note that f(x) depends on x2, so f(1)=f(−1)=0 but 1=−1.
Hence f is not one-one.
Step 2: Find the range of f
Rewrite:
For x2≥0 we need 1−y1+y≥0, which holds when −1≤y<1.
Also as x→∞, f(x)→1 but never reaches 1.
So the range of f is [−1,1), which is a proper subset of R.
Hence f is not onto.
Answer:
f is neither one-one nor onto.
Quick Tip:
Whenever f(x) involves only x2 (an even function), it automatically fails to be one-one on R.
If A={1,2,3,4,5,6} and B={2,4,6,8,10}, then the number of elements in (A∪B)−(A∩B) is:
Understanding:
We need to find the number of elements in (A∪B)−(A∩B), the symmetric difference of A and B.
Formula:
This is the symmetric difference A△B.
Step 1: Find A∩B
Step 2: Find A∪B
Step 3: Compute (A∪B)−(A∩B)
Number of elements =5.
Answer:
The number of elements in (A∪B)−(A∩B) is 5.
Quick Tip:
(A∪B)−(A∩B) is always the symmetric difference A△B; its size equals ∣A∣+∣B∣−2∣A∩B∣.
Let f(x)=4−x2+x2−1. The domain of f is:
Understanding:
We need the domain of f(x)=4−x2+x2−1, i.e., the set of all real x for which both square roots are defined.
Formula:
For g(x) to be real, we need g(x)≥0.
Step 1: Condition from first term
Step 2: Condition from second term
So x∈(−∞,−1]∪[1,∞).
Step 3: Intersect both conditions
Answer:
The domain of f is [−2,−1]∪[1,2].
A relation R on N is defined by (a,b)∈R if and only if a divides b. Which of the following is true about R?
Understanding:
We check the three properties of the divisibility relation on N: (a,b)∈R⟺a∣b.
Formula:
A relation is an equivalence relation if it is reflexive, symmetric, and transitive.
Step 1: Reflexive
For every a∈N, a∣a, so (a,a)∈R. Hence R is reflexive.
Step 2: Symmetric
Take a=2, b=6: 2∣6 so (2,6)∈R.
But 6∤2, so (6,2)∈/R.
Hence R is not symmetric.
Step 3: Transitive
Suppose a∣b and b∣c. Then b=ka and c=lb for some k,l∈N, giving c=kla, so a∣c.
Hence R is transitive.
Answer:
R is reflexive and transitive but not symmetric.
Quick Tip:
Divisibility on N is a classic example of a partial order (reflexive, antisymmetric, transitive) — note antisymmetric = symmetric.
If f:A→B is a bijection and g:B→C is a bijection, then (g∘f)−1 equals:
Understanding:
We need the inverse of the composition g∘f, where both f and g are bijections.
Formula:
For bijections, (g∘f)−1=f−1∘g−1.
This is the socks-and-shoes rule: reverse the order and invert each.
Step 1: Verify symbolically
Let y=(g∘f)(x)=g(f(x)).
Applying g−1: g−1(y)=f(x).
Applying f−1: f−1(g−1(y))=x.
So (g∘f)−1(y)=(f−1∘g−1)(y).
Step 2: Confirm domain matching
g:B→C, so g−1:C→B, and f−1:B→A.
Thus f−1∘g−1:C→A, which correctly maps back from C to A.
Answer:
(g∘f)−1=f−1∘g−1.
Quick Tip:
Remember: "put on socks then shoes; to undo, remove shoes first, then socks." The order reverses when taking inverses of compositions.
Let f(x)=x−1x+1 for x=1. Then f(f(f(f(x)))) equals:
Understanding:
We must find the fourth iterate of f(x)=x−1x+1.
Formula:
Compute f(f(x)) first, then apply again twice.
Step 1: Find f(f(x))
Step 2: Conclude the fourth iterate
Since f(f(x))=x, applying f twice returns to x.
Answer:
f(f(f(f(x))))=x.
Quick Tip:
f is its own inverse (an involution): f∘f=id. Any even number of applications returns the original input.
If U={1,2,3,…,10}, A={1,2,3,4,5}, and B={3,4,5,6,7}, then n(A′∩B′) equals:
Understanding:
We need n(A′∩B′), the number of elements in U that belong to neither A nor B.
Formula:
By De Morgan's law:
Step 1: Find A∪B
Step 2: Apply the formula
The elements are {8,9,10}.
Answer:
n(A′∩B′)=3.
The function f:R→R defined by f(x)=3x+5 is:
Understanding:
We check whether f(x)=3x+5 is injective and surjective as a map from R to R.
Formula:
A linear function f(x)=ax+b with a=0 is a bijection on R.
Step 1: Check one-one
Suppose f(a)=f(b):
So f is one-one.
Step 2: Check onto
For any y∈R, we need x such that f(x)=y:
Such an x always exists, so f is onto.
Answer:
f is both one-one and onto, i.e., a bijection.
Let A={1,2,3,…,n}. The number of functions from A to A that are one-one when n=4 is:
Understanding:
We count the number of one-one (injective) functions from A={1,2,3,4} to itself.
Formula:
The number of one-one functions from a set of n elements to itself equals n! (the number of permutations):
Step 1: Apply the formula
Step 2: Reasoning
The first element can map to 4 choices, the second to 3, the third to 2, and the fourth to 1 (no repetition allowed for injectivity), giving 4×3×2×1=24.
Answer:
The number of one-one functions is 24.
Quick Tip:
For a finite set, a one-one function from A to A is automatically onto as well — such functions are exactly the permutations of A.
If f(x)=x2+2 and g(x)=3x−1, then (f∘g)(2) equals:
Understanding:
We need (f∘g)(2)=f(g(2)).
Formula:
Step 1: Compute g(2)
Step 2: Compute f(g(2))=f(5)
Answer:
(f∘g)(2)=27.
Quick Tip:
A common error is computing g(f(2)) instead of f(g(2)). Always evaluate the inner function first: f∘g means f applied after g.