MATH 218: NUMBER THEORY

TOPIC 1: ANSWER:

MATHEMATICAL INDUCTION 𝑃1 = 1 + 3 + ⋯ + 2𝑛 − 1 = 𝑛2

MATHEMATICAL INDCUTION is a 𝑃1 = 2(1) − 1 = (1)2

mathematical technique which is used to prove
𝑃1 = 2 − 1 = 1
a statement, a formula or a theorem is true for
every natural number. 𝑃1 = 1 = 1
SOLVED EXERCISES 𝑃𝑘 = 1 + 3 + ⋯ + 2𝑘 − 1 = 𝑘 2
Direction: Solve the following. 𝑃𝑘+1 = 1 + 3 + ⋯ + 2(𝑘 + 1) − 1
1. 𝑷𝒏 = 𝟏𝟏 + 𝟏𝟗 + 𝟐𝟕 + ⋯ + 𝟖𝒏 + = (𝑘 + 1)2
𝟑 = 𝒏(𝟒𝒏 + 𝟕) PROVE:
ANSWER: 𝑃𝑘+1 = 1 + 3 + ⋯ + 2(𝑘 + 1) − 1
𝑃1 = 8(1) + 3 = (1)(4)(1) + 7) = (𝑘 + 1)2

= 8 + 3 = 1(11) 𝑃𝑘+1 = 𝑘 2 + 2(𝑘 + 1) − 1 = (𝑘 + 1)2

= 11 = 11 𝑃𝑘+1 = 𝑘 2 + 2𝑘 + 2 − 1 = 𝑘 2 + 2𝑘 + 1

𝑃𝑘 = 11 + 19 + 27 + ⋯ + 8𝑘 + 3 𝑃𝑘+1 = 𝑘 2 + 2𝑘 + 1 = 𝑘 2 + 2𝑘 + 1
= 𝑘(4𝑘 + 7) 𝒏(𝒏+𝟏) 𝟐
3. 𝟏𝟑 + 𝟐𝟑 + 𝟑𝟑 + ⋯ + 𝒏𝟑 = ( )
𝟐
𝑃𝑘+1 = 11 + 19 + 27 + ⋯ + 8𝑘 + 3 + 8(𝑘
ANSWER:
+ 1) + 3
= (𝑘 + 1)((4(𝑘 + 1) + 7) 𝑛(𝑛 + 1) 2
𝑃1 = 13 + 23 + 33 + ⋯ + 𝑛3 = ( )
2
PROVE:
1(1 + 1) 2
𝑃𝑘+1 = 11 + 19 + 27 + ⋯ + 8𝑘 + 3 + 8(𝑘 𝑃1 = 13 = ( )
2
+ 1) + 3
= (𝑘 + 1)((4(𝑘 + 1) + 7) 1(2) 2
𝑃1 = 13 = ( )
2
𝑃𝑘+1 = 𝑘(4𝑘 + 7) + 8(𝑘 + 1) + 3
𝑃1 = 1 = 1
= (𝑘 + 1)((4(𝑘 + 1) + 7)
𝑘(𝑘 + 1) 2
= 4𝑘 2 + 7𝑘 + 8𝑘 + 8 + 3 = ((𝑘 + 𝑃𝑘 = 13 + 23 + 33 + ⋯ + 𝑘 3 = ( )
2
1)(4(𝑘 + 1) + 7))
𝑃𝑘 = 13 + 23 + 33 + ⋯ + (𝑘 + 1)3
= 4𝑘 2 + 15𝑘 + 11𝑘 (𝑘 + 1)((𝑘 + 1) + 1) 2
=( )
= (𝑘 + 1)(4𝑘 + 11) 2

= 4𝑘 2 + 15𝑘 + 11𝑘 PROVE:

= 4𝑘 2 + 11𝑘 + 4𝑘 + 11 𝑃𝑘 = 13 + 23 + 33 + ⋯ + (𝑘 + 1)3
= 4𝑘 2 + 15𝑘 + 11𝑘 = 4𝑘 2 + 15𝑘 + 11 (𝑘 + 1)((𝑘 + 1) + 1) 2
=( )
2
2. 1 + 3 + 5 + ··· + 2n − 1 = n2;

1 | MEDINA
 MATH 218: NUMBER THEORY
𝑘(𝑘 + 1) 2 𝑃𝑘|+1 = 12 + 32 + 52 + ⋯ + (2(𝑘 + 1) − 1)2
𝑃𝑘 = ( ) + (𝑘 + 1)3
2 (𝑘 + 1)(2(𝑘 + 1) − 1)(2(𝑘 + 1) + 1)
(𝑘 + 1)((𝑘 + 1) + 1) 2 =
=( ) 3
2
PROVE:
2
𝑘2
𝑃(𝑘+1) = (𝑘 + 1) + ( + (𝑘 + 1) 𝑃𝑘+1 = 12 + 32 + 52 + ⋯ + (2(𝑘 + 1) − 1)2
4
(𝑘 + 1)(𝑘 + 2) 2 (𝑘 + 1)(2(𝑘 + 1) − 1)(2(𝑘 + 1) + 1)
=( ) =
2 3

𝑘 2 + 4(𝑘 + 1) 𝑃𝑘+1
𝑃(𝑘+1) = (𝑘 + 1)2 + ( )
4 𝑘(2𝑘 − 1)(2𝑘 + 1)
(𝑘 + 1)(𝑘 + 2) 2 = + (2(𝑘 + 1) − 1)2
3
=( )
2 (𝑘 + 1)(2(𝑘 + 1) − 1)(2(𝑘 + 1) + 1)
=
3
𝑘 2 + 4𝑘 + 4
𝑃(𝑘+1) = (𝑘 + 1)2 + ( )
4 𝑘(2𝑘 − 1)
𝑃𝑘+1 = (2𝑘 + 1) + ( + (2𝑘 + 1))
(𝑘 + 1)(𝑘 + 2) 2 3
=( )
2 (𝑘 + 1)(2𝑘 + 1)(2𝑘 + 3)
=
3
(𝑘 + 2)2
𝑃(𝑘+1) = (𝑘 + 1)2 + ( )
4 2𝑘 2 − 𝑘 + 6𝑘 + 3
𝑃𝑘+1 = (2𝑘 + 1) + ( )
(𝑘 + 1)(𝑘 + 2) 2 3
=( )
2 (𝑘 + 1)(2𝑘 + 1)(2𝑘 + 3)
=
3
(𝑘 + 1)(𝑘 + 2) 2
𝑃(𝑘+1) = ( )
2 2𝑘 2 + 5𝑘 + 3
(𝑘 + 1)(𝑘 + 2) 2 𝑃𝑘+1 = (2𝑘 + 1) + ( )
=( ) 3
2 (𝑘 + 1)(2𝑘 + 1)(2𝑘 + 3)
=
3
4. 𝟏𝟐 + 𝟑𝟐 + 𝟓𝟐 + ⋯ + (𝟐𝒏 − 𝟏)𝟐 =
𝒏(𝟐𝒏−𝟏)(𝟐𝒏+𝟏) (𝑘 + 1)(2𝑘 + 1)(2𝑘 + 3)
𝟑 𝑃𝑘+1 =
3
ANSWER: (𝑘 + 1)(2𝑘 + 1)(2𝑘 + 3)
=
3
𝑃1 = 12 + 32 + 52 + ⋯ + (2𝑛 − 1)2
5. 𝟏. 𝟐 + 𝟐. 𝟑 + 𝟑. 𝟒 + ⋯ + 𝒏. (𝒏 + 𝟏) =
𝑛(2𝑛 − 1)(2𝑛 + 1)
= 𝒏(𝒏+𝟏)(𝒏+𝟐)
3 𝟑

1(2(1) − 1)(2(1) + 1) ANSWER:

𝑃1 = (2(1) − 1)2 =
3
𝑃1 = 1 × 2 + 2 × 3 + 3 × 4 + ⋯
1(2(1) − 1)(2(1) + 1)
𝑃1 = (2(1) − 1)2 = + 𝑛 × (𝑛 + 1)
3
𝑛(𝑛 + 1)(𝑛 + 2)
3 =
𝑃1 = (1)2 = 3
3
1(1 + 1)(1 + 2)
𝑃1 = 1 × (1 + 1) =
𝑃1 = 1 = 1 3

𝑃𝑘 = 12 + 32 + 52 + ⋯ + (2𝑘 − 1)2 1(2)(3)

𝑃1 = 1 × (2) =
𝑘(2𝑘 − 1)(2𝑘 + 1) 3
=
3

2 | MEDINA
 MATH 218: NUMBER THEORY
6 1 1
𝑃1 = 2 = 𝑃2 = =
3 3 3
𝑃1 = 2 = 2 1 1 1
𝑃𝑘 = + +
1+2 1+2+3 1+2+3+4
𝑃𝑘 = 1 × 2 + 2 × 3 + 3 × 4 + ⋯ 1
+ 𝑘 × (𝑘 + 1) + ⋯+
1 + 2 + 3 + ⋯𝑘
𝑘(𝑘 + 1)(𝑘 + 2) (𝑘 − 1)
= =
3 (𝑘 + 1)
𝑃𝑘+1 1 1 1
𝑃𝑘+1 = + +
= 1 × 2 + 2 × 3 + 3 × 4 + ⋯ + (𝑘 1+2 1+2+3 1+2+3+4
+ 1) × ((𝑘 + 1) + 1) +⋯
(𝑘 + 1)((𝑘 + 1) + 1)((𝑘 + 1) + 2) 1
= +
3 1 + 2 + 3 + ⋯ (𝑘 + 1)
((𝑘 + 1) − 1)
PROVE: =
((𝑘 + 1) + 1)
𝑃𝑘+1
PROVE:
= 1 × 2 + 2 × 3 + 3 × 4 + ⋯ + (𝑘
+ 1) × ((𝑘 + 1) + 1) 1 1 1
𝑃𝑘+1 = + +
(𝑘 + 1)((𝑘 + 1) + 1)((𝑘 + 1) + 2) 1+2 1+2+3 1+2+3+4
= +⋯
3
1
𝑘(𝑘 + 1)(𝑘 + 2) +
𝑃𝑘+1 = + (𝑘 + 1) × (𝑘 + 2) 1 + 2 + 3 + ⋯ (𝑘 + 1)
3 ((𝑘 + 1) − 1)
(𝑘 + 1)((𝑘 + 2)(𝑘 + 3) =
= ((𝑘 + 1) + 1)
3
𝑘 𝑘−1 1
𝑃𝑘+1 = (𝑘 + 1)(𝑘 + 2)( + 1) 𝑃𝑘+1 = +
3 𝑘 + 1 1 + 2 + 3 + ⋯ (𝑘 + 1)
(𝑘 + 1)(𝑘 + 2)(𝑘 + 3) ((𝑘 + 1) − 1)
= =
3 ((𝑘 + 1) + 1)

(𝑘 + 1)(𝑘 + 2)(𝑘 + 3) (𝑘 − 1)(𝑘 + 2) + 2 𝑘

𝑃𝑘+1 = 𝑃𝑘+1 = =
3 (𝑘 + 1)(𝑘 + 2) 𝑘+2
(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
= 𝑘2 + 𝑘 𝑘
3 𝑃𝑘+1 = =
(𝑘 + 1)(𝑘 + 2) 𝑘 + 2
𝟏 𝟏 𝟏
6. + + + ⋯+
𝟏+𝟐 𝟏+𝟐+𝟑 𝟏+𝟐+𝟑+𝟒
𝑘(𝑘 + 1) 𝑘
𝟏 (𝒏−𝟏) 𝑃𝑘+1 = =
= (𝑘 + 1)(𝑘 + 2) 𝑘 + 2
𝟏+𝟐+𝟑+⋯𝒏 (𝒏+𝟏)

ANSWER: 𝑘 𝑘
𝑃𝑘+1 = =
(𝑘 + 2) 𝑘 + 2
1 1 1
𝑃2 = + + +⋯ 𝟏 𝟏 𝟏
1+2 1+2+3 1+2+3+4 7. + + +⋯+
(𝟐×𝟓) (𝟓×𝟖) (𝟖×𝟏𝟏)
1 (𝑛 − 1)
+ = 𝟏
=
𝒏
1 + 2 + 3 + ⋯ 𝑛 (𝑛 + 1) (𝟑𝒏−𝟏)(𝟑𝒏+𝟐) (𝟔𝒏+𝟒)

1 (2 − 1) ANSWER:
𝑃2 = =
1 + 2 (2 + 1)

3 | MEDINA
 MATH 218: NUMBER THEORY
1 1 1 𝑘 1
𝑃1 = + + +⋯ 𝑃𝑘+1 = +
(2 × 5) (5 × 8) (8 × 11) (6𝑘 + 4) (3𝑘 + 2)(3𝑘 + 5)
1 𝑘
+ =
(3𝑛 − 1)(3𝑛 + 2) 2(3𝑘 + 2)
𝑛 1
= +
(6𝑛 + 4) (3𝑘 + 2)(3𝑘 + 5)
1 1 𝑘(3𝑘 + 5) + 2 3𝑘 2 + 5𝑘 + 2
𝑃1 = = 𝑃𝑘+1 = =
(3(1) − 1)(3(1) + 2) (6(1) + 4) 2(3𝑘 + 2)(3𝑘 + 5) 2(3𝑘 + 2)
1 1
𝑃1 = = 3𝑘 2 + 5𝑘 + 2 3𝑘 2 + 5𝑘 + 2
(2)(5) (6 + 4) 𝑃𝑘+1 = =
2(3𝑘 + 2)(3𝑘 + 5) 2(3𝑘 + 2)
1 1
𝑃1 = = 8. 𝟏! + (𝟐 × 𝟐!) + (𝟑 × 𝟑!) + ⋯ (𝒏 ×
10 10
𝒏!) = (𝒏 + 𝟏)! − 𝟏
1 1 1
𝑃𝑘 = + + +⋯ ANSWER:
(2 × 5) (5 × 8) (8 × 11)
1
+ 𝑃1 = 1! + (2 × 2!) + (3 × 3!) + ⋯ (𝑛 × 𝑛!)
(3𝑘 − 1)(3𝑘 + 2)
= (𝑛 + 1)! − 1
𝑘
=
(6𝑘 + 4) 𝑃1 = (1 × 1!) = (1 + 1)! − 1

𝑃𝑘+1 𝑃1 = 1 = (2)! − 1
1 1 1
= + + +⋯ 𝑃1 = 1 = 1
(2 × 5) (5 × 8) (8 × 11)
1 𝑃𝑘 = 1! + (2 × 2!) + (3 × 3!) + ⋯ (𝑘 × 𝑘!)
+
(3(𝑘 + 1) − 1)(3(𝑘 + 1) + 2) = (𝑘 + 1)! − 1
(𝑘 + 1)
= 𝑃𝑘+1 = 1! + (2 × 2!) + (3 × 3!)
(6(𝑘 + 1) + 4)
+ ⋯ ((𝑘 + 1)(𝑘 + 1)!)
1 1 1
𝑃𝑘+1 = + + +⋯ = ((𝑘 + 1) + 1)! − 1
(2 × 5) (5 × 8) (8 × 11)
1 PROVE:
+
(3𝑘 + 2)(3𝑘 + 5)
𝑃𝑘+1 = 1! + (2 × 2!) + (3 × 3!)
(𝑘 + 1)
= + ⋯ ((𝑘 + 1)(𝑘 + 1)!)
(6𝑘 + 10)
= ((𝑘 + 1) + 1)! − 1
PROVE:
𝑃𝑘+1 = ((𝑘 + 1!) − 1) + ((𝑘 + 1)(𝑘 + 1)!)
1 1 1 = ((𝑘 + 2)! − 1
𝑃𝑘+1 = + + +⋯
(2 × 5) (5 × 8) (8 × 11)
1 𝑃𝑘+1 = (𝑘 + 1)! + ((𝑘 + 1)(𝑘 + 1)!) − 1
+
(3𝑘 + 2)(3𝑘 + 5) = ((𝑘 + 2)! − 1
(𝑘 + 1)
= 𝑃𝑘+1 = (𝑘 + 1)! ((1 + (𝑘 + 1) − 1
(6𝑘 + 10)
= ((𝑘 + 2)! − 1

𝑃𝑘+1 = (𝑘 + 1)! (𝑘 + 2) − 1 = ((𝑘 + 2)! − 1

𝑃𝑘+1 = (𝑘 + 2)! − 1 = (𝑘 + 2)! − 1

4 | MEDINA
 MATH 218: NUMBER THEORY
9. (
𝟏
)+(
𝟏
)+(
𝟏
)+⋯+ 1 1
𝟏×𝟐×𝟑 𝟐×𝟑×𝟒 𝟑×𝟒×𝟓 𝑃𝑘+1 = )+( )
1×2×3 2×3×4
𝟏 𝒏(𝒏+𝟑)
( )= 1
𝒏(𝒏+𝟏)(𝒏+𝟐 𝟒(𝒏+𝟏)(𝒏+𝟐) +( )+⋯
3×4×5
ANSWER: 1
+( )
(𝑘 + 1)((𝑘 + 2)((𝑘 + 3)
1 1
𝑃1 = )+( ) (𝑘 + 1)(𝑘 + 4)
1×2×3 2×3×4 =
1 4((𝑘 + 2)((𝑘 + 3)
+( )+⋯
3×4×5 PROVE:
1
+( ) 1 1
𝑛(𝑛 + 1)(𝑛 + 2
𝑃𝑘+1 = )+( )
𝑛(𝑛 + 3) 1×2×3 2×3×4
= 1
4(𝑛 + 1)(𝑛 + 2) +( )+⋯
3×4×5
1 𝑛(𝑛 + 3) 1
𝑃1 = ( )= +( )
𝑛(𝑛 + 1)(𝑛 + 2) 4(𝑛 + 1)(𝑛 + 2) (𝑘 + 1)((𝑘 + 2)((𝑘 + 3)
(𝑘 + 1)(𝑘 + 4)
1 1(1 + 3) =
𝑃1 = ( )= 4((𝑘 + 2)((𝑘 + 3)
1(1 + 1)(1 + 2) 4(1 + 1)(1 + 2)
𝑘(𝑘 + 3)
1 1(4) 𝑃𝑘+1 =
𝑃1 = ( )= 4(𝑘 + 1)(𝑘 + 2)
1(2)(3) 4(2)(3)
1
+( )
1 4 (𝑘 + 1)(𝑘 + 2)((𝑘 + 3)
𝑃1 = =
6 24 (𝑘 + 1)((𝑘 + 4)
=
1 1 4(𝑘 + 2)((𝑘 + 3)
𝑃1 = =
6 6 𝑘(𝑘 + 3)2 + 4
𝑃𝑘+1 =
1 1 4(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
𝑃𝑘 = )+( )
1×2×3 2×3×4 (𝑘 + 1)(𝑘 + 4)
1 =
4(𝑘 + 2)((𝑘 + 3)
+( )+⋯
3×4×5
1 𝑘(𝑘 2 + 6𝑘 + 9) + 4
+( ) 𝑃𝑘+1 =
𝑘(𝑘 + 1)(𝑘 + 2 4(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
𝑘(𝑘 + 3) (𝑘 + 1)(𝑘 + 4)
= =
4(𝑘 + 1)(𝑘 + 2) 4(𝑘 + 2)((𝑘 + 3)

𝑃𝑘+1 𝑘 3 + 6𝑘 2 + 9𝑘 + 4
𝑃𝑘+1 =
1 1 1 4(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
= )+( )+( )
1×2×3 2×3×4 3×4×5 (𝑘 + 1)(𝑘 + 4)
=
1 4(𝑘 + 2)((𝑘 + 3)
+ ⋯+ ( )
(𝑘 + 1)((𝑘 + 1) + 1)((𝑘 + 1) + 2
(𝑘 + 1)((𝑘 + 1) + 3) (𝑘 + 1)2 (𝑘 + 4)
= 𝑃𝑘+1 =
4((𝑘 + 1) + 1)((𝑘 + 1) + 2) 4(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
(𝑘 + 1)(𝑘 + 4)
=
4(𝑘 + 2)((𝑘 + 3)

5 | MEDINA
 MATH 218: NUMBER THEORY
10. (𝟏 −
𝟏
) (𝟏
𝟏
−
𝟏
) (𝟏 − 𝟐 ) (𝟏 − 𝑘 + 1 (𝑘 + 1)2 − 1 (𝑘 + 2)
𝟐𝟐 𝟐𝟐 𝟑 𝑃𝑘+1 = ( )( 2
)=
𝟏 𝟏 (𝒏+𝟏) 2𝑘 (𝑘 + 1) 2(𝑘 + 1)
) … (𝟏 − 𝟐) =
𝟒𝟐 𝒏 𝟐𝒏
𝑘 + 1 (𝑘 + 1)2 − 1 (𝑘 + 2)
ANSWER: 𝑃𝑘+1 = ( )( )=
2𝑘 (𝑘 + 1)2 2(𝑘 + 1)
1 1 1
𝑃2 = (1 − ) (1 − 2 ) (1 − 2 ) (1 1 𝑘 2 + 2𝑘 (𝑘 + 2)
22 2 3 𝑃𝑘+1 = ( ) ( )=
2𝑘 𝑘+1 2(𝑘 + 1)
1 1 (𝑛 + 1)
− 2 ) … (1 − 2 ) =
4 𝑛 2𝑛 1 𝑘(𝑘 + 2) (𝑘 + 2)
𝑃𝑘+1 = ( ) ( )=
1 (2 + 1) 2𝑘 𝑘+1 2(𝑘 + 1)
𝑃2 = (1 − 2 )=
(2) 2(2) 𝑘+2 (𝑘 + 2)
𝑃𝑘+1 = =
1 3 2(𝑘 + 1) 2(𝑘 + 1)
𝑃2 = (1 − ) =
4 4
3 3
𝑃2 = = TOPIC 2
4 4
1 1 1 DIVISIBILITY
𝑃𝑘 = (1 − 2 ) (1 − 2 ) (1 − 2 ) (1
2 2 3 DIVISIBILITY is a set of general rules that are
1 1 (𝑘 + 1)
− 2 ) … (1 − 2 ) = often used to determine whether or not a
4 𝑘 2𝑘
number is absolutely divisible by another
number.
1 1 1 SOLVED PROBLEMS:
𝑃𝑘+1 = (1 − 2 ) (1 − 2 ) (1 − 2 ) (1
2 2 3
1 1 Direction: Check the divisibility.
− 2 ) … (1 − )
4 (𝑘 + 1)2
1. 19400
((𝑘 + 1) + 1)
= 2. 720345
2(𝑘 + 1)
3. 125370
1 1 1 4. 3000000
𝑃𝑘+1 = (1 − 2 ) (1 − 2 ) (1 − 2 ) (1
2 2 3 5. 23408
1 1 6. 100246
− 2 ) … (1 − )
4 (𝑘 + 1)2 7. 34972
(𝑘 + 2) 8. 150126
=
2𝑘 + 2 9. 58724
PROVE: 10. 19000

1 1 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1
𝑃𝑘+1 = (1 − ) (1 − ) (1 − ) (1 0 1 2 3 4 5 6
22 22 32
1 1 1 / / / / /
− 2 ) … (1 − ) 2 / / /
4 (𝑘 + 1)2
3 / / / / / / / / /
(𝑘 + 2)
= 4 / / / / / / / / /
2𝑘 + 2 5 / / / / / / /
𝑘+1 1 (𝑘 + 2) 6 /
𝑃𝑘+1 = ( ) (1 − ) = 7 / / / /
2𝑘 (𝑘 + 1)2 2(𝑘 + 1)
8 / / /

6 | MEDINA
 MATH 218: NUMBER THEORY
9 / / ANSWER: q = 58908 and r = 5
1 / / / / /
0 6. a = 78651 and b = 14, find q and r.

ANSWER: q = 5617 and r = 13

TOPIC 3:
7. a = - 123456 and b = 11, find q and r.
DIVISION ALGORITHM
ANSWER: q = -11223 and r = - 3
THEOREM: Let a and b be integers with b is
8. a = - 9876 and b = 5, find q and r.
not equal to zero. then there exist integers q and
r such that; ANSWER: q = -1975 and r = -1

a = bq + r and 𝟎 ≤ 𝒓 < 𝒍𝒃𝒍 9. a = 765894 and b = 18, find q and r.

also, the integers q and r are unique. ANSWER: q = 42549 and r = 372

The integer: 10. a = 675324 and b = 24, find q and r.

- q is called the quotient ANSWER: q = 28138 and r = 12

- r is called the remainder
- b is called the divisor
- a is called the dividend TOPIC 4:

The theorem also states that a – bq = r. PRIME AND COMPOSITE NUMBERS

SOLVED EXERCISES PRIME NUMBER is defined as a natural

number greater than 1 and is divisible by only 1
Direction. Solve the following.
and itself.
1. What is dividend, when divisor is 17,
Properties of Prime Numbers:
the quotient is 9 and the remainder is 5?
- Every number greater than 1 can be
ANSWER:
divided by at least one prime number.
𝑎 = 𝑏𝑞 + 𝑟 - Every even positive integer greater
than 2 can be expressed as the sum of
𝑎 = (17 × 9) + 5
two primes.
𝑎 = 153 + 5 - Except 2, all other prime numbers are
odd. In other words, we can say that 2
𝑎 = 158
is the only even prime number.
2. a = 144 and b = 5, find q and r. - Two prime numbers are always
coprime to each other.
ANSWER: q = 28 and r = 4
- Each composite number can be
3. a = 1345 and b = 12, find q and r. factored into prime factors and
individually all of these are unique in
ANSWER: q = 112 and r = -1
nature.
4. a = 4563 and b = 8, find q and r.
Some Interesting Facts About Prime
ANSWER: q = 570 and r = 3 Numbers:

5. a = 765809 and b = 13, find q and r.

7 | MEDINA
 MATH 218: NUMBER THEORY
- Except for 2, which is the smallest 31 32 33 34 35 36 37 38 39 40
prime number and the only even prime 41 42 43 44 45 46 47 48 49 50
number, all prime numbers are odd 51 52 53 54 55 56 57 58 59 60
61 62 63 64 65 66 67 68 69 70
numbers.
71 72 73 74 75 76 77 78 79 80
- Every prime number can be 81 82 83 84 85 86 87 88 89 90
represented in form of 6n + 1 or 6n – 1 91 92 93 94 95 96 97 98 99 100
except the prime numbers 2 and 3,
where n is any natural number.
Mersenne prime numbers are
- 2 and 3 are only two consecutive
numbers of the form:
natural numbers that are prime.
- Goldbach Conjecture: Every even 𝒎 = 𝟐𝑷 − 𝟏
integer greater than 2 can be expressed
Mersenne prime numbers:
as the sum of two primes.
- Wilson Theorem: Wilson’s theorem 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107,
states that a natural number p > 1 is a 127, 521, 607, 1279, 2203, 2281, 3217, 4253,
prime number if and only if 4423, 9689, 9941, 11213, 19937, 21701, 23209,
44497, 86243, 110503, 132049, 216091,
(p – 1) ! ≡ -1 mod p
756839, 859433, 1257787, 1398269, 2976221,
OR, 3021377, 6972593, 13466917, 20996011,
24036583, 25964951, 30402457.
(p – 1) ! ≡ (p-1) mod p
COMPOSITE NUMBERS can be
- Fermat’s Little Theorem: If n is a
defined as numbers that have more than two
prime number, then for every a, 1 ≤ a <
factors.
n,
COMPOSITE NUMBERS
𝑎𝑛−1 = 1
1 2 3 4 5 6 7 8 9 10
- Prime Number Theorem: The 11 12 13 14 15 16 17 18 19 20
probability that a given, randomly 21 22 23 24 25 26 27 28 29 30
chosen number n is prime is inversely 31 32 33 34 35 36 37 38 39 40
proportional to its number of digits, or 41 42 43 44 45 46 47 48 49 50
51 52 53 54 55 56 57 58 59 60
to the logarithm of n.
61 62 63 64 65 66 67 68 69 70
- Lemoine’s Conjecture: Any odd 71 72 73 74 75 76 77 78 79 80
integer greater than 5 can be expressed 81 82 83 84 85 86 87 88 89 90
as a sum of an odd prime (all primes 91 92 93 94 95 96 97 98 99 100
other than 2 are odd) and an even
semiprime. A semiprime number is a Note: 1 is not either prime or composite. The
product of two prime numbers. This is remaining numbers, except for 1, are classified
called Lemoine’s conjecture. as prime and composite numbers.

PRIME NUMBERS
TOPIC 5:
1 2 3 4 5 6 7 8 9 10
11 12 13 14 15 16 17 18 19 20 PERFECT NUMBER
21 22 23 24 25 26 27 28 29 30

8 | MEDINA
 MATH 218: NUMBER THEORY
PERFECT NUMBER N is defined as any BIBLIOGRAPHY:
positive integer where the sum of its divisors
Retrieved from:
minus the number itself equals the number.
https://byjus.com/maths/perfect-
𝑵 = 𝟐𝑷−𝟏 (𝟐𝑷 − 𝟏) where p is a prime numbers/#:~:text=What%20are%20the%20Per
for which 2𝑃−1 is a Mersenne prime. fect%20Numbers,28%2C%20496%2C%20and
%208128.
P 𝟐𝑷−𝟏 𝟐𝑷−𝟏 (𝟐𝑷 − 𝟏)
2 3 6 Retrieved from:
3 7 28 https://cdn.kutasoftware.com/Worksheets/Prec
5 31 496 alc/11%20-%20Induction.pdf
7 127 8128
1 8191 33550336 Retrieved from:
3
https://www.geeksforgeeks.org/prime-
1 131071 8589869056
7 numbers/
1 524287 137438691328
Retrieved from:
9
3 2147483647 2305843008139952128 https://www.math.ualberta.ca/~isaac/math324/
1 s12/induction.pdf
6 2305843009 26584559915698317446
1 213693951 54692615953842176 Retrieved from:
https://www.math.utah.edu/~pa/math/mersenn
e.html#:~:text=p%20%3D%202%2C%203%2
C%205,%2C%2024036583%2C%202596495
1%2C%2030402457.

Retrieved from:
https://www.onlinemath4all.com/division-
algorithm-problems-and-solutions.html

Retrieved from:
https://www.onlinemath4all.com/mathematical
-induction-worksheet-with-answers.html

Retrieved from:
https://www.tutorialspoint.com/discrete_mathe
matics/discrete_mathematical_induction.htm

9 | MEDINA