UG Mathematics Booster Test 2 - Introduction and Basic Concepts
๐ Answers are locked once submitted โ results and explanations appear at the end.
QUESTION 1 OF 20
Arrange the following relations from most restrictive (containing the fewest ordered pairs) to least restrictive on the set A = {1, 2, 3}:
1. Universal relation
2. Empty relation
3. Identity relation
4. R = {(1,2), (2,1), (1,1), (2,2)}
QUESTION 2 OF 20
Set A has exactly 3 elements. A relation on A is picked at random from all possible relations. What is the probability that the picked relation contains the element (1,1)?
QUESTION 3 OF 20
Which is incorrect about converting the relation R = {(x, y) : xยฒ + yยฒ = 25, x, y โ Z} to roster form?
QUESTION 4 OF 20
Which of these set-builder notations define a proper equivalence relation on the set of integers?
I. R = {(a, b) : a - b is an integer}
II. R = {(a, b) : a + b is even}
III. R = {(a, b) : a < b}
QUESTION 5 OF 20
Match the real-valued function to its maximum possible domain in R:
| List I | List II |
|---|---|
| 1. f(x) = 1/x | a. x โฅ 0 |
| 2. f(x) = โx | b. x > 0 |
| 3. f(x) = 1/(xยฒ - 1) | c. R - {0} |
| 4. f(x) = ln(x) | d. R - {-1, 1} |
QUESTION 6 OF 20
An EMI financial function maps loan tenure in years (x) to total interest percentage (y). If the function evaluates to y = 5x + 2, and the domain is {1, 2, 3, 4}, what is the maximum value in the range?
QUESTION 7 OF 20
Assertion (A): A relation where one x-value maps to two different y-values is a valid mathematical function.
Reason (R): Functions inherently allow multiple outputs for a single input to model complex trajectories.
QUESTION 8 OF 20
A real valued function generates sequence values 2, 6, 12, 20. The first difference between consecutive values generates a new analytical sequence. What is the 2-period moving average of the first two values of this new sequence?
QUESTION 9 OF 20
The graph of relation R is defined by the inequality xยฒ + yยฒ < 1. This means R analytically represents:
QUESTION 10 OF 20
Match the mapping diagram scenarios to their rigorous relation properties:
| List I | List II |
|---|---|
| 1. Every x points to exactly one distinct y, and all y are covered. | a. Not a function |
| 2. Every x points to exactly one distinct y, but some y are not covered. | b. Many-one function |
| 3. Multiple x elements point to the same y. | c. Bijective function |
| 4. One x element points to multiple y elements. | d. Injective but not surjective |
QUESTION 11 OF 20
For the family relation defined as "x is a descendant of y":
I. It is transitive.
II. It is not reflexive.
III. It is symmetric.
QUESTION 12 OF 20
The relation mapping is defined by the natural exponential function y = e^x. Find the integral of this function from 0 to ln(2).
QUESTION 13 OF 20
An ordered pair (a,b) is a vector in 2D. Under relation R, vector v maps to vector w such that w is the orthogonal projection of v onto the x-axis. What does the pair (4, 5) map to?
QUESTION 14 OF 20
If aRb represents the set of points where a โฅ 0, b โฅ 0, and a + b โค 2, what is the area of the polygon formed by this restricted relation?
QUESTION 15 OF 20
QUESTION 16 OF 20
QUESTION 17 OF 20
Which analytical statement about the composition gof is incorrect?
QUESTION 18 OF 20
Arrange the algebraic steps to find the inverse of the function f(x) = 2x + 3:
1. Replace y with x, and x with fโปยน(x).
2. Set y = 2x + 3.
3. The final inverse is fโปยน(x) = (x - 3)/2.
4. Solve for x algebraically in terms of y: x = (y - 3)/2.
QUESTION 19 OF 20
In a network of computers, relation R represents "is connected to". If it strictly acts as an equivalence relation, what does a resulting equivalence class represent?
QUESTION 20 OF 20
Assertion (A): The relation "modulus of difference is a multiple of 4" on the set of integers is a valid equivalence relation.
Reason (R): Any relation mathematically based on the divisibility of a difference is only transitive, not reflexive.
Test Complete!
Answer Review
1 Arrange the following relations from most restrictive (containing the fewest ordered pairs) to least restrictive on the set A = {1, 2, 3}:
1. Universal relation
2. Empty relation
3. Identity relation
4. R = {(1,2), (2,1), (1,1), (2,2)}
Empty relation has 0 pairs Identity relation has 3 pairs Universal relation has maximum pairs
For A = {1,2,3}, universal relation contains 9 ordered pairs, identity relation contains 3 pairs, and Relation 4 contains 4 pairs. Empty relation contains no ordered pairs. Therefore ordering from fewest to most pairs is: Empty relation โ Identity relation โ Relation 4 โ Universal relation. Hence Option C is correct.
- Option A โ Starts with universal relation, which has maximum ordered pairs.
- Option B โ Relation 4 has more pairs than identity relation.
- Option D โ Identity relation cannot come before empty relation.
Used: Option Grouping
Application:
- Count ordered pairs in each relation and arrange numerically.
Final Logic:
- 0 < 3 < 4 < 9 ordered pairs.
"Empty < Identity < Partial < Universal"
2 Set A has exactly 3 elements. A relation on A is picked at random from all possible relations. What is the probability that the picked relation contains the element (1,1)?
A ร A has 9 ordered pairs Half of all subsets contain (1,1) Probability equals 1/2
A set with 3 elements gives 3ร3 = 9 ordered pairs in A ร A. Total relations are 2โน. For exactly half of these relations, the pair (1,1) is included. Thus favorable relations = 2โธ. Hence probability = 2โธ/2โน = 1/2. Therefore Option D is correct.
- Option A โ Uses total relations incorrectly as probability.
- Option B โ Assumes only one ordered pair selection process.
- Option C โ Incorrect subset-counting logic.
Used: Elimination
Application:
- Recognize that inclusion/exclusion of one fixed element splits subsets equally.
Final Logic:
- Any specific ordered pair appears in exactly half the relations.
"One pair appears in half the subsets"
3 Which is incorrect about converting the relation R = {(x, y) : xยฒ + yยฒ = 25, x, y โ Z} to roster form?
(5,5) does not satisfy equation 5ยฒ + 5ยฒ = 50 Valid pairs satisfy total 25 only
For the relation xยฒ + yยฒ = 25, the pair (5,5) gives 25 + 25 = 50, not 25. Hence Option A is incorrect. Valid integer solutions include (ยฑ3,ยฑ4), (ยฑ4,ยฑ3), (ยฑ5,0), and (0,ยฑ5), totaling 12 ordered pairs. Therefore other options are correct.
- Option B โ Correct because total integer solutions equal 12 ordered pairs.
- Option C โ Both ordered pairs satisfy 3ยฒ + 4ยฒ = 25.
- Option D โ Both pairs satisfy 0ยฒ + 5ยฒ = 25.
Used: Substitution
Application:
- Substitute coordinates into the equation xยฒ+yยฒ=25 directly.
Final Logic:
- (5,5) violates the defining equation.
"Check equation before accepting pair"
4 Which of these set-builder notations define a proper equivalence relation on the set of integers?
I. R = {(a, b) : a - b is an integer}
II. R = {(a, b) : a + b is even}
III. R = {(a, b) : a < b}
Equivalence needs reflexive, symmetric, transitive I and II satisfy all properties Less-than is not symmetric
Statement I is always true for integers, so it forms an equivalence relation. Statement II groups integers by parity and satisfies reflexive, symmetric, and transitive properties. Statement III fails reflexivity and symmetry because a < a is false and reverse order need not hold. Hence Option B is correct.
- Option A โ Ignores Statement II, which is also equivalence relation.
- Option C โ Statement III is not an equivalence relation.
- Option D โ Less-than relation violates equivalence properties.
Used: Elimination
Application:
- Test each relation against reflexive, symmetric, and transitive conditions.
Final Logic:
- Only Statements I and II satisfy all equivalence requirements.
"Equivalence = RST (Reflexive, Symmetric, Transitive)"
5 Match the real-valued function to its maximum possible domain in R:
| List I | List II |
|---|---|
| 1. f(x) = 1/x | a. x โฅ 0 |
| 2. f(x) = โx | b. x > 0 |
| 3. f(x) = 1/(xยฒ - 1) | c. R - {0} |
| 4. f(x) = ln(x) | d. R - {-1, 1} |
Denominator cannot be zero Square root requires nonnegative input Logarithm requires positive input
For 1/x, x โ 0 โ c. For โx, x โฅ 0 โ a. For 1/(xยฒโ1), denominator cannot vanish, so x โ ยฑ1 โ d. For ln(x), x > 0 โ b. Thus matching is 1-c, 2-a, 3-d, 4-b, giving Option C.
- Option A โ Logarithm domain is not all reals except zero.
- Option B โ โx allows 0, so x โฅ 0 is correct domain.
- Option D โ 1/x does not require x โฅ 0 only.
Used: Elimination
Application:
- Apply standard domain restrictions for roots, logarithms, and rational functions.
Final Logic:
- Avoid zero denominators and invalid logarithm/root inputs.
"Root โฅ0, Log >0"
6 An EMI financial function maps loan tenure in years (x) to total interest percentage (y). If the function evaluates to y = 5x + 2, and the domain is {1, 2, 3, 4}, what is the maximum value in the range?
Substitute domain values in function Largest x gives largest y Maximum value equals 22
Evaluate y = 5x + 2 for x โ {1,2,3,4}: 7, 12, 17, 22. The largest value in the range is 22. Hence Option D is correct. Other options correspond to smaller outputs obtained from smaller domain values.
- Option A โ Corresponds to x = 2 only.
- Option B โ Corresponds to x = 3 only.
- Option C โ Corresponds to x = 1 only.
Used: Substitution
Application:
- Substitute all domain values and compare outputs.
Final Logic:
- Largest input gives maximum output here.
"Check all outputs for range"
7 Assertion (A): A relation where one x-value maps to two different y-values is a valid mathematical function.
Reason (R): Functions inherently allow multiple outputs for a single input to model complex trajectories.
Functions require unique output One input cannot have two outputs Reason contradicts function definition
A function assigns exactly one output to each input. Therefore a relation where one x-value maps to multiple y-values is not a function, making Assertion false. The Reason is also false because functions never allow multiple outputs for a single input. Hence Option A is correct.
- Option B โ Assertion is false, not true.
- Option C โ Both statements contradict the definition of function.
- Option D โ Reason is also mathematically incorrect.
Used: Extreme Word Filter
Application:
- Check whether the statements violate the uniqueness rule of functions.
Final Logic:
- Functions always assign exactly one image to each input.
"One input, one output only"
8 A real valued function generates sequence values 2, 6, 12, 20. The first difference between consecutive values generates a new analytical sequence. What is the 2-period moving average of the first two values of this new sequence?
First differences are 4, 6, 8 First two values are 4 and 6 Average equals 5
The first differences are: 6โ2 = 4, 12โ6 = 6, 20โ12 = 8. The first two values of the new sequence are 4 and 6. Their 2-period moving average is (4+6)/2 = 5. Therefore Option B is correct.
- Option A โ Sum of first two differences, not average.
- Option C โ Second difference value only.
- Option D โ First difference value only.
Used: Substitution
Application:
- Compute difference sequence first, then apply moving average formula.
Final Logic:
- (4+6)/2 = 5.
"Difference first, average next"
9 The graph of relation R is defined by the inequality xยฒ + yยฒ < 1. This means R analytically represents:
xยฒ+yยฒ=1 gives unit circle boundary Strict inequality means inside region Boundary excluded from graph
The equation xยฒ+yยฒ=1 represents the unit circle boundary. Since the inequality is xยฒ+yยฒ<1, all points strictly inside the circle are included while boundary points are excluded. Therefore Option C is correct. Options involving only boundary or exterior regions are incorrect.
- Option A โ Relation describes a region, not a standard function.
- Option B โ Boundary requires equality, not strict inequality.
- Option D โ Exterior region corresponds to xยฒ+yยฒ>1.
Used: Contextual/Tonal Matching
Application:
- Interpret inequality signs geometrically in coordinate plane.
Final Logic:
- "Less than" indicates interior of the circle.
"< means inside circle"
10 Match the mapping diagram scenarios to their rigorous relation properties:
| List I | List II |
|---|---|
| 1. Every x points to exactly one distinct y, and all y are covered. | a. Not a function |
| 2. Every x points to exactly one distinct y, but some y are not covered. | b. Many-one function |
| 3. Multiple x elements point to the same y. | c. Bijective function |
| 4. One x element points to multiple y elements. | d. Injective but not surjective |
Bijective means one-one and onto Injective may miss some outputs Multiple outputs violate function rule
Statement 1 describes bijection โ c. Statement 2 is injective but not surjective โ d. Statement 3 describes many-one mapping โ b. Statement 4 violates function definition because one input has multiple outputs โ a. Hence Option D is correct.
- Option A โ Incorrectly identifies bijection as not a function.
- Option B โ Many-one functions still remain valid functions.
- Option C โ Statement 2 is injective, not many-one.
Used: Option Grouping
Application:
- Match standard mapping behaviors with formal function classifications.
Final Logic:
- One-one and onto โ bijection; multiple outputs โ not a function.
"Bijective = one-one + onto"
11 For the family relation defined as "x is a descendant of y":
I. It is transitive.
II. It is not reflexive.
III. It is symmetric.
Descendant relation is transitive Nobody is own descendant Relation is not symmetric
The descendant relation is transitive because if x is a descendant of y and y is a descendant of z, then x is a descendant of z. It is not reflexive since no person is their own descendant. It is also not symmetric because descendant direction cannot reverse. Hence Option A is correct.
- Option B โ Ignores the correct non-reflexive property.
- Option C โ Symmetry does not hold for descendant relations.
- Option D โ Descendant relation is definitely not symmetric.
Used: Elimination
Application:
- Test descendant relation against standard relation properties individually.
Final Logic:
- Transitive and non-reflexive are valid; symmetry fails.
"Descendants move downward only"
12 The relation mapping is defined by the natural exponential function y = e^x. Find the integral of this function from 0 to ln(2).
Integral of e^x is e^x Apply upper and lower limits Result equals 2 โ 1 = 1
The required integral is: \(\int_{0}^{lnโก(2)}\,e^{x}โdx\) Since โซe^x dx = e^x, evaluate between limits: e^(ln2) โ e^0 = 2 โ 1 = 1. Therefore Option B is correct. Other options arise from incomplete evaluation or misunderstanding exponential integration.
- Option A โ Equals upper-limit exponential value only.
- Option C โ Incorrectly assumes upper limit equals 1.
- Option D โ Positive exponential function cannot give zero area here.
Used: Substitution
Application:
- Use standard exponential integration and substitute limits directly.
Final Logic:
- e^(ln2) โ 1 = 1.
"Integral of e^x stays e^x"
13 An ordered pair (a,b) is a vector in 2D. Under relation R, vector v maps to vector w such that w is the orthogonal projection of v onto the x-axis. What does the pair (4, 5) map to?
Projection on x-axis removes y-coordinate x-coordinate remains unchanged Result becomes (4,0)
Orthogonal projection onto the x-axis keeps the x-coordinate unchanged while making the y-coordinate zero. Therefore vector (4,5) maps to (4,0). Hence Option C is correct. Other options either preserve the wrong coordinate or incorrectly interchange components.
- Option A โ Represents projection onto y-axis instead.
- Option B โ Coordinates are incorrectly interchanged.
- Option D โ Zero vector occurs only when x-coordinate is also zero.
Used: Contextual/Tonal Matching
Application:
- Interpret geometric meaning of orthogonal projection directly.
Final Logic:
- Projection onto x-axis keeps x and removes y.
"x-axis projection kills y"
14 If aRb represents the set of points where a โฅ 0, b โฅ 0, and a + b โค 2, what is the area of the polygon formed by this restricted relation?
Region forms right triangle Base and height equal 2 Area = ยฝ ร 2 ร 2 = 2
The inequalities a โฅ 0, b โฅ 0, and a+b โค 2 form a triangular region bounded by coordinate axes and line a+b=2. The triangle has base 2 and height 2. Therefore area = (1/2)ร2ร2 = 2. Hence Option D is correct.
- Option A โ Uses incorrect dimensions for triangle.
- Option B โ Equals rectangle area, not triangular region.
- Option C โ Incorrect geometric calculation.
Used: Dimensional/Unit Analysis
Application:
- Interpret inequalities geometrically and apply area formula.
Final Logic:
- Right triangle area equals 2 square units.
"Half base ร height"
15
Bijective functions are invertible Inverse reverses ordered pairs uniquely Inverse remains bijective function
A bijective function is both one-one and onto, so its inverse exists as a valid function. Reversing ordered pairs preserves uniqueness and surjectivity. Therefore the inverse relation Rโปยน is also bijective. Hence Option A is correct. Other options contradict properties of invertible functions.
- Option B โ Inverse of bijection cannot be empty.
- Option C โ Bijective inverse preserves one-one property.
- Option D โ Inverse of bijective function is always a function.
Used: Contextual/Tonal Matching
Application:
- Use invertibility conditions stated directly in the passage.
Final Logic:
- Inverse of bijection remains bijection.
"Bijection โ Invertible"
16
Invertible functions must be bijective Onto property is compulsory Non-surjective functions lack inverse
The passage explicitly states that invertible functions must be both one-one and onto. If a function is not onto, some codomain elements have no preimage, making inverse impossible. Therefore Option B is correct. Other options ignore the surjectivity requirement or add irrelevant continuity conditions.
- Option A โ One-one alone is insufficient for invertibility.
- Option C โ Many-one functions cannot possess inverses.
- Option D โ Continuity is unrelated to basic invertibility condition here.
Used: Elimination
Application:
- Use the bijection condition directly from the passage.
Final Logic:
- Invertibility requires both injective and surjective properties.
"Inverse needs onto too"
17 Which analytical statement about the composition gof is incorrect?
Composition needs compatible mappings Range of f must fit domain of g Otherwise composition undefined
For composition gof to exist, outputs of f must belong to the domain of g. If the range of f does not intersect the domain of g, composition cannot be defined. Therefore Option C is incorrect. Other options correctly describe properties and operational meaning of composite functions.
- Option A โ Domain of gof originates from domain of f where composition exists.
- Option B โ Outputs of gof belong to codomain of g.
- Option D โ Function f acts first, then g on the result.
Used: Elimination
Application:
- Check whether composition requirements satisfy function compatibility.
Final Logic:
- Composition needs range(f) โ domain(g).
"Output of f enters g"
18 Arrange the algebraic steps to find the inverse of the function f(x) = 2x + 3:
1. Replace y with x, and x with fโปยน(x).
2. Set y = 2x + 3.
3. The final inverse is fโปยน(x) = (x - 3)/2.
4. Solve for x algebraically in terms of y: x = (y - 3)/2.
Begin with y = f(x) Solve algebraically for x Interchange variables finally
To find inverse: first write y = 2x+3. Then solve for x: x = (yโ3)/2. Next interchange variables to express inverse notation. Finally write: fโปยน(x) = (xโ3)/2. Hence correct order is 2 โ 4 โ 1 โ 3, making Option D correct.
- Option A โ Variable replacement occurs before solving algebraically.
- Option B โ Final inverse cannot appear before solving equation.
- Option C โ Starts from intermediate step without defining original function.
Used: Contextual/Tonal Matching
Application:
- Follow standard inverse-function derivation procedure step-by-step.
Final Logic:
- Define โ solve โ interchange โ conclude inverse.
"Write, solve, swap, finish"
19 In a network of computers, relation R represents "is connected to". If it strictly acts as an equivalence relation, what does a resulting equivalence class represent?
Equivalence classes partition sets All members are mutually related Connected subgroup forms one class
Equivalence classes contain elements mutually related under an equivalence relation. Therefore a class here represents a subgroup of computers all connected within that network component. Hence Option A is correct. Other options describe specific devices or incomplete structures rather than equivalence classes.
- Option B โ Equivalence classes are not defined by a central server.
- Option C โ Broken connections imply absence of relation.
- Option D โ One cable alone does not represent an entire equivalence class.
Used: Contextual/Tonal Matching
Application:
- Interpret equivalence classes through practical network grouping.
Final Logic:
- Equivalence classes form mutually connected groups.
"Same class = all connected"
20 Assertion (A): The relation "modulus of difference is a multiple of 4" on the set of integers is a valid equivalence relation.
Reason (R): Any relation mathematically based on the divisibility of a difference is only transitive, not reflexive.
Congruence modulo 4 is equivalence relation Difference divisibility gives reflexivity too Reason incorrectly denies reflexive property
The relation |aโb| divisible by 4 is equivalent to congruence modulo 4, which is reflexive, symmetric, and transitive. Hence Assertion is true. The Reason is false because divisibility-based difference relations are also reflexive since aโa=0 is divisible by 4. Therefore Option B is correct.
- Option A โ Assertion correctly describes equivalence relation.
- Option C โ Reason is mathematically incorrect.
- Option D โ Divisibility-based congruence relations are valid equivalence relations.
Used: Elimination
Application:
- Check reflexive, symmetric, and transitive conditions systematically.
Final Logic:
- Congruence modulo n always forms equivalence relation.
"Difference divisible โ congruence"
