St. Paul College Foundation, Inc.

Bulacao Campus, Cebu City

College of Education
Semi-Final Examination
in
Number Theory
Name: Rivera, Ghelyn B. Program: BSED-IV Math Score: __________
Class Schedule: ThF (10:30-12:00) Date: November 20, 2020 Instructor: Mr. Rennil Bornia

I. Solve the following modular arithmetic.

1. 12 mod 5 ꓿ 2
2. 17 mod 4 ꓿ 1
3. 42 mod 6 ꓿ 0
4. 27 mod 8 ꓿ 3
5. 23 mod 4 ꓿ 3
6. 51 mod 7 ꓿ 2
7. 37 mod 5 ꓿ 2
8. 69 mod 8 ꓿ 5

II. True or False. Write TRUE if the statement is correct and FALSE if not.

TRUE 1. 38 ≡23 mod 15

TRUE 2. 38 ≡14 mod12
TRUE 3. 10 ≡ 4 mod 6
TRUE 4. 28 ≡ 4 mod 6
TRUE 5. 36 ≡ 0 mod 6

III. Find the GCD using Euclidean Algorithm. Show your work.

1. (270, 192)

270꓿192(1) +78 ; GCD (78,192)꓿78(2)+36 ; GCD (36,78)꓿36(2)+6 ; GCD (6,36)꓿6(6)+0

Thus, GCD (36,6)꓿6

Therefore, GCD (270, 190)꓿6

2. (54, 888)

888꓿54(16)+24; GCD (24,54)꓿24(2)+6; GCD (6,24)꓿6(4)+0

Thus, GCD (24,6)꓿6

Therefore, GCD (54,888)꓿6

3.(1785, 546)

1785꓿546(3)+147; GCD (147,546)꓿147(3)+105; GCD (105,147)꓿105(1)+42; GCD (42,105)꓿42(2)+21;

GCD (21,42)꓿21(2)+0

Thus, GCD (42,21)꓿21

Therefore, GCD (1785,546)꓿21

4. (123, 36)

123꓿36(3)+15, GCD (15,36)꓿15(2)+6; GCD (6,15)꓿6(2)+3; GCD (3,6)꓿3(2)+0

Thus, GCD (6,3)꓿3

Therefore, GCD (123,36)꓿3

5. (12, 30)

30꓿12(2)+6; GCD (6,12)꓿6(2)+0

Thus, GCD (6,12)꓿6

Therefore, GCD (12,30)꓿6

IV. Prove.

1. Prove that if a ≡ b ( mod n ) , then for all positive integers e that divide both a and b ,

a b n
≡ ( mod )
e e gcd ( n , e )

Proving:

a ≡ b ( mod n )

꓿> n/a-b