0% found this document useful (0 votes)
36 views9 pages

MATH 1302 - Unit 2 Written Assignment

Uploaded by

Reg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
36 views9 pages

MATH 1302 - Unit 2 Written Assignment

Uploaded by

Reg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

1.

For the function f:Z→Z, defined as:

{
f ( n )= n+ 3if nis odd
n−5 if nis even

Injective Check (One-to-One): A function is injective if


every element in the domain maps to a unique element in
the codomain.
 For odd n1and n2, if f (n 1)=f (n 2), thenn 1+3=n 2+ 3, which
implies n1=n2 . So, the function is injective for odd
numbers.
 For even n1 and n2, if f (n 1)=f (n 2), thenn 1−5=n 2−5, implying
n1=n2 . So, it’s also injective for even numbers.
However, if we check cross-mapping between odd and
even values, since f (n) behaves differently for odd and even
values, there is no overlap between the values. Hence, the
function is injective.
Surjective Check (Onto): A function is surjective if every
element in the codomain has a preimage in the domain.
 For any even n, the preimage is n+5.
 For any odd n, the preimage is n−3.
Thus, the function covers all integers in Z, making it
surjective.
Inverse Function: The inverse function f−1(n) can be
defined as:

{
f ( n )= n−3if nis odd
n+5 if n is even

Since f is both injective and surjective, it has an inverse.


2. Let’s define three sets A, B, and C as follows:
 A={a1,a2,a3}
 B={b1,b2,b3}
 C={c1,c2,c3}
Define function f:A→B as:
f(a1)=b1,f(a2)=b2,f(a3)=b3
Define function g:B→C as:
g(b1)=c1,g(b2)=c2,g(b3)=c3
Now consider the composition g∘f (fog):
g(f(a1))=g(b1)=c1, g(f(a2))=g(b2)=c2, g(f(a3))=g(b3)=c3
Thus, g∘f:A→C is defined as:
g∘f(a1)=c1,g∘f(a2)=c2,g∘f(a3)=c3
For f∘g(gof), since f:A→B and g:B→C, we cannot define
f∘g because f maps elements from B to C, and f expects
elements from A (which isn't possible here). So, f∘g is
undefined.
Thus, only g∘f is valid, and f∘g is not. Therefore, fog and
gof are not equal.

3. We have:
 Students: S={ Ani , Leon , Linh , Liam , Abdul }
 Scores: M ={75 ,60 , 85 , 95 }
 Grades: G={B,C,B+,A}
Define two functions:
 f:S→M mapping students to their scores
 g:M→G mapping scores to grades
Now, define f as:
f ( Ani )=75 , f ( Leon )=60 , f ( Linh )=85 , f ( Liam )=95 , f ( Abdul )=60

Define g as:
g(75)=B , g(60)=C , g (85)=B+, g (95)= A

Now, the composition g∘f is:


g(f ( Ani))=g(75)=B , g (f (Leon))=g (60)=C , …

Commutativity Check: g∘f maps from students to grades,


but f∘g cannot be defined, since f operates on students and
g operates on scores. Hence, the composition is not
commutative.
4. Sequence:
A sequence is an ordered list of numbers following a
specific pattern or rule. Each number in the sequence is
called a "term." Sequences can be finite or infinite. They
are used in many areas of mathematics, especially in
algebra and calculus, and have applications in computer
science, physics, and finance.
 Example: Consider the sequence
2 , 4 , 6 , 8,102 , 4 ,6 , 8 , 10 2 , 4 , 6 , 8 ,10 . Each term is increasing by

2.
2. Recursive Function:
A recursive function is a function that is defined in terms of
itself. To find a term in a sequence, we often use the value
of the previous terms to generate the next one. Recursive
formulas specify how to compute each term from its
predecessor.
 Example: In the Fibonacci sequence,
F (n)=F (n−1)+ F (n−2) , where F (0)=0∧F (1)=1 .

3. Closed Formula for the Sequence:


A closed formula expresses the n−th term of a sequence
without referring to other terms. It is a direct expression
that allows us to find any term in the sequence without
needing to compute all previous terms.
 Example: For the sequence 2,4,6,8,102, 4, 6, 8,
102,4,6,8,10, the closed formula is an=2n, where n is
the position in the sequence.
4. Arithmetic Sequence:
An arithmetic sequence is a sequence of numbers in which
the difference between consecutive terms is constant. This
difference is called the "common difference."
 Example: 3,7,11,15,… where the common difference
is 4.
The closed formula for an arithmetic sequence is an=a1+
(n−1)⋅d, where a1 is the first term and d is the common
difference.
5. Geometric Sequence:
A geometric sequence is a sequence of numbers where each
term after the first is found by multiplying the previous
term by a fixed, non-zero number called the "common
ratio."
Example: 5,10,20,40,… where the common ratio is 2.
The closed formula for a geometric sequence is an=a1⋅r(n−1),

where a1 is the first term and r is the common ratio.


5.
i. Sequence: 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 12...
This sequence alternates between increasing by 1 and
repeating a value. To break it down:
 Odd-indexed positions increase by 1:
5,6,7,8,9,10,11,12,…
 Even-indexed positions repeat the previous value:
6,6,8,8,10,10,12,12,…
To generate the closed formula, we need two rules:
n−1
 For odd n :a =5+
n
2 (increases by 1 starting from
5)
n−2
 For even n :a =5+
n
2 (same as the previous odd
term)
Next four terms:
Using the closed formula:
13−1
 a13=13th term =13thoddterm=5+ 2
=11

 a14=14th term =13 (repeats previous)


15−1
 a15=5+ 2
=12

 a16=12 (repeats previous)


So, the next four terms are: 11, 11, 12, 12.

ii. Series: 6+36+216+…6 + 36 + 216 + \


dots6+36+216+…
This is a geometric sequence, where:
 First term a1=6
 Common ratio r=6 (since 36/6=6)
Next three terms:
Using the geometric formula an=a1⋅r(n−1):
 a4=6⋅63=6⋅216=129
 a5=6⋅64=6⋅1296=7776
 a6=6⋅65=6⋅7776=46656
So, the next three terms are: 1296, 7776, 46656.

Closed Formula
The closed formula for the ( n )-th term of a geometric
series is given by:
an=a1⋅r(n−1)
where:
 ( an ) is the ( n )-th term,
 ( a1 ) is the first term (6),
 ( r ) is the common ratio (6).
Thus, the formula for this series is:
an=6⋅6(n−1)
or simplified:
an=6n

Sum to the first n terms:


The sum Sn of the first n terms of a geometric
sequence is given by:
a 1 ( r n−1 )
sn=
r −1

Substitute a1=6, r=6, and n:


6 ( 6 n−1 ) 6 ( 6 n−1 )
sn= =
6−1 5
iii. Series: 21+24+27+…
This is an arithmetic sequence where:
 First term a1=21
 Common difference d=3 (since 24−21=3 and
27−24=3)
Next three terms:
Using the arithmetic formula an=a1+(n−1)⋅d:
 a4=21+(4−1)⋅3=21+9=30
 a5=21+(5−1)⋅3=21+12=33
 a6=21+(6−1)⋅3=21+15=36
So, the next three terms are: 30, 33, 36.
Closed Formula
The closed formula for the ( n )-th term of an
arithmetic series is given by:
an=a1+(n−1)d
where:
 ( an ) is the ( n )-th term,
 ( a1 ) is the first term (21),
 ( d ) is the common difference (3).
Thus, the formula for this series is:
an=21+(n−1)⋅3
or simplified:
an=21+3(n−1)

Sum of the First ( n ) Terms


The sum ( S_n ) of the first ( n ) terms of an arithmetic
series can be calculated using the formula:
n
Sn =
2
( 2 a1 + ( n−1 ) d )

Substituting the values:


 ( a1 = 21 )
 (d=3)
The sum formula becomes:
n
Sn= ( 2.21+ ( n−1 ) 3 )
2
n
Sn= ( 42+3 n−3 )
2
n
Sn= ( 39+3 n )
2
3 n(n+13)
Sn =
2

So, the sum of the first ( n ) terms is:


3 n(n+13)
Sn =
2

You might also like