UG Mathematics Booster Test 2 - Types of Functions
📌 Answers are locked once submitted — results and explanations appear at the end.
QUESTION 1 OF 20
Applying the mapping concept mathematically, which statements denote a valid function f from A to B?
I. Every element a in A has exactly one image b in B.
II. One element in A maps to multiple elements in B.
III. The subset of pairs is from A × B.
QUESTION 2 OF 20
Match the domain-codomain concepts for f: X → Y:
| List I | List II |
|---|---|
| 1. X | a. Image of x |
| 2. Y | b. Domain |
| 3. f(X) | c. Range |
| 4. y = f(x) | d. Codomain |
QUESTION 3 OF 20
The region bounded by the injective definition function f(x) = x³ from x = 0 to x = 2 and the x-axis represents an area. What is this calculated area?
QUESTION 4 OF 20
A condition check is run on all possible functions mapping from set A = {1, 2, 3} to set B = {x, y, z}. What is the probability that a randomly selected function is injective (one-one)?
QUESTION 5 OF 20
Which of the following is INCORRECT regarding a non-injective case?
QUESTION 6 OF 20
A chemical mixture's stability is modeled by a many-one function f(x) = x² - 4. Evaluate the numerical difference between f(-4) and f(4) examples to verify it maps identically. What is the value of f(4) - f(-4)?
QUESTION 7 OF 20
Arrange the following surjective definition examples in increasing order of the size of their codomains, given they are all onto functions:
1. f: X → {1}
2. f: X → {a, b, c}
3. f: X → {True, False}
QUESTION 8 OF 20
A transformation maps a set of position vectors into a vector space V. If the mapping is an onto function where Range equals codomain, it implies the mapped vectors:
QUESTION 9 OF 20
Assertion (A): The function f(x) = x² from R to R is an onto function.
Reason (R): The not onto case is defined when every element in the codomain has a pre-image.
QUESTION 10 OF 20
A function maps a dataset of 5 inputs to a codomain. The missing elements in the codomain tracking over a series are 10, 20, 30, 40. What is the 2-period moving average of the first two missing elements?
QUESTION 11 OF 20
When verifying if a region-based function graph represents a one-one and onto function (bijective), which graphical tests must it pass on its entire domain and codomain?
QUESTION 12 OF 20
For the bijective definition function f(x) = 3x² on the interval, find the definite integral value to measure its cumulative application.
QUESTION 13 OF 20
The identity function applied to an element x returns:
QUESTION 14 OF 20
The constant function defined by f(x) = c maps all inputs to a single output. It is classified as:
QUESTION 15 OF 20
The polynomial function f(x) = x³ - x maps R to R. Evaluating its behavior, it is:
QUESTION 16 OF 20
Evaluating the rational function f(x) = (x+1)/(x-2), its domain must exclude:
QUESTION 17 OF 20
Applying the modulus function f(x) = |x-3| to evaluate x = -2 yields:
QUESTION 18 OF 20
The signum function yields what output for x = 100?
QUESTION 19 OF 20
QUESTION 20 OF 20
Test Complete!
Answer Review
1 Applying the mapping concept mathematically, which statements denote a valid function f from A to B?
I. Every element a in A has exactly one image b in B.
II. One element in A maps to multiple elements in B.
III. The subset of pairs is from A × B.
Functions assign one output per input Ordered pairs belong to A × B Multiple outputs violate function definition
A valid function requires every element of A to have exactly one image in B. Also, all ordered pairs of the function belong to: \(A\times B\) Statement II is false because one input cannot map to multiple outputs. Hence only I and III are correct.
- Option A → Statement II violates uniqueness of outputs.
- Option C → Multiple outputs for one input are not allowed.
- Option D → Ignores the Cartesian product requirement.
Used: Elimination
Application:
- Reject statements contradicting the definition of a function.
Final Logic:
- A function means exactly one image for each input.
"One input → one output"
2 Match the domain-codomain concepts for f: X → Y:
| List I | List II |
|---|---|
| 1. X | a. Image of x |
| 2. Y | b. Domain |
| 3. f(X) | c. Range |
| 4. y = f(x) | d. Codomain |
X denotes domain Y denotes codomain f(X) gives range
In the notation: \(f:X\rightarrow Y\) X is the domain and Y is the codomain. The set f(X) represents the range. Expression y=f(x) gives the image of x. Thus the correct matching is 1-b, 2-d, 3-c, 4-a.
- Option A → Range and codomain are interchanged.
- Option B → Domain incorrectly matched to range.
- Option C → Domain and codomain mismatched.
Used: Option Grouping
Application:
- Match standard function notation definitions carefully.
Final Logic:
- Domain → X, Codomain → Y, Range → f(X).
"X starts, Y receives"
3 The region bounded by the injective definition function f(x) = x³ from x = 0 to x = 2 and the x-axis represents an area. What is this calculated area?
Area found using integration Integrate x³ from 0 to 2 Result equals 4 square units
The required area is: \(\int_{0}^{2}\,x^{3} dx\) Evaluating: \({\left[\frac{x^{4}}{4}\right]}_{0}^{2}=\frac{16}{4}=4\) Hence the area bounded by the curve and x-axis equals 4 square units. Therefore Option C is correct.
- Option A → Double the correct value.
- Option B → Too small due to incorrect integration.
- Option D → Equals x⁴ value before division by 4.
Used: Substitution
Application:
- Use the power-rule integration formula directly.
Final Logic:
- Integral of x³ gives x⁴/4.
"Power increases, divide next power"
4 A condition check is run on all possible functions mapping from set A = {1, 2, 3} to set B = {x, y, z}. What is the probability that a randomly selected function is injective (one-one)?
Total functions = 3³ Injective functions = 3! Probability = 6/27 = 2/9
Total functions from A to B: \(3^{3}=27\) Injective functions require distinct images: \(3!=6\) Therefore probability: \(\frac{6}{27}=\frac{2}{9}\) Hence the required probability is 2/9.
- Option B → Incorrect simplification.
- Option C → Overcounts injective mappings.
- Option D → Too few injective functions counted.
Used: Substitution
Application:
- Count total and injective mappings separately.
Final Logic:
- Injective probability = favorable ÷ total.
"3! over 3³"
5 Which of the following is INCORRECT regarding a non-injective case?
Many-one functions fail injectivity Inverse function requires one-one property Domain restriction is often necessary
Non-injective (many-one) functions do not possess proper inverses over the entire domain because multiple inputs give the same output. To define an inverse, the domain must usually be restricted. Therefore Option B is incorrect.
- Option A → Correct description of many-one mapping.
- Option C → Horizontal line test fails for non-injective functions.
- Option D → Equal outputs may come from distinct inputs.
Used: Elimination
Application:
- Check which statement contradicts inverse-function theory.
Final Logic:
- Only injective functions have unrestricted inverses.
"Many-one blocks inverse"
6 A chemical mixture's stability is modeled by a many-one function f(x) = x² - 4. Evaluate the numerical difference between f(-4) and f(4) examples to verify it maps identically. What is the value of f(4) - f(-4)?
Square removes sign difference f(4)=f(-4) Their difference equals zero
Given: \(f(x)=x^{2}-4\) Then: \(f(4)=16-4=12\) and \(f(-4)=16-4=12\) Therefore: \(f(4)-f(-4)=0\) Hence Option C is correct.
- Option A → Incorrect arithmetic subtraction.
- Option B → Uses squared value only.
- Option D → Ignores cancellation.
Used: Substitution
Application:
- Evaluate function at ±4 directly.
Final Logic:
- Equal outputs imply zero difference.
"Squares erase signs"
7 Arrange the following surjective definition examples in increasing order of the size of their codomains, given they are all onto functions:
1. f: X → {1}
2. f: X → {a, b, c}
3. f: X → {True, False}
Codomain sizes are 1,2,3 Arrange smallest to largest Onto functions cover all codomain elements
Codomain sizes are: \(∣1∣=1,∣True,False∣=2,∣a,b,c∣=3\) Increasing order is therefore: 1 → 3 → 2. Hence Option A is correct.
- Option B → Largest codomain placed first.
- Option C → Two-element codomain incorrectly placed before one-element.
- Option D → Three-element codomain misplaced.
Used: Odd One Out
Application:
- Compare codomain cardinalities directly.
Final Logic:
- Arrange according to codomain size.
"1 then 2 then 3"
8 A transformation maps a set of position vectors into a vector space V. If the mapping is an onto function where Range equals codomain, it implies the mapped vectors:
Onto means full codomain coverage Every vector in V has a pre-image Hence image spans whole vector space
An onto transformation satisfies: \(Range=Codomain\) Thus every vector in V is obtained from some input vector. Therefore the mapped vectors span the entire vector space V. Hence Option D is correct.
- Option A → Onto mappings need not produce only zero vectors.
- Option B → Vector addition property is unrelated.
- Option C → Onto mappings cover all of V, not smaller subsets.
Used: Contextual/Tonal Matching
Application:
- Interpret "onto" in vector-space language.
Final Logic:
- Onto transformations cover entire codomain.
"Onto means full coverage"
9 Assertion (A): The function f(x) = x² from R to R is an onto function.
Reason (R): The not onto case is defined when every element in the codomain has a pre-image.
x² misses negative outputs Hence function is not onto Reason incorrectly defines onto instead of into
The function: \(f(x)=x^{2}\) never produces negative real numbers, so it is not onto R. The Reason is also false because "every codomain element has a pre-image" defines onto functions, not not-onto functions. Therefore both statements are false.
- Option B → Assertion is false because negatives are missing.
- Option C → Reason incorrectly defines onto condition.
- Option D → Reason itself is false.
Used: Elimination
Application:
- Test onto definition against modulus-like behavior.
Final Logic:
- Missing negative outputs make x² not onto.
"Squares never go negative"
10 A function maps a dataset of 5 inputs to a codomain. The missing elements in the codomain tracking over a series are 10, 20, 30, 40. What is the 2-period moving average of the first two missing elements?
Use first two elements only Average of 10 and 20 Result equals 15
The 2-period moving average of the first two missing elements is: \(\frac{10+20}{2}=15\) Hence the moving average equals 15. Therefore Option C is correct.
- Option A → Equals second term, not average.
- Option B → Equals first term only.
- Option D → Incorrect addition/division.
Used: Substitution
Application:
- Apply moving-average formula directly.
Final Logic:
- Average of first two terms equals 15.
"Average sits in middle"
11 When verifying if a region-based function graph represents a one-one and onto function (bijective), which graphical tests must it pass on its entire domain and codomain?
Vertical line test checks function validity Horizontal line test checks injectivity Bijective functions satisfy both conditions
A bijective function must be both a valid function and one-one. The vertical line test confirms each x has one y-value, while the horizontal line test ensures different x-values produce distinct y-values. Together they verify bijection graphically. Therefore Option B is correct.
- Option A → Vertical line test alone checks only function validity.
- Option C → Horizontal line test alone cannot confirm function definition.
- Option D → Passing through origin is irrelevant to bijection.
Used: Elimination
Application:
- Separate conditions for "function" and "one-one" graphically.
Final Logic:
- Bijective = valid function + injective graph.
"Vertical for function, horizontal for one-one"
12 For the bijective definition function f(x) = 3x² on the interval, find the definite integral value to measure its cumulative application.
Integrate 3x² over given interval Use power rule of integration Result evaluates to 8
The integral is: \(\int_{0}^{2}\,3x^{2} dx\) Evaluating: \(={\left[x^{3}\right]}_{0}^{2}=8-0=8\) Hence the definite integral equals 8. Therefore Option D is correct.
- Option A → Incorrect evaluation of upper limit.
- Option B → Result from wrong power handling.
- Option C → Overestimation of area.
Used: Substitution
Application:
- Apply standard integration formula directly.
Final Logic:
- Integral of 3x² becomes x³.
"3x² integrates neatly to x³"
13 The identity function applied to an element x returns:
Identity function preserves input Output equals input exactly No transformation occurs
The identity function is defined as: \(I(x)=x\) It maps every element to itself without modification. Hence the output of x under the identity function is x itself. Therefore Option A is correct.
- Option B → Inverse value means reciprocal, not identity.
- Option C → Identity does not always output zero.
- Option D → Constant output defines constant function.
Used: Contextual/Tonal Matching
Application:
- Recall standard definition of identity mapping.
Final Logic:
- Identity leaves elements unchanged.
"Identity = unchanged"
14 The constant function defined by f(x) = c maps all inputs to a single output. It is classified as:
All inputs give same output Hence function is many-one Codomain larger than range makes it into
A constant function maps every input to the same fixed value c. Thus multiple inputs share one output, making it many-one. If the codomain has more than one element, not every codomain element gets mapped, so the function is into. Therefore Option D is correct.
- Option A → Constant functions are never one-one.
- Option B → One-one condition fails immediately.
- Option C → Constant functions are generally not onto.
Used: Elimination
Application:
- Check injective and onto conditions separately.
Final Logic:
- Single repeated output implies many-one into.
"One constant for all"
15 The polynomial function f(x) = x³ - x maps R to R. Evaluating its behavior, it is:
Polynomial covers all real outputs Different inputs may give same output Hence onto but not injective
The function: \(f(x)=x^{3}-x\) is onto because cubic polynomials attain all real values. However: \(f(-1)=0,f(0)=0,f(1)=0\) so distinct inputs share the same output. Therefore it is many-one and onto. Hence Option C is correct.
- Option A → Function is not injective.
- Option B → Cubic polynomials are onto R.
- Option D → Bijective requires injectivity too.
Used: Substitution
Application:
- Test equal outputs at different x-values.
Final Logic:
- Same output from multiple inputs breaks one-one property.
"−1, 0, 1 all give 0"
16 Evaluating the rational function f(x) = (x+1)/(x-2), its domain must exclude:
Denominator cannot be zero x−2 = 0 gives undefined value Hence x = 2 excluded
For rational functions, denominator must not vanish: \(x-2\neq 0\) Solving gives: \(x\neq 2\) Therefore x = 2 must be excluded from the domain. Hence Option B is correct.
- Option A → Denominator remains nonzero at x=0.
- Option C → Function defined at x=1.
- Option D → Function defined at x=-1.
Used: Substitution
Application:
- Set denominator equal to zero.
Final Logic:
- Undefined denominator restricts domain.
"Denominator zero forbidden"
17 Applying the modulus function f(x) = |x-3| to evaluate x = -2 yields:
Substitute x = −2 Compute modulus value Absolute value becomes positive
Given: \(f(x)=∣x-3∣\) Substituting x = −2: \(∣-2-3∣=∣-5∣=5\) Hence the function value equals 5. Therefore Option D is correct.
- Option A → Modulus cannot be negative.
- Option B → Arithmetic error in subtraction.
- Option C → Absolute value never negative.
Used: Substitution
Application:
- Directly evaluate expression inside modulus.
Final Logic:
- Absolute value converts −5 to 5.
"Modulus removes sign"
18 The signum function yields what output for x = 100?
Signum depends on sign only Positive numbers map to 1 100 is positive
The signum function is: \(sgn(x)=\left\{\begin{pmatrix}1, & x>0\\ 0, & x=0\\ -1, & x<0\end{pmatrix}\right.\) Since 100 is positive: \(sgn(100)=1\) Hence Option A is correct.
- Option B → Signum gives sign, not value itself.
- Option C → Output 0 occurs only at x=0.
- Option D → Negative outputs occur only for x<0.
Used: Elimination
Application:
- Check sign of the given number.
Final Logic:
- Positive input gives output 1.
"Positive → +1"
19
Finite sets connect injective and onto properties One-one automatically implies onto Domain and codomain have equal size
For finite sets with equal cardinality, an injective mapping automatically covers the entire codomain. Thus a one-one function: \(f:X\rightarrow X\) must also be onto. Therefore the function becomes bijective. Hence Option D is correct.
- Option A → Into contradicts finite injective property.
- Option B → Many-one opposes one-one assumption.
- Option C → Constant functions are not injective.
Used: Contextual/Tonal Matching
Application:
- Use the exact finite-set theorem from passage.
Final Logic:
- Finite equal-sized sets force injective ⇒ onto.
"Finite one-one means onto"
20
Infinite sets behave differently Injective need not imply onto Example: f(x)=x+1 on N
For infinite sets, one-one functions may fail to cover the entire codomain. Example: \(f(n)=n+1\) on natural numbers is injective but misses 1 in the codomain. Hence injective does not always imply onto for infinite sets. Therefore Option C is correct.
- Option A → Infinite sets can define functions normally.
- Option B → Infinite-set functions need not be bijective.
- Option D → Domains and codomains are well-defined for infinite sets.
Used: Elimination
Application:
- Compare finite-set property with infinite-set exception.
Final Logic:
- Infinite sets break injective ⇒ onto equivalence.
"Infinite sets break the rule"
