You are on page 1of 31

i-Link College of Science and Technology, Inc Pre-Calculus

MODULE 1: Series and Mathematical Induction

Module Overview:

This module contains topics such as series and mathematical induction and the Binomial
Theorem wherein you are going to solve patterns that will help you develop your critical thinking
skills. This module also contains examples with solutions that serve as your guide in solving
different problems more on expanding binomials and sigma notation.

At the end of this module, the learners are expected to demonstrate understanding of
the key concepts of series and mathematical induction and the Binomial Theorem.

Module Outline:

1.1 Introduction to Conic Sections, and Circle


1.2 Parabola
1.3 Ellipse
1.4 Hyperbola

Target Learning Competencies:

LC 2.1.a. Illustrate a series.


LC 2.1.b. Differentiate a series from a sequence.
LC 2.2.a. Use a sigma notation to represent a series.
LC 2.3.a. Illustrate the Principle of Mathematical Induction.

LC 2.3.b. Apply mathematical induction in proving identities.

LC 2.3.c. Illustrate Pascal’s Triangle in the expansion of ( x + y )n for small positive


integral values of n .

LC 2.4.a. Prove the Binomial Theorem.

LC 2.4.b. Determine any term of ( x + y )n, where is a positive integer, without expanding.

LC 2.4.c. Solve problems using mathematical induction and the Binomial Theorem
Performance Standard:
The learners shall be able to Keenly observe and investigate patterns, and formulate
appropriate mathematical statements and prove them using mathematical induction and/or
Binomial Theorem.

Page 1 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

BUDGET OF WORK

WEE LEARNING
MOST ESSENTIAL LESSON TITLE LESSON
K TOPICS NUMBER ASSESSMENT
1 Conic Sections Systems of Nonlinear 1 Assessment
Equations 1.1
2 Series and Sequences and 2 Assessment
Mathematical Induction Series, and Sigma 1.2
Notation
3 Series and Principle of 3 Assessment
Mathematical Induction Mathematical 1.3
Induction
4 Series and The Binomial 4 Assessment
Mathematical Induction Theorem 1.4

Page 2 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

LESSON 1: Systems of Nonlinear Equations

Lesson Objectives:

At the end of this lesson, the leaners will have been able to:

a. illustrate the different types of conic sections: parabola, ellipse, circle,


hyperbola, and degenerate cases;
b. determine the standard form of equation of a circle; and
c. graph a circle in a rectangular coordinate system.

Identifying the Conic Section by Inspection

Some terms may vanish, depending on the kind of conic section.

1. Circle: both x 2 and y 2 appear, and their coefficients are the same.

2 2
A x + A y +Cx+ Dy+ E=0

Example: 18 x 2+18 y 2−24 x+ 48 y−5=0

Degenerate cases: a point, and the empty set

2. Parabola: exactly one of x 2or y 2 appears.

A x 2+Cx + Dy+ E=0 ¿, opens upward or downward)

2
B y +Cx + Dy+ E=0 ¿, opens to the right or left)

Examples: 3 x 2−12 x +2 y +26=0 (opens downward)

2
−2 y + 3 x +12 y−15=0 (Opens to the right)

3. Ellipse: both x 2and y 2 appear, and their coefficients A and B have the same sign
and are unequal.

Page 3 of 31
i-Link College of Science and Technology, Inc Pre-Calculus
2 2
Examples: 2 x +5 y +8 x−10 y−7=0 (horizontal major axis)

2 2
4 x + y −16 x −6 y+ 21=0 (Vertical major axis)

If A = B, we will classify the conic as a circle, instead of an ellipse.

Degenerate cases: a point, and the empty set

4. Hyperbola: both x 2 and y 2 appear, and their coefficients A and B have different
signs

Examples: 5 x 2−3 y 2−20 x−18 y −22=0 (horizontal transverse axis)

−4 x 2+ y 2 +24 x + 4 y−36=0 (Vertical transverse axis)

Degenerate case: two intersecting lines

Solving Systems of Equations Using Substitution

Three Methods:

1. Substitution
2. Elimination
3. Graphical

We begin our extension with a system involving one linear equation and one quadratic
equation. In this case, it is always possible to use substitution by solving the linear equation for
one of the variables.
Example 1. Solve the following system, and sketch the graphs in one Cartesian plane.

{2 x−y −1=x
y+ 4=0
2

Solution: We solve for y in terms of x in the first equation, and substitute this expression to the second
equation.

2 x− y +4=0 ⟹ y=2 x +4

Substitute y=2 x +4 to the second equation

y−1=x 2
( 2 x+ 4 )−1=x 2

Page 4 of 31
i-Link College of Science and Technology, Inc Pre-Calculus
2
x −2 x−3=0
(x +1)¿

Solve for x :
x +1=0
x=−1
x−3=0
x=3
Substitute the value of x in any of the equation
x=−1
y=2 x +4
y=2 (−1 ) −2
y=2
x=3
y=2 x +4
y=2 ( 3 ) + 4
y=10
Graph:

Page 5 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Solving Systems of Equations Using Elimination

Elimination method is also useful in systems of nonlinear equations. Sometimes, some


systems need both techniques (substitution and elimination) to solve them.

Example 1. Solve the following system:

{ y 2−4 x−6 y=11


3−4 x= y 2−6 y

Solution: Eliminate the variable x by adding the equations

3−4 x= y 2−6 y ⟹ y 2 +4 x−6 y=3

2
y −4 x−6 y=11
2
y +4 x −6 y=3
2
2 y 12 y 14
− =
2 2 2

y 2−6 y =7

y 2−6 y −7=0⇒ ( y−7 )( y +1 )=0

y−7=0

y=7

y +1=0

y=−1

Substitute the value of y in any of the equation

y=7

3−4 x=¿

−4 x=49−42−3

Page 6 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

−4 x 4
=
−4 −4

x=−1

y=−1

3−4 x= (−1 )2−6(−1)

−4 x=1+6−3

−4 x 4
=
−4 −4

x=−1

Graph:

Activity Sheet 2.1

Direction: Identify the following equations whether a circle, parabola, ellipse or hyperbola.

1. 5 x 2−3 y 2+10 x−12 y=22

2. 2 y 2−5 x−12 y =17


Page 7 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

3. 3 x2 +3 y 2 +42 x−12 y=−154

4. 3 x 2+6 x +4 y=18

5. 7 x 2+ 3 y 2 +14 x +12 y=−14

6. −4 x 2+3 y 2 +24 x−12 y=36

7. 5 x 2+7 y 2 −40 x−28 y=−73

8. 5 y 2+ 2 x−30 y =−49

9. 3 x 2−3 y 2+12 x−12 y=5

10. 3 x 2+3 y 2 +12 x+12 y=4

11. 2 x2 +24 x −5 y =57

12. x 2+ y 2=30

13. −x 2+ 10 x + y−21=0

14.−2 y 2 + x−20 y−49=0

15. x 2+ 2 x + y−1=0

16. x 2+ y 2+ 6 x −2 y +9=0

17. x 2− y 2−2 x−8=0

18. 3 x 2+30 x + y +79=0

19. −9 x 2+ y 2−72 x −153=0

20.− y 2 + x+ 8 y−17=0

Assessment 2.1

Direction: Solve the system, and graph the curves in one Cartesian plane showing the point(s)
of intersection.

Page 8 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

{
x2 + y 2=25
2 2
1. x y
+
18 32

2.
{ ( x−1 )2+ ( y−3 )2=10
2 2
x + ( y−1 ) =5

3.
{ ( x−3 )2 + ( y−5 )2=10
2
x 2+ ( y +1 ) =25

LESSON 2: Series and Sequence, and Sigma Notation

Specific Objectives:

At the end of this lesson, the leaners will have been able to:
a. illustrate a series;

b. differentiate a series from a sequence; and

c. use the sigma notation to represent a series.

Sequences and Series

Definition:

 A sequence is a function whose domain is the set of positive integers or the set
{1 , 2 ,3 , … , n }.
Example:
a. 1,2,3,4,5
b. 1,2,4,8,16
 A series represents the sum of the terms of a sequence.
Example:
a. 1+2+3+ 4+5
b. 1+2+4 +8+16

Page 9 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Sigma Notation

 Writing and Evaluating Sums in Sigma Notation


Let f (i) be an expression involving an integeri . The expression
f ( m) + f ( m+1 ) + f ( m+ 2 )+ …+f (n)

can be compactly written in sigma notation, and we write it as

∑ f (i),
i=m

which is read as “the summation of f (i) from i = m to n .” Here, and n are integers with
m ≤n , f (i) is a term (or summand) of the summation, and the letter i is the index, m the lower
bound, and n the upper bound.

Example: Expand each summation, and simplify if possible.

4
1. ∑ ( 2i+3 )
i=2

Solution: we apply the definition of sigma notation

∑ (2 i +3 )= [2 ( 2 ) +3 ]+ {2 ( 3 ) +3 ]+ [2 ( 4 ) +3 ] =27
i=2

5
2. ∑ 2
i

i=0

Solution:

∑ 2i =20 +21+ 22+23 +2 4 +25=1+2+ 4+8+16 +32=63


i=0

n
3. ∑ ai
n

Solution:

n
. ∑ ai =a1 +a 2+ a3 +a 4+ …+a n
i=1

 Properties of Sigma Notation

n
n ( n+1 ) Page 10 of 31
1. ∑ i=
i=1 2
i-Link College of Science and Technology, Inc Pre-Calculus

n n n
5. ∑ [ f ( i ) + g (i ) ] =∑ f ( i ) + ∑ g(i)
i=m i=m i=m

|
30
Example 1: ∑ (4 i−5)
i=1

30 30 30

∑ ( 4 i−5 )=∑ 4 i−∑ 5 Property #3


i=1 i=1 i=1

30 30
¿ 4 ∑ i−∑ 5
i=1 i=1 Property #2
( 30 )( 31 ) Property #1 &
¿4 −5 ( 30 )
2
Property #4
¿ 1710
Answer

Solution:

n n n Property #3 & #2
∑ (1+2 j ) =∑ 1+2 ∑ j
j=1 j=1 j=1

[ ]
n ( n+1 ) Property #1 & #4
¿ n(1)+2
2
Simplify
2 ( n2 +n )
¿ n+
2
2
¿ n+n + n
2
¿ n +2 n

|
n
Example 2: ∑ (1+2 j)
j=1

Activity Sheet 2.2

Directions: Write SEQ if the given item is a sequence, and write SER if it is a series. Use the
answer sheet provided at the last part of this module.

Page 11 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

1. 1 ,2 , 4 , 8 , … 6. 1+0.1+0.001+0.0001

2. 2 , 8 ,10 , 18,… 7. 4 +9+14 +…+64

3. 1+1−1+1−1 8.10+2+0.4 +0.08+…

1 2 3 4 9.√ 2 , √3 , √ 4 , √ 5 , …
4. , , , ,…
2 3 4 5
10. 0.1 , 0.01 ,0.001 , 0.0001 ,0.00001 , …
2 3 4
5. 1+2+2 +2 +2 +¿

Assessment 2.2

A. Expand each summation, and simplify if possible.

5
1. ∑ (2−3 i)
i=1

n
2. ∑ x
j

j =1

B. Use the properties of sigma notation to evaluate the following summations.

50
1. ∑ ( 2−3 i )
i=1

30
2. ∑ ( 1+2 j )
j =1

LESSON 3: Principle of Mathematical Induction

Specific Objectives:
Page 12 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

At the end of this lesson, the leaners will have been able to:

a. illustrate the Principle of Mathematical Induction, and

b. apply mathematical induction in proving identities.

 Proving Summation Identities

The Principle of Mathematical Induction

Let P ¿) be a property or statement about an integer n . Suppose that the following conditions
can be proven:

(1¿ P(n 0) is true (that is, the statement is true whenn=n0).


(2) If P( k) is true for some integerk ≥ n0 , then P(k+ 1) is true (that is, if the statement is true
forn=k , then it is also true forn=k +1 ¿ .

Then the statement P(n)is true for all integers n ≥ n0 .

Example: Using mathematical induction, prove that

n ( n+1 )
1+2+3+…+ n=
2

Solution: We need to establish the two conditions stated in the Principle of Mathematical
Induction.
Part 1. Prove that the identity is true for n=1.
The left-hand side of the equation consists of one term equal to 1. The right-hand side
becomes
1 ( 1+1 ) 2
= =1
2 2
Hence, the formula is true forn=1.
Part 2. Assume that the formula is true for n=k ≥1 :
k ( k +1 )
1+2+3+…+ k=
2
We want to show that the formula is true for n = k + 1; that is,
( k +1 ) [ ( k +1 )+ 1 ]
1+2+3+…+ k + ( k +1 )=
2
Page 13 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Using the formula for n = k and adding k + 1 to both sides of the equation, we get

k ( k +1 )
1+2+3+…+ k + ( k +1 )= + ( k +1 )
2

k ( k +1 ) +2 ( k +1 )
¿
2

( k +1 ) ( k +2 )
¿
2

( k +1 ) [ ( k +1 ) +1 ]
¿
2

We have proven the two conditions required by the Principle of Mathematical Induction.
Therefore, the formula is true for all positive integersn .
 Proving Divisibility Statements
Example: Use mathematical induction to prove that, for every positive integer n , 7n−1 is
divisible by 6.
Solution: Similar to what we did in the previous session, we establish the two conditions stated
in the Principle of Mathematical Induction.
Part 1
1
7 −1=6=6.1
1
7 −1 is divisible by 6 .
Part 2
Assume: 7 k −1 is divisible by 6.
To show: 7 k −1 is divisible by 6.
k k k k k k
7 −1=7 . 7 −1=6 . 7 +7 −1=6 . 7 +(7 −1)
By definition of divisibility6. 7k is divisible by 6. Also, by the hypothesis (assumption), 7 k −1is
divisible by 6. Hence, their sum (which is equal to7 k−1 −1) is also divisible by 6.

Therefore, by the Principle of Math Induction, 7n −1 is divisible by 6 for all positive integersn .

Activity Sheet 2.3


Page 14 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Directions: Use mathematical induction to prove each divisibility statement for all nonnegative
integers n.

n 2
3n +n
1. ∑ ( 3 i−1 )=
i=1 2

1 1 1 1 n
2. + + +…+ =
1.2 2.3 3.4 n ( n+1 ) n+1

Assessment 2.3

Direction: Use the mathematical induction to prove divisibility statement for all nonnegative
integers n .

1. 7n −4 n is divisible by 3.

2. 10n +3 ( 4n +2 ) +5 is divisible by 9.

LESSON 4: The Binomial Theorem

Page 15 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Specific Objectives:

At the end of this lesson, the leaners will have been able to:

a. illustrate Pascal’s Triangle in the expansion of ( x + y )n for small positive integral


values ofn ;
b. prove the Binomial Theorem;
c. determine any term of( x + y )n, where is a positive integer, without expanding; and
d. solve problems using mathematical induction and the Binomial Theorem.

 Pascal's Triangle and the Concept of Combination

Consider the following powers ofa+ b:

( a+ b )0=1
( a+ b )1=a+b
( a+ b )2=a2+ 2 ab+b2
( a+ b )3=a3 +3 a2 b+3 a b2 + a3
( a+ b )4 =a 4 +4 a3 b+6 a2 b2 + 4 a b3 + b4
( a+ b )5=a5 +5 a4 b+ 10 a3 b2+ 10 a2 b3 +5 a b4 + b5
Note: Any number, variable and expression that has the power of zero (0) is always equal to
one (1).
We list down the coefficients of each expansion in a triangular array as follows:

n=1: 1 1
n=2: 1 2 1
n=3 1 3 3 1
n=4 1 4 6 4 1
n=5 1 5 10 10 5 1
n=6 1 6 15 20 15 6 1
n=7 1 7 21 35 35 21 7 1
n=8 1 8 28 36 55 36 28 8 1

Page 16 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Example 1: Use Pascal's Triangle to expand( 2 x−3 y )5.


Solution: We use the coefficients in the fifth row of the Pascal's Triangle. (n=5 ¿

( 2 x−3 y )5=( 2 x )5 (−3 y )0 ¿+¿]+ [ 10 ( 2 x )3 (−3 y )2 ] + [ 10 ( 2 x )2 (−3 y )3 ]+ ¿

¿ [ ( 32 x ) ( 1 ) ]+ [ 5 ( 16 x ) (−3 y ) ]+ [ 10 ( 8 x ) ( 9 y ) ]+10 ¿ ]
5 4 3 2

¿ [ 32 x 5 ] + [ 5 (−48 x 4 y ) ] + [ 10 ( 72 x 3 y 2 ) ] + [ 10 (−108 x 2 y 3 ) ] +¿

¿ 32 x5 −240 x 4 y +720 x 3 y 2−1080 x 2 y 3 +810 x y 4−243 y 5

Example 2: Use Pascal's Triangle to expand( x−2 y )4 .


Solution:n=4 , we use the fourth row.

( x−2 y )4 =[ ( x ) ¿ ¿ 4 (−2 y )0 ]+ [ 4 ( x )3 (−2 y )1 ] + [ 6 ( x )2 (−2 y )2 ] + [ 4 ( x )1 (−2 y )3 ]+[ ( x )0 (−2 y )4 ]¿

¿ [ ( x ) ( 1 ) ] + [ 4 ( x ) (−2 y ) ] + [ 6 ( x )( 4 y ) ]+ [ 4 ( x ) (−8 y ) ] + [ (1 ) ( 16 y ) ]
4 3 2 2 3 4

¿ [x ¿¿ 4 ]+ [ 4 (−2 x 3 y ) ]+ [ 6 ( 4 x 2 y 2 ) ] + [ 4 (−8 x y 3 ) ]+ [ 16 y 4 ] ¿

¿ x 4−8 x 3 y +24 x 2 y 2−32 x y3 +16 y 4

 Combination

Recall that C ( n , k ) or (nk)the number of ways of choosing k objects from a set of n objects. It
is also useful to know some properties of C (n , k ):
1. C (n , 0)=C (n , n)=1
2. C (n , 1)=C (n , n−1)=n
3. C (n , k )=C (n , n−k) .

Formula for Combination:

()
C ( n , k )= n =
n!
k k ! ( n−k ) !

Example 1: Compute (53)


Solution: Using the given formula:

Page 17 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

(53)= ( 5−35 !) ! 3 !
5!
¿
2! 3 !

5.4 .3.2 .1
¿
( 2.1 )( 3.2 .1 )

120
¿
( 2 )( 6 )

120
¿
12

(53)=10
Example 2: Compute (85)
Solution: Using the formula.

(85)= ( 8−58!) ! 5 !
8!
¿
3! 5 !

¿ 56

 The Binomial Theorem

For any positive integern ,


n
( a+ b ) =∑ n an−i bi
n

i=0 i
()

Proof. We use mathematical induction.

Part 1.

∑ (1i )a 1−i bi =(10 ) a1 b0 +(11) a 0 b 1=a+ b


i−0

Page 18 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Hence, the formula is true forn=1.

Part 2. Assume that

k
( a+ b ) =∑ k a k−i bi .
k

i =0 i
()
We want to show that

k+1
( a+ b )
k +1

i=0 i ( )
=∑ k +1 a k+1−i bi .

( a+ b )k +1=( a+b ) ( a+b )k

k
¿ ( a+ b ) ∑ k a b
i=0 i ()
k−i i

k k

()
¿ a ∑ k ak−i bi +b ∑ k ak−i bi
i=0 i i=0 i
()
k k

()
¿ ∑ k ak−i+! b i+ ∑ k a k−i bi +1
i=0 i i=0 i
()
k

()
¿ k a b +∑ k a
0
k+1 0

i=1 i
()
0
k 1

1
k−1 2

2 ()
k−2 3
()
b + k a b + k a b + k a b + …+ k a b + k a b
k +1−i i

k−1
1 1

k
0 k+1
() ( ) ()
k k
¿a k+1
+∑
i=1
()
k ak+1−i bi +
i

i=1 i−1
( )
k a k+1−i bi +bk +1

[( ) ( )]
k

( )
¿ k +1 a b + ∑ k + k a
0
k+1 0

i=1 i i−1
b + k +1 a b
k+1−i i

k +1
0 k+ 1
( )
k+1

i=0 i ( )
¿ ∑ k +1 ak+1−i bi

Page 19 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

The last expression above follows from Pascal’s Identity.

Therefore, by the Principle of Mathematical Induction,

n
n

i=0 i
()
( a+ b ) =∑ n an−i bi

for any positive integer n .

Example 1: Use the Binomial Theorem to expand( x + y )6.

Solution:

6
( x + y ) =∑ 6 x6 −i y i
6

i=0 i
()

0 () 1 2 ()
3
3 3

4
2 4
()
¿ 6 x y + 6 x y + 6 x y + 6 x y + 6 x y + 6 xy + 6 y
6 0 5 1 4 2

5
5

6
6
() () () ()
6 5 4 2 3 3 2 4 5 6
¿ ( 1 ) x + ( 6 ) x y+ ( 15 ) x y + ( 20 ) x y + ( 15 ) x y + ( 6 ) x y + ( 1 ) y

6 5 4 2 3 3 2 4 5 6
¿ x +6 x y +15 x y +20 x y +15 x y +6 x y + y

Example 2: Find the middle term in the expansion of ( 2 x+3 y )6

Solution: Since there are seven terms in the expansion, the middle term is the fourth term (
k =3 ¿ which is

(63 ) ( 2 x ) ( 3 y ) =( 20 ) (8 x )( 27 y )
3 3 3 3

3 3
¿ 4320 x y

Page 20 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

Activity 2.4

Direction: Use Pascal’s Triangle to expand each expression.

1. ( x−2 y )4

3
2. ( 2 a−b2 )

3. ( a+ b )9

Assessment 2.4

Direction: Use the Binomial Theorem to expand each expression.

1. ( x−2 )5

2. ( x + y )7

Performance Check:

Direction: Use the Binomial Theorem to prove the given notation.

()
1. ∑ n 2k =3n
k=0 k

Page 21 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

REFERENCES

Garces, I.J., Ph.D., et al., 2016, Precalculus, Commission on Higher Education, 2016

Page 22 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Activity Sheet 2.1

Direction: Identify the following equations whether a circle, parabola, ellipse or hyperbola.

_______________1. 5 x 2−3 y 2+10 x−12 y=22

_______________2. 2 y 2−5 x−12 y =17

_______________3. 3 x2 +3 y 2 +42 x−12 y=−154

_______________4. 3 x 2+6 x +4 y=18

_______________5. 7 x 2+ 3 y 2 +14 x +12 y=−14

_______________6. −4 x 2+3 y 2 +24 x−12 y=36

_______________7. 5 x 2+7 y 2 −40 x−28 y=−73

_______________8. 5 y 2+ 2 x−30 y =−49

_______________9. 3 x 2−3 y 2+12 x−12 y=5

_______________10. 3 x 2+3 y 2 +12 x+12 y=4

_______________11. 2 x2 +24 x −5 y =57

_______________12. x 2+ y 2=30

_______________13. −x 2+ 10 x + y−21=0

_______________14.−2 y 2 + x−20 y−49=0

_______________15. x 2+ 2 x + y−1=0

_______________16. x 2+ y 2+ 6 x −2 y +9=0

_______________17. x 2− y 2−2 x−8=0


Page 23 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

_______________18. 3 x 2+30 x + y +79=0

_______________19. −9 x 2+ y 2−72 x −153=0

_______________20.− y 2 + x+ 8 y−17=0

Assessment 2.1

Direction: Solve the system, and graph the curves in one Cartesian plane showing the point(s)
of intersection.

{
2 2
x + y =25
2 2
1. x y
+
18 32

2.
{
( x−1 )2+ ( y−3 )2=10
2 2
x + ( y−1 ) =5

3.
{
( x−3 )2 + ( y−5 )2=10
2 2
x + ( y +1 ) =25

Page 24 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Activity Sheet 2.2

Direction: Write SEQ if the given item is a sequence, and write SER if it is a series.

__________1. 1 ,2 , 4 , 8 , …

__________2. 2 , 8 ,10 , 18,…

__________3. 1+1−1+1−1

1 2 3 4
__________4. , , , ,…
2 3 4 5

__________5. 1+2+22 +23 +24 +¿

__________6. 1+0.1+0.001+0.0001

__________7. 4 +9+14 +…+64

__________8.10+2+0.4 +0.08+…

__________9.√ 2 , √ 3 , √ 4 , √ 5 , …

__________10. 0.1 , 0.01 ,0.001 , 0.0001 ,0.00001 , …

Page 25 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Assessment 2.2

A. Expand each summation, and simplify if possible.

5
1. ∑ (2−3 i)
i=1

n
3. ∑xj
j=1

B. Use the properties of sigma notation to evaluate the following summations.

50
1. ∑ ( 2−3 i )
i=1

Page 26 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

30
3. ∑ (1+2 j )
j=1

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Activity Sheet 2.3

Direction: Use mathematical induction to prove each divisibility statement for all nonnegative
integers n.

n
3 n2+ n
1. ∑ ( 3 i−1 )=
i=1 2

1 1 1 1 n
2. + + +…+ =
1.2 2.3 3.4 n ( n+1 ) n+1

Page 27 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Assessment 2.3

Direction: Use the mathematical induction to prove divisibility statement for all nonnegative
integers n .

1. 7n −4 n is divisible by 3.

2. 10n +3 ( 4n +2 ) +5 is divisible by 9.

Page 28 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Activity 2.4

Direction: Use Pascal’s Triangle to expand each expression.

1. ( x−2 y )4

3
2. ( 2 a−b2 )

Page 29 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

3. ( a+ b )9

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Assessment 2.4

Directions: Use the Binomial Theorem to expand each expression.

1. ( x−2 )5

2. ( x + y )7

Page 30 of 31
i-Link College of Science and Technology, Inc Pre-Calculus

ANSWER SHEET

Name: _________________________________ Strand and Section: ________________


Subject Teacher: ________________________ Date of Submission: ________________

Performance Check:

Direction: Use the Binomial Theorem to prove the given notation.

Excellent Proficient Needs Improvement


Criteria
5 3 1
Has written and encircled the Has written the correct answer Has written the wrong
Answer
correct answer without erasures. with erasures in it. answer
Has a neat, complete and correct
Solution Has a lessen solution No solution at all.
solution.
All Concepts of solving functions Few concepts of solving No concepts of solving
Application
were applied functions were applied functions.

()
1. ∑ n 2 =3
k=0 k
k n

Page 31 of 31

You might also like