SEMI-DETAILED LESSON PLAN

(Teaching Demonstration for Instructor I)

Name of Instructor: Hemeh Luck M. Maravillas Course/Subject: Number Theory

Date: August 11, 2023 Time: 8:30 A.M

Place: Human Kinetics Bldg. Room 201 Time Allotment: 1 hour and 30 minutes

I. Objectives

At the end of the class, the students should be able to:

a. recognize linear Diophantine equations in two variables.

b. solve problems involving linear Diophantine equations in two variables; and

c. apply the concept of linear Diophantine equations with two variables in real-world scenarios.

II. Subject Matter

a. Topic: Linear Diophantine Equations in Two Variables

b. Reference: Elementary Number Theory by David M. Burton

c. Page No(s): 32-38

d. Instructional Materials: Laptop, Projector and Chalk

III. Procedure

A. Reviewing previous lesson.

 Recalls finding the GCD using Euclidean Algorithm.

1. gcd ( 51,6 )

51=6 ( 8 ) +3
6=3 ( 2 )+ 0

Therefore, the gcd ( 6,51 ) =3.

2. gcd ( 33,14 )
33=14 ( 2 ) +5
14=5 ( 2 ) +2
5=2 ( 2 ) +1
2=1 ( 2 ) +0

Therefore, the gcd ( 33,14 )=1

B. Establishing a purpose for the lesson.

 Presents a problem that will ignite curiosity.

Every year, a certain theater offers special prices for the honor students (high school and
college) in the neighborhood. They charge P180 for college students and P75 for high school
students. On a particular movie, the total receipts were P9000, all from the students. Assuming
that more college students than high school students were present, how many students
attended?

 Creates a model.

Let x – college students

Let y – high school students

180 x+75 y =9000

C. Presenting the new lesson.

 Presents the background of the name.

Diophantine of Alexandria is a mathematician who was the author of a series of books called
Arithmetica that deals mainly on solving algebraic equations.

 Presents the definition.

Definition 1: A Diophantine equation is any polynomial equation in one or more unknown that
is to be solved in the set of integers.

 Shows some famous Diophantine equations.

Pythagorean triples x 2+ y 2=z 2

Fermat’s Last Theorem x n + y n=z n

Pell’s Equation x 2−n y 2=± 1

 Presents the definition of linear Diophantine equation.

Definition 2: A linear Diophantine equation is an equation of the form ax +by =c where

a , b , c ∈ Z.

 Presents a theorem and a corollary.

Theorem: The linear Diophantine equation ax +by =c has a solution if and only if d∨c , where
d=gcd ( a , b ) . If ( x 0 , y 0 ) is a solution of this equation, then all other solutions are given by
b a
x=x 0 + t and y= y 0− t for any arbitrary integer t .
d d

Corollary: If gcd ( a ,b )=1 and if ( x 0 , y 0 ) is a particular solution of the Diophantine equation

ax +by =c . Then all solutions are given by x=x 0 +bn and y= y o−an for any arbitrary integer n .

D. Presenting examples/instances for the new lesson #1

  Presents an example.
Example 1: Which of the following Diophantine equations cannot be solved?

a. 6 x +51 y =22 b. 33 x+ 14 y=115

The gcd ( 51,6 )=3 but 3 ∤22. The gcd ( 33,14 )=1 and 1¿ 115.
Therefore, 6 x +51 y =22 can’t be solved. Therefore, 33 x+ 14 y=115 can be solved.

E. Presenting examples/instance for the new lesson # 2

 Presents an example.

Example 2: Find all the integer solutions of 7 x +13 y=1.

13=7 (1 )+6 ⟹ 6=13 ( 1 )+ 17 (−1 )

7=6 ( 1 )+ 1⟹ 1=7 ( 1 ) +6 (−1 )
6=1 (6 ) +0

1=7 ( 1 ) +6 (−1 )
¿ 7 ( 1 ) + [ 13 (1 ) +7 (−1 ) ] (−1 )
¿ 7 ( 1 ) +13 (−1 )+ 7 (1 )
¿ 7 ( 2 ) +13 (−1 )

⇒ x 0=2 and y 0=−1

⇒ x=2+13 n and y=−1−7 n for any integer n .

F. Presenting examples/instance for the new lesson # 3

 Presents an example.

Example 3: Find all the integer solutions of 6 x +64 y=2.

6 x +64 y=2
3 x+ 32 y =1

32=3 ( 10 ) +2 ⟹ 2=32 ( 1 )+ 3 (−10 )

3=2 ( 1 ) +1 ⟹1=3 ( 1 )+ 2 (−1 )
2=1 ( 2 ) +0

1=3 ( 1 ) +2 (−1 )
¿ 3 ( 1 )+ [ 32 ( 1 ) +3 (−10 ) ] (−1 )
¿ 3 ( 1 )+ 32 (−1 ) +3 ( 10 )
¿ 3 ( 11 )+ 32 (−1 )

⇒ x 0=11 and y 0=−1

⇒ x=11+32 n and y=−1−3 n for any integer n .

G. Presenting examples/instance for the new lesson # 4

 Presents an example.

Example 4: Find all the integer solutions of 5 x+ 22 y =18.

 22=5 ( 4 ) +2 ⟹ 2=22 (1 )+5 (−4 )
5=2 ( 2 ) +1 ⟹5 ( 1 ) +2 (−2 )
2=1 ( 2 ) +0

1=5 ( 1 ) +2 (−2 )
¿ 5 ( 1 )+ [ 22 ( 1 ) +5 (−4 ) ] (−2 )
¿ 5 ( 1 )+ 22 (−2 ) +5 ( 8 )
¿ 5 ( 9 ) +22 (−2 )
18=5 ( 162 ) +22 (−36 )

⇒ x 0=162 and y 0=−36

⇒ x=162+22 n and y=−36−5 n for any integer n .

H. Developing mastery of the new lesson.

 Presents an activity.

Find all the integer solutions of the following equations:

a. 47 x +30 y=1 b. 39 x+ 21 y=3

Solutions:

a. 47 x +30 y=1

47=30 ( 1 ) +17 ⟹17=47 ( 1 )+30 (−1)

30=17 (1 )+13 ⟹ 13=30 ( 1 ) +17 (−1 )
17=13 (1 )+ 4 ⟹ 4=17 ( 1 ) +13 (−1 )
13=4 ( 3 )+1 ⟹ 1=13 ( 1 )+ 4 (−3 )
4=1 ( 4 ) +0

1=13 ( 1 ) +4 (−3 )
¿ 13 ( 1 )+ [17 (1 ) +13 (−1 ) ] (−3 )
¿ 13 ( 1 )+ 17 (−3 ) +13 ( 3 )
¿ 13 ( 4 )+ 17 (−3 )
¿ [ 30 ( 1 )+ 17 (−1 ) ] ( 4 ) +17 (−3 )
¿ 30 ( 4 ) +17 (−4 ) +17 (−3 )
¿ 30 ( 4 ) +17 (−7 )
¿ 30 ( 4 ) + [ 47 ( 1 ) +30 (−1 ) ] (−7 )
¿ 30 ( 4 ) +47 (−7 )+ 30 ( 7 )
¿ 30 ( 11 )+ 47 (−7 )

⇒ x 0=−7 and y 0=11 .

⇒ x=−7 +30 n and y=11−47 n for any integer n .

b. 39 x+ 21 y=3

39 x+ 21 y=3
13 x+7 y=1

13=7 (1 )+6 ⟹ 6=13 ( 1 )+ 17 (−1 )

 7=6 ( 1 )+ 1⟹ 1=7 ( 1 ) +6 (−1 )
6=1 (6 ) +0

1=7 ( 1 ) +6 (−1 )
¿ 7 ( 1 ) + [ 13 (1 ) +7 (−1 ) ] (−1 )
¿ 7 ( 1 ) +13 (−1 )+ 7 (1 )
¿ 7 ( 2 ) +13 (−1 )

⇒ x 0=−1 and y 0=2.

⇒ x=−1+7 n and y=2−13 n for any integer n .

I. Finding practical applications of concepts and skills in daily living.

 Presents the problem.

Every year, a certain theater offers special prices for the honor students (high school and
college) in the neighborhood. They charge P180 for college students and P75 for high school
students. On a particular movie, the total receipts were P9000, all from the students. Assuming
that more college students than high school students were present, how many students
attended?

Solution:

Let x – college students

Let y – high school students

180 x+75 y =9000

12 x+5 y=600

Since x > y , we can assume a maximum of x and a minimum of y .

Suppose y=0, we have

12 x+5 ( 0 )=600
12 x=600
x=50

⇒ x 0=50 and y=0

⇒ x=50+5 n and y=0−12 n=−12n for any integer n .

Since x > y , then

50+5 n>−12 n
50>−12 n−5 n
50>−17 n
−2.94< n
n>−2.94

Since y >0 , then

−12 n ≥0
n≤0

⇒ −2.94< n ≤0

If n=0, then x=50+5 ( 0 )=50 and y=−12 ( 0 )=0.

 If n=−1, then x=50+5 (−1 )=45 and y=−12 (−1 )=12

If n=−2, then x=50+5 (−2 ) =40 and y=−12 (−2 ) =24

Therefore, the number of students attending can be 50, 57, or 64.

J. Making generalizations and abstractions about the lesson.

 Presents a summary of the new lesson.

Linear Diophantine Equation: ax +by =c where a , b , and c ∈ Z .

Condition: The linear Diophantine equation ax +by =c has a solution if and only if d∨c , where
d=gcd ( a , b ) .

Specific Solution: x 0 , y 0

General Form of Solutions: x=x 0 +bn and y= y 0−an

Process: Euclidean Algorithm and its Reverse

I. Evaluating learning.

 Presents an assessment.

Find all the integer solutions of 172 x +20 y=1000.

172 x +20 y=1000

43 x +5 y=250

43=5 ( 8 ) +3 ⟹ 3=43 (1 )+5 (−8)

5=3 (1 ) +2 ⟹ 2=5 ( 1 ) +3(−1)
3=2 ( 1 ) +1 ⟹1=3 ( 1 )+ 2(−2)
2=1 ( 2 ) +0

1=3 ( 1 ) +2(−1)
¿ 3 ( 1 )+ [ 5 ( 1 ) +3 (−1 ) ] (−1)
¿ 3 ( 1 )+ 5 (−1 )+3 (1)
¿ 3 ( 2 ) +5(1)
¿ [ 43 ( 1 ) +5 (−8 ) ] ( 2 ) +5(−1)
¿ 43 ( 2 ) +5 (−16 ) +5(−1)
¿ 43 ( 2 ) +5(−17)
250=43 ( 500 ) +5(−4250)

⇒ x 0=500 and y 0=−4250.

⇒ x=500+5 n and y=−4250−43 n for any integer n .

L. Additional activities for application.

A man has P4.55 in change compose entirely of 25 and 10 centavo coins. What are the
maximum and minimum number of coins that he can have? Is it possible for the number of 25 centavo
coins to equal the number of 10 centavo coins?