INTRODUCTION TO MATHEMATICAL METHODS TEST ONE JAN INTAKE 2024
DATE : 4th March, 2024
DURATION: 2 HOURS
INSTRUCTIONS:
1. There are TWO questions in this Test paper.
2. Answer ALL the questions.
3. Full credit will only be given if all the working is shown. Answers alone whether correct or wrong, without any working shown, will earn a zero mark.
4. Indicate the question attempted CLEARLY
Question One
a) Define the following terms
i. An Infinite set [2]
ii. An Identity element [2]
iii. Bijective function [2]
Answer:
- Infinite set: A set with an unlimited number of elements (e.g., , ).
- Identity element: For a binary operation on set , an element such that for all .
- Bijective function: A function that is both injective (one-to-one) and surjective (onto).
OR
Answer:
- Infinite set: A set that is not finite, meaning its elements cannot be put into a one-to-one correspondence with a finite subset of natural numbers. Example: .
- Identity element: For a binary operation on a set , an element such that for all , Example: For addition on , since .
- Bijective function: A function that is both injective (one-to-one) and surjective (onto). That is, every element in the codomain is mapped to by exactly one element in the domain.
b) For each binary operation, find an identity element.
i. On , define by [2]
ii. A binary operation on is defined by [2]
Answer:
i. Let be the identity element. Then:
Solve:
For this to hold for all , .
Verify: .
Identity element is
ii. Let
Solve:
Subtract
Identity element is
c) Show that the cardinality of the power set of the power set of
Answer:
- Let
.A = { a } A = \{a\} - Power set of
,A A .P ( A ) = { ∅ , { a } } \mathcal{P}(A) = \{ \emptyset, \{a\} \} - Power set of
,P ( A ) \mathcal{P}(A) .P ( P ( A ) ) = P ( { ∅ , { a } } ) \mathcal{P}(\mathcal{P}(A)) = \mathcal{P}\left( \{ \emptyset, \{a\} \} \right) - Elements:
- Cardinality:
.4 4
d) Suppose that a group of 70 patients are surveyed and asked which disease they have suffered most. There are three diseases in our survey; one for Malaria, one for Cholera, and one for Asthma.40 patients suffered from malaria; 20 patients suffered from cholera; 9 atients suffered from Asthma; 11 patients suffered from Malaria and Asthma; 9 patients suffered from Cholera and Asthma; 15 patients suffered from Malaria and Cholera and 5 patients suffered from all three diseases.
- Malaria (M): 40
- Cholera (C): 20
- Asthma (A): 9
- M and A: 11
- C and A: 9
- M and C: 15
- All three: 5
(i) How many patients did not suffer from any of these diseases? [3]
(ii) How many patients suffered from Cholera AND Malaria BUT NOT Asthma? [3]
Answer:
Use the inclusion-exclusion principle.
- Total patients = 70.
- Patients with at least one disease:
-
(i) No disease:
.70 − 39 = 31 70 - 39 = \boxed{31} -
(ii) Cholera and Malaria but not Asthma:
e) Let
(i) Show that
(ii) Sketch the graph of
Answer:
(i)
: Sincef ( − 4 ) f(-4) , use− 4 ≤ − 2 -4 \leq -2 :3 x + 1 3x + 1
: Sincef ( 6 ) f(6) , use6 > 2 6 > 2 :1 − 2 x 1 - 2x
Thus,
(ii) Graph of
- Description:
- For
: Linex ≤ − 2 x \leq -2 (passes throughy = 3 x + 1 y = 3x + 1 ,( − 2 , − 5 ) (-2, -5) ).( − 4 , − 11 ) (-4, -11) - For
: Parabola− 2 < x ≤ 2 -2 < x \leq 2 (vertex aty = x 2 − 1 y = x^2 - 1 , endpoints at( 0 , − 1 ) (0, -1) ,( − 2 , 3 ) (-2, 3) ).( 2 , 3 ) (2, 3) - For
: Linex > 2 x > 2 (passes throughy = 1 − 2 x y = 1 - 2x ,( 2 , − 3 ) (2, -3) , etc.).( 3 , − 5 ) (3, -5)
- For
Question Two
a) Define the following
i. Surjective function [2]
ii. Singleton set [2]
iii. Equivalence relation [2]
Answer:
- Surjective function: A function
where every element off : A → B f: A \to B is mapped to by at least one element inB B (i.e.,A A ).range ( f ) = B \text{range}(f) = B - Singleton set: A set with exactly one element (e.g.,
).{ 5 } \{5\} - Equivalence relation: A relation that is reflexive, symmetric, and transitive.
b) Determine the domain and range of
Answer:
-
Domain:
requires2 x + 3 \sqrt{2x+3} .2 x + 3 ≥ 0 ⟹ x ≥ − 3 2 2x + 3 \geq 0 \implies x \geq -\frac{3}{2} - Denominator
.5 x − 3 ≠ 0 ⟹ x ≠ 3 5 5x - 3 \neq 0 \implies x \neq \frac{3}{5} - Domain:
.[ − 3 2 , 3 5 ) ∪ ( 3 5 , ∞ ) \left[-\frac{3}{2}, \frac{3}{5}\right) \cup \left(\frac{3}{5}, \infty\right)
-
Range:
- As
,x → ∞ x \to \infty .f ( x ) → 0 f(x) \to 0 - As
,x → 3 5 + x \to \frac{3}{5}^+ ; asf ( x ) → − ∞ f(x) \to -\infty ,x → 3 5 − x \to \frac{3}{5}^- .f ( x ) → + ∞ f(x) \to +\infty - Minimum value: At
,x = − 3 2 x = -\frac{3}{2} .f ( x ) = 0 f(x) = 0 - Range:
? Correction: Since numerator is always non-negative and denominator changes sign, range is( − ∞ , 0 ] ∪ ( 0 , ∞ ) = R ∖ { 0 } (-\infty, 0] \cup (0, \infty) = \mathbb{R} \setminus \{0\} , but verify:( − ∞ , 0 ) ∪ [ 0 , ∞ ) = R (-\infty, 0) \cup [0, \infty) = \mathbb{R} - For
,x > 3 5 x > \frac{3}{5} .f ( x ) > 0 f(x) > 0 - For
,− 3 2 ≤ x < 3 5 -\frac{3}{2} \leq x < \frac{3}{5} .f ( x ) ≤ 0 f(x) \leq 0
- For
- Range:
(all real numbers).R \mathbb{R}
- As
-
Graph:
- Key points:
- Vertical asymptote at
.x = 3 5 x = \frac{3}{5} - Horizontal asymptote at
.y = 0 y = 0 - Root at
.x = − 3 2 x = -\frac{3}{2}
- Vertical asymptote at
- Key points:
c) Prove
Answer:
- One-to-one proof: Assume
:f ( a ) = f ( b ) f(a) = f(b)
Cross-multiply:
Thus, injective.
- Inverse: Solve
fory = 2 x + 1 3 x + 2 y = \frac{2x+1}{3x+2} :x x
So,
OR
Answer:
To prove that the function
is one-to-one, and then find its inverse, we’ll follow these steps:
✅ Part 1: Prove that f ( x ) f(x) is one-to-one
A function is one-to-one if different inputs always produce different outputs. Mathematically, this means:
If
, then f ( a ) = f ( b ) f(a) = f(b) a = b a = b
Let’s assume:
Cross-multiply:
Expand both sides:
Left side:
Right side:
Now equate:
Subtract
Rearrange:
✅ Therefore,
🔄 Part 2: Find the inverse of f ( x ) f(x)
Let
We solve for
Multiply both sides by
Expand:
Group terms with
Factor out
Solve for
So the inverse function is:
✅ Final Answer:
- One-to-one proof: Shown using algebraic equality.
- Inverse function:
d) Let
Verify
Answer:
(common element).A ∩ B = { 7 } A \cap B = \{7\} .( A ∩ B ) ′ = U ∖ { 7 } = { 1 , 2 , 3 , 4 , 5 , 6 , 8 , 9 , 10 , 11 } (A \cap B)' = U \setminus \{7\} = \{1,2,3,4,5,6,8,9,10,11\} .A ′ = U ∖ A = { 1 , 3 , 5 , 6 , 8 , 9 , 10 , 11 } A' = U \setminus A = \{1,3,5,6,8,9,10,11\} .B ′ = U ∖ B = { 1 , 2 , 4 , 6 , 8 , 10 } B' = U \setminus B = \{1,2,4,6,8,10\} .A ′ ∪ B ′ = { 1 , 2 , 3 , 4 , 5 , 6 , 8 , 9 , 10 , 11 } A' \cup B' = \{1,2,3,4,5,6,8,9,10,11\}
Both sides equal, so verified.
e) Let
Answer:
Prove
- Show
:B ⊆ C B \subseteq C
Let .x ∈ B x \in B - Case 1:
. Thenx ∈ A x \in A , sox ∈ A ∩ B = A ∩ C x \in A \cap B = A \cap C .x ∈ C x \in C - Case 2:
. Sincex ∉ A x \notin A ,x ∈ B x \in B . Asx ∈ A ∪ B = A ∪ C x \in A \cup B = A \cup C ,x ∉ A x \notin A .x ∈ C x \in C
- Case 1:
- Show
:C ⊆ B C \subseteq B
Let .x ∈ C x \in C - Case 1:
. Thenx ∈ A x \in A , sox ∈ A ∩ C = A ∩ B x \in A \cap C = A \cap B .x ∈ B x \in B - Case 2:
. Sincex ∉ A x \notin A ,x ∈ C x \in C . Asx ∈ A ∪ C = A ∪ B x \in A \cup C = A \cup B ,x ∉ A x \notin A .x ∈ B x \in B
Thus, .B = C B = C
- Case 1:
@Dr. Microbiota