Q1: Analyzing Injectivity, Surjectivity, and Inverse of a Discrete

Function:
Injectivity:
To determine if the function is injective, we need to check if distinct elements in the domain
map to distinct elements in the codomain. Let's consider two arbitrary odd integers, a and b,
such that f(a) = f(b).
If a and b are odd, then f(a) = a + 3 and f(b) = b + 3. Setting these equal, we get a + 3 = b +
3, which implies a = b. So, the function is injective for odd integers.
Now, if a and b are even, then f(a)=a−5 and f(b)=b−5. Setting these equal, we get a – 5 = b −
5, which implies a = b. So, the function is injective for even integers as well.
Therefore, the function is injective.
Surjectivity:
For surjectivity, we need to check if every element in the codomain has a pre-image in the
domain. Let's consider an arbitrary integer y in the codomain (Z).
If y is an odd integer, then f (y − 3) = (y − 3) + 3 = y, so there exists an odd integer n = y − 3
such that f(n) = y.
If y is an even integer, then f (y + 5) = (y + 5) – 5 = y, so there exists an even integer n = y + 5
such that f(n) = y.
Therefore, the function is surjective.
Inverse Function:
To find the inverse function, we need to swap the roles of the input and output. Let g :Z → Z
be the inverse function of f.
For odd integers g(y) = y − 3 because f (y − 3) = y.
For even integers g(y) = y + 5 because f (y + 5) = y.
{ y−3 if y is odd
Thus, the inverse function g is g( y )={ .
{ y +5 if y is even

Q2: Mapping Students to Marks and Marks to Grades

Let's consider three sets A, B, and C, each with three elements:
A={ a1 , a2 , a3 }
B= { b1 ,b 2 , b 3 }
C={c1 , c 2 , c 3 }
Now, let's define functions f : A → B∧g :B → C with the following mappings:
f ( a1 )=b1 , f ( a2 ) =b2 , f ( a3 ) =b3
g(b 1)=c 2 , g(b 2)=c3 , g(b 3)=c 1
Now, let's discuss the composition of functions fog∧gof :
Composition fog :
( fog ) ( a1 )=f ( g ( a1 ) ) =f ( c2 ) =b2

( fog ) ( a2 )=f ( g ( a2 ) ) =f ( c 3) =b 3
(fog)(a3)=f (g (a3 ))=f (c 1)=b 1
So, the mapping for fog is:
fog={(a1 , b2 ),(a2 , b3) ,(a3 ,b 1)}
Composition gof :
( gof ) ( b1 ) =g ( f ( b 1 ) )=g ( a1 )=c 2

( gof ) ( b2 ) =g ( f ( b 2 ) )=g ( a2 )=c3

(gof )(b3 )=g(f (b 3))=g(a3 )=c 1
So, the mapping for gof is:
gof ={(b 1 , c 2 ),(b2 , c3 ),(b3 , c 1)}
Now, let's address whether both fog and gof can be defined for the sets A, B, and C, and
whether they are equal:
 Existence: Both fog and gof are defined since the ranges and domains match
appropriately.
 Equality: They are not necessarily equal. In this case, fog and gof have different
mappings, and therefore, fog ≠ gof.
Proof of inequality:
fog(a1 )=b2 ≠ c 2=gof (b1 )

Q3: Mapping Students to Marks and Marks to Grades

Mappings:

 Mapping 1: Students to Marks

o f(Student) = Score
o Domain: {Ani, Leon, Linh, Liam, Abdul}
 o Range: {60, 75, 85, 95}
o Explicit Definition:
 f(Ani) = 75
 f(Leon) = 60
 f(Linh) = 85
 f(Liam) = 95
 f(Abdul) = 60
 Mapping 2: Marks to Grades
o g(Mark) = Grade
o Domain: {60, 75, 85, 95}
o Range: {B, C, B+, A}
o Explicit Definition:
 g(60) = C
 g(75) = B
 g(85) = B+
 g(95) = A

Composite Function:

 g ◦ f: Map a student to their grade through their score.

o g ◦ f(Student) = g(f(Student)) = g(Score) = Grade
o h(Ani) = g(f(Ani)) = g(75) = B

o h(Leon) = g(f(Leon)) = g(60) = C, h(Linh) = g(f(Linh)) = g(85) = B+,

h(Liam) = g(f(Liam)) = g(95) = A, h(Abdul) = g(f(Abdul)) = g(60) = C

Commutativity:

 No, the composition of functions g and f is not commutative. This means that g ◦ f
(Student to Grade through Score) is not the same as f ◦ g (Score to Student through
Grade).
o Reason: The ranges of both f and g are not equal to their domains. In other
words, not every possible grade maps back to a unique student or every
possible score maps back to a unique grade. For example, the grade "C"
corresponds to both Leon and Abdul, and the score "60" corresponds to both
Leon and Abdul. This ambiguity creates the non-commutativity.
Q4: Unveiling Sequence: Unraveling the Domino Line-Up!

Remember that line of dominoes you loved to knock down as a kid? Well, imagine those
dominoes lined up perfectly, one after the other, each holding a secret number. That's what a
sequence is – an ordered list of numbers waiting to be explored. Let's be sequence detectives
and crack the code!

1. The Recursive Riddle: Following the Domino Clues

Imagine a game where each domino tells you how to find the next one. That's a recursive
function! It's like a secret code where each clue leads to the next domino in the line. Like a
detective, you use the formula and the earlier dominoes to uncover the number on the next
one.

Case Study: The Fibonacci sequence, inspired by those multiplying rabbits, starts with 1, 1.
Its secret code is:

 Domino 1: 1
 Domino n (after 1): Domino n = Domino (n-1) + Domino (n-2)

So, Domino 3 = Domino 2 + Domino 1 = 1 + 1 = 2, and the sequence unfolds.

2. Cracking the Code: The Master Key Formula

Wouldn't it be cool to have a master key that unlocks any domino in the line, instead of
chasing clues each time? That's what a closed formula does! It's like a magic equation that
tells you exactly what number is on any domino, no matter its position.

Example: For the Fibonacci sequence, the master key is:

 Domino n = [(1 + √5)^n - (1 - √5)^n] / (2^n * √5)

Now you can find any domino's number in a flash! Want to know what's on Domino 10? Plug
n = 10, and boom, you have the answer!

3. Arithmetic Adventures: Adding Your Way Through

Think of a seesaw where each domino adds or subtracts the same amount to reach the next
one. That's an arithmetic sequence! It's like climbing stairs, where each step is the same size.
The difference between any two dominoes is always constant.

Example: The sequence 3, 6, 9, 12... is arithmetic, with a constant difference of 3. Each

domino is 3 more than the one before it.

4. Geometric Journeys: Multiplying Your Way Around

Now, imagine each domino is multiplied by a specific number to reach the next one. That's a
geometric sequence! It's like comparing the sizes of different gears – the ratio between their
teeth stays the same.

Example: The sequence 2, 6, 18, 54... is geometric, with a constant ratio of 3. Each domino
is 3 times bigger than the one before it.

Q5:

i)

In order to generate a closed formula for the given sequence (5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12,
12 ….), I observed a pattern in which the sequence alternates between increasing by 1 and
repeating the previous term every three terms.

The closed formula I derived is f ( n )=5+

2n
+
2
3 3 √3
sin
2 πn
3 ( )
, where n represents the term

number starting from n =1.

Breaking down the formula:

1. The first term is a constant 55, representing the initial value.

2n
2. The second term is a linear term , indicating an increase by 1 every three terms.
3

2 2 πn
3. The third term is a periodic term sin ⁡( ) which has value
3 √3 3
1 1
,− , 0 forn=1 , 2 ,3
3 3
Applying this formula, the next four terms of the sequence are:
 f ( 13 )=13
 f ( 14 )=14
 f ( 15 )=14
 f (16)=15

ii)

The sequence is like, 6, 36, 216, ... and so on. To find the next three terms, we just keep
multiplying by 6. So, the next terms are 1296, 7776, and 46656.

As for a formula, it looks like each term is just 6 raised to the power of one less than its
position. So, the formula is 6^(n-1).

And for the sum of the first n terms, there's a formula for geometric series which is (a * (1 -
r^n)) / (1 - r), where 'a' is the first term and 'r' is the common ratio. In our case, it simplifies to
(6 * (1 - 6^n)) / -5.

So, in summary: Next three terms: 1296, 7776, 46656 Formula for nth term: 6^(n-1) Sum of
first n terms: (6 * (1 - 6^n)) / -5

Let's apply this formula to find the terms:

1. Term 1296 (4th term):

(4−1) 3
a 4=6 × 6 =6 × 6 =6 ×216=1296

2. Term 7776 (5th term):

(5−1) 4
a 5=6 ×6 =6 × 6 =6 ×1296=7776

3. Term 46656 (6th term):

(6−1) 5
a 6=6 ×6 =6 ×6 =6 ×7776=46656

iii)

Let's break down the solution for the series 21+24+27+….

Next three terms: To find the next three terms, we observe that each term is obtained by
adding 3 to the previous term. So, the next three terms are 30, 33, and 36.
Closed formula: Since each term is increasing by 3, the closed formula would be

¿ where (a n) is the nth term.

Sum to the first n terms: The sum of the first n terms of an arithmetic series is given by
n
Sn= × [ 2 a1 + ( n−1 ) d ] is the first term and (d) is the common difference. In this case,
2
a 1=21∧d =3.

So, the sum formula becomes:

n
Sn= ×[2 ×21+(n−1)×3]
2

This can be simplified further to

n
Now, the student-friendly version: Sn= ×[42+ 3 n−3]
2

Next three terms: 30, 33, 36

Closed formula: a n=21+3 × ( n−1 )

n
Sum to the first n terms: Sn= ×[42+ 3 n−3]
2

References:

 Levin, O. (2021). Discrete mathematics: An open introduction (3rd ed.). licensed

under CC 4.0

 Study.com. (n.d.). Injections, Surjections & Bijections: Definitions & Examples.

Retrieved from https://study.com/academy/lesson/injections-surjections-

bijections.html