FINAL EXAM IN

NUMBER
THEORY
STUDENT|
N O R V E E N S . C A M PA N I L L A
MST Mathematics

I N STRU CTO R|
N A R G L O R I C U TA N E S , P H D
 Proofs Principle of Mathematical Induction
1. Write the contrapositive of the proposition and prove.
If 𝑛2 is even, then 𝑛 is also even.
H: 𝑛2 is an even integer
C: n is an even integer
Contrapositive
~H: 𝑛2 is an odd integer
~C: n is an odd integer
So, the new statement to prove:
~𝑪 → ~𝑯
If 𝑛 is an odd integer, then 𝑛2 is also an odd integer.
Proof:
Let 𝑛 be any integer such that 𝑛2 is even. We would like to prove that 𝑛 must be an even integer.
Indirectly, we assume that the conclusion is false, that is n is odd. Let 𝑛 = 2𝑘 − 1 for some integer 𝑘. Then,
𝑛2 = 2𝑘 − 1 2 = 4𝑘 2 − 4𝑘 + 1 = 2 2𝑘 2 − 2𝑘 + 1 − 1
which is an odd integer. This makes our hypothesis that 𝑛2 is an even integer false.
Therefore, by law of contrapositive, our assumption must be wrong; so 𝑛 must be an even integer. Thus, if 𝑛2 is
an even integer, then 𝑛 is also an even integer.
 Proofs Principle of Mathematical Induction

2. Prove by induction 𝟑|𝟒 𝟐𝒏

− 𝟏 for 𝒏 ≥ 𝟏
SOLUTION:
Base case
For 𝑛 = 1 Now, we can rewrite this as:
42−1 − 1 = 42 − 1 = 16 − 1 = 15; since 15 is divisible by 16 ∗ 42𝑘 − 1 = 16 ∗ 42𝑘 − 16 + 16 − 1
3, the base case hold. 16 42𝑘 − 1 + 15
Induction step Using the induction hypothesis 42𝑘 − 1 = 3𝑚, we have
Next, we assume that the statement is true for some 𝑛 = 16 42𝑘 − 1 + 15 = 16 ∗ 3𝑚 + 15 = 48𝑚 + 15
𝑘; that is, 3|42𝑘 − 1 Since both term 48𝑚 & 15 𝑎𝑟𝑒 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3, their sum
This means there exists some integer in such that: 48𝑚 + 15 𝑖𝑠 𝑎𝑙𝑠𝑜 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3. Thus 42(𝑘+1) − 1 = 48𝑚 +
42𝑘 − 1 = 3𝑚 15 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3. This complete the induction step.
We need to show that 3|42 𝑘+1 − 1
Consider 42(𝑘+1) − 1: Conclusion:
42(𝑘+1) − 1 = 42𝑘+2 − 1 = (42𝑘 ∗ 42 ) − 1 By the principle of mathematical induction have shown that
42(𝑘+1) − 1 = 42 ∗ 42𝑘 − 1 = 16 ∗ 42𝑘 − 1 3|42𝑛 − 1 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 1
 Prime Factorization, GCD and LCM
3. Write the canonical decompositions of 𝒂 𝒂𝒏𝒅 𝒃,
determine 𝒂, 𝒃 and 𝒂, 𝒃 . 𝒂 = 𝟑𝟎𝟖𝟕𝟎; 𝒃 = 𝟕𝟐𝟔𝟎𝟎
SOLUTION:
a. 30870 (Prime Factorization)
2|30870 30870 = 2 ∗ 15435 Determine the GCD and LCM of a and b
2 ∤ 15435 𝑏𝑢𝑡 3|15435 30870 = 2 ∗ 3 ∗ 5145
3|5145 30870 = 2 ∗ 3 ∗ 3 ∗ 1715 30870 = 21 ∗ 32 ∗ 51 ∗ 73
3 ∤ 1715 𝑏𝑢𝑡 5|1715 30870 = 2 ∗ 3 ∗ 3 ∗ 5 ∗ 343 72600 = 23 ∗ 3 ∗ 52 ∗ 112
3 ∤ 343 𝑏𝑢𝑡 7|343 30870 = 2 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 7 ∗ 7 = 2 ∗ 32 ∗ 5 ∗ 73
Thus, the canonical decomposition of 30870 𝑖𝑠 30870 = 21 ∗ 32 ∗ 51 ∗ 73 30870 = 2 ∗3∗3∗5 ∗7∗7∗7
b. 72600 (Prime Factorization) 30870 = 2 ∗ 2 ∗ 2 ∗ 3 ∗5∗5 ∗ 11 ∗ 11
2|76000 72600 = 2 ∗ 36300 GCD = 2 3 5
2|36300 72600 = 2 ∗ 2 ∗ 18150 LCM = 2 2 2 3 3 5 5 7 7 7 11 11
2|18150 72600 = 2 ∗ 2 ∗ 2 ∗ 9075
2 ∤ 9075 𝑏𝑢𝑡 3|9075 72600 = 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3025 GCD = 2 ∗ 3 ∗ 5 = 30
2 ∤ 3025 𝑏𝑢𝑡 5|3025 72600 = 2 ∗ 2 ∗ 2 ∗ 3 ∗ 5 ∗ 605 LCM = 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 5 ∗ 5 ∗ 7 ∗ 7 ∗ 7 ∗ 11 ∗ 11
5|605 72600 = 2 ∗ 2 ∗ 2 ∗ 3 ∗ 5 ∗ 5 ∗ 121 LCM = 74, 705, 400
5 ∤ 121 𝑏𝑢𝑡 11|121 72600 = 2 ∗ 2 ∗ 2 ∗ 3 ∗ 5 ∗ 5 ∗ 11 ∗ 11
Thus, the canonical decomposition of 72600 𝑖𝑠 72600 = 23 ∗ 3 ∗ 52 ∗ 112 The 𝒂, 𝒃 𝒊𝒔 𝟑𝟎 𝒂𝒏𝒅 𝒕𝒉𝒆 𝒂, 𝒃 𝒊𝒔 𝟕𝟒, 𝟕𝟎𝟓, 𝟒𝟎𝟎
 Linear Diophantine Equations in Two-Variables
4. Find the solution/s of the linear Diophantine
equation 𝟏𝟐𝒙 + 𝟐𝟏𝒚 + 𝟑𝟐, if there are any.
SOLUTION:

GCD of the coefficients:

12 = 2 ∗ 2 ∗ 3
21 = 3∗7
GCD = 3
3 ∤ 32 3 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 𝑑𝑖𝑣𝑖𝑑𝑒 32
Since the GCD does not divide the constant term, therefore, there
are no integer solutions to the equation 12𝑥 + 21𝑦 + 32.
 Linear Diophantine Equations in Two-Variables
5. A businessman returning home from a trip to North America exchanges his U.S. and
Canadian dollars for pesos. If he received Php9,763, exchanging Php99 each U.S. dollar
and Php86 each Canadian dollar, how many of each type of currency did he exchange?
1= 3−1×2
To solve the problem, let's define:
1= 3−1× 5−1×3 =2×3−1×5
• x as the number of U.S. dollars exchanged.
1= 2× 8−1×5 −1×5= 2×8−3×5
• y as the number of Canadian dollars exchanged.
1 = 2 × 8 − 3 × 13 − 1 × 8 = 5 × 8 − 3 × 13
1 = 5 × 86 − 6 × 13 − 3 × 13 = 5 × 86 − 13 × 13
Equation: 99𝑥 + 86𝑦 = 9763
𝑥 ≡ 45 × 53(𝑚𝑜𝑑86)
99𝑥 + 86𝑦 = 9763
𝑥 ≡ 2385(𝑚𝑜𝑑86)
86𝑦 = 9763 − 99𝑥
9763 − 99𝑥 2385 ÷ 86 ≈ 27.7326
𝑦= 2385 − 27 × 86 = 2385 − 2322 = 63
86
𝒙 ≡ 𝟔𝟑(𝒎𝒐𝒅𝟖𝟔)
99x≡45(mod86) Therefore, x=63+86k for some integer k.
9763 mod 86
99≡13(mod86)
9763÷86≈113.5232558
13x≡45(mod86) For k=0: x = 63
113×86=9718 99(63) + 86𝑦 = 976363) + 86𝑦 = 9763
86=6 x 13 + 8
9763 - 9718 = 45 6237 + 86𝑦 = 9763
13=1 x 8 + 5
9763≡45(mod86) 86𝑦 = 9763 – 6237
8= 1 x 5 +3
99x≡45(mod86) 86𝑦 = 3526
5= 1 x 3 + 2 Thus, the businessman exchanged
3= 1 x 2 + 1 3526
𝑦= 63 U.S. dollars and 41 Canadian
2=2 x 1 + 0 86
𝒚 = 𝟒𝟏 dollars to receive Php9,763.
 Linear Congruences
6. How many incongruent solutions does the linear congruence below have?
a. 𝟑𝒙 ≡ 𝟕 𝒎𝒐𝒅 𝟗 b. 𝟏𝟖𝒙 ≡ 𝟕 𝒎𝒐𝒅 𝟏𝟐

a. 3𝑥 ≡ 7 𝑚𝑜𝑑 9
GCD 3 , 9 = 3
3|7 (𝑓𝑎𝑙𝑠𝑒)
𝟑 𝒅𝒐𝒆𝒔 𝒏𝒐𝒕 𝒅𝒊𝒗𝒊𝒅𝒆 𝟕, 𝒕𝒉𝒆𝒓𝒆𝒇𝒐𝒓𝒆, 𝒕𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝒏𝒐 𝒔𝒐𝒍𝒖𝒕𝒊𝒐𝒏𝒔 𝒕𝒐 𝒕𝒉𝒆 𝒄𝒐𝒏𝒈𝒓𝒖𝒆𝒏𝒄𝒆 𝟑𝒙 ≡ 𝟕 (𝒎𝒐𝒅 𝟗)
b. 18𝑥 ≡ 7 𝑚𝑜𝑑 12
GCD 18 , 12 = 6
6|7 (𝑓𝑎𝑙𝑠𝑒)
𝟔 𝒅𝒐𝒆𝒔 𝒏𝒐𝒕 𝒅𝒊𝒗𝒊𝒅𝒆 𝟕, 𝒕𝒉𝒆𝒓𝒆𝒇𝒐𝒓𝒆, 𝒕𝒉𝒆𝒓𝒆 𝒂𝒓𝒆 𝒏𝒐 𝒔𝒐𝒍𝒖𝒕𝒊𝒐𝒏𝒔 𝒕𝒐 𝒕𝒉𝒆 𝒄𝒐𝒏𝒈𝒓𝒖𝒆𝒏𝒄𝒆 𝟏𝟖𝒙 ≡ 𝟕 𝒎𝒐𝒅 𝟏𝟐

In summary, both part a and b have no congruent solutions.

 Linear Congruences
𝒙 ≡ 𝟐(𝒎𝒐𝒅 𝟑)
7. Find the value of 𝑥 in the system of
ቐ𝒙 ≡ 𝟒(𝒎𝒐𝒅 𝟓)
linear congruences below 𝒙 ≡ 𝟓(𝒎𝒐𝒅 𝟕)

SOLUTION:
Express
𝑥 ≡ 2 (𝑚𝑜𝑑 3)
ቊ 𝑥 ≡ 15𝑛 + 14
𝑥 ≡ 4(𝑚𝑜𝑑 5)
𝑥 ≡ 3𝑘 + 12 → 𝑒𝑥𝑝𝑟𝑒𝑠𝑠 𝑎𝑛𝑑 𝑠𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑒 15𝑛 + 14 ≡ 5(𝑚𝑜𝑑𝑒 7)
3𝑘 + 2 ≡ 4 𝑚𝑜𝑑 5 So,
3𝑘 ≡ 2 𝑚𝑜𝑑 5 15𝑛 + 14 ≡ 1𝑛 + 0 ≡ 𝑛 + 14 ≡ 5 𝑚𝑜𝑑 7
𝑘 ≡ 2 ∗ 2 𝑚𝑜𝑑 5 𝑛 + 14 ≡ 5 𝑚𝑜𝑑 7
𝑘 ≡ 4 (𝑚𝑜𝑑 5) 𝑛 ≡ 5 − 14 𝑚𝑜𝑑 7 → 𝑛 ≡ −9 (𝑚𝑜𝑑 7)
Thus, ⟹ 𝑛 ≡ −2 (𝑚𝑜𝑑 7) → 𝑛 ≡ 5
𝑘 ≡ 5𝑚 + 4 𝑓𝑜𝑟 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 𝑚 Thus,
𝑥 ≡ 3 5𝑚 + 4 + 2 𝑛 ≡ 7𝑝 + 5
𝑥 ≡ 15𝑚 + 12 + 2 𝑥 = 15 7𝑝 + 5 + 14 = 105𝑝 + 75 + 14 = 105𝑝 + 89
𝑥 ≡ 15𝑚 + 14 So,
So, 𝑥 ≡ 89 (𝑚𝑜𝑑 105)
𝑥 ≡ 14(𝑚𝑜𝑑 15) 𝑻𝒉𝒆𝒓𝒆𝒇𝒐𝒓𝒆, 𝒕𝒉𝒆 𝒔𝒐𝒍𝒖𝒕𝒊𝒐𝒏 𝒕𝒐 𝒕𝒉𝒆 𝒔𝒚𝒔𝒕𝒆𝒎 𝒐𝒇 𝒍𝒊𝒏𝒆𝒂𝒓 𝒄𝒐𝒏𝒈𝒓𝒖𝒆𝒏𝒄𝒆 𝒊𝒔 𝟖𝟗.
 Eulers’, Fermat’s Little and Wilson’s Theorems
8. What is the remainder when 54! is
divided by 59?
SOLUTION:
𝑝 − 1 ! = −1 𝑚𝑜𝑑 𝑝 Thus;
𝑝 = 59 58! = −1 −2 −3 −4 × 54! (𝑚𝑜𝑑 59)
58! = −1 𝑚𝑜𝑑 59 −1 = 24 × 54! (𝑚𝑜𝑑 59)

Express, By Using Extended Euclidian Algorithm

58! in terms of 54! 24 × 24−1 = 1 𝑚𝑜𝑑 59
58! = 58 × 57 × 56 × 55 × 54! 24−1 = 37 (𝑚𝑜𝑑 59)
Reduce terms; −1 = 24 × 54! 𝑚𝑜𝑑 59
58 = −1 (𝑚𝑜𝑑 59) −37 = 54! (𝑚𝑜𝑑 59)
57 = −2 (𝑚𝑜𝑑 59) 54! = 22 (𝑚𝑜𝑑 59)
56 = −3 (𝑚𝑜𝑑 59)
55 = −4 (𝑚𝑜𝑑 59) Thus, 𝒓 = 𝟐𝟐 𝒘𝒉𝒆𝒓𝒆 𝒓 𝒊𝒔 𝒕𝒉𝒆 𝒓𝒆𝒎𝒂𝒊𝒏𝒅𝒆𝒓
 Eulers’, Fermat’s Little and Wilson’s Theorems
9. Determine the (i) number of integers relatively prime
to 136125, (ii) the number of its divisors and (iii) the sum of its divisors.

SOLUTION: ii. using formula of divisors 𝜏 𝑛

i. Euler Totient Function 𝜑 𝑛 𝜏 136125 = 3 + 1 3 + 1 2 + 1
1 1 1 𝜏 136125 = 4 4 3
𝜑 136125 = 136125 1 − 1− 1− 𝝉 𝟏𝟑𝟔𝟏𝟐𝟓 = 𝟒𝟖
3 5 11
2 4 10
𝜑 136125 = 136125 iii. Using formula of sum of its divisors 𝜎 𝑛
3 5 11
80 34 − 1 54 − 1 114 − 1
𝜑 136125 = 136125 𝜎(136125 =
165 3−1 5−1 11 − 1
𝝋 𝟏𝟑𝟔𝟏𝟐𝟓 = 𝟔𝟔𝟎𝟎𝟎 81 − 1 625 − 1 1331 − 1
𝜎(136125 =
2 2 10
𝜎(136125 = 40 156 133
𝝈(𝟏𝟑𝟔𝟏𝟐𝟓 = 𝟖𝟑𝟏, 𝟑𝟔𝟎
 Eulers’, Fermat’s Little and Wilson’s Theorems
10. What is the least positive residue of
𝟑𝟎𝟐𝟓𝟕 (𝑚𝑜𝑑 𝟐𝟑) ?
SOLUTION: Now compute 715 𝑚𝑜𝑑 23
30 ≡ 7 𝑚𝑜𝑑 23 72 ≡ 49
Use Fermat little theorem where, 72 ≡ 3 (𝑚𝑜𝑑 23)
𝑎𝑝−1 ≡ 1 𝑚𝑜𝑑 𝑝 𝑓𝑜𝑟 𝑝𝑟𝑖𝑚𝑒 𝑝 74 ≡ 33 ≡ 9 (𝑚𝑜𝑑 23)
722 ≡ 1 𝑚𝑜𝑑 23 78 ≡ 92 ≡ 81 ≡ 12 (𝑚𝑜𝑑 23)
Express, 257 𝑖𝑛 𝑡𝑒𝑟𝑚𝑠 𝑜𝑓 22
𝟐𝟓𝟕 = 𝟏𝟏 × 𝟐𝟐 + 𝟏𝟓 Thus,
715 ∗ 78 ∗ 74 ∗ 72 ∗ 7 ≡ 12 × 9 × 3 × 7 𝑚𝑜𝑑 23
722 ≡ 711 × 22+15 12 ∗ 9 ≡ 108 ≡ 16 𝑚𝑜𝑑 23
722 ≡ 722 11 × 715 16 ∗ 3 ≡ 48 = 2 𝑚𝑜𝑑 23
722 ≡ 1 11 × 715 2 ∗ 7 ≡ 14 𝑚𝑜𝑑𝑒 23
722 ≡ 1 × 715
𝟑𝟎𝟐𝟓𝟕 ≡ 𝟕𝟏𝟓 𝒎𝒐𝒅 𝟐𝟑 𝑺𝒐 𝒕𝒉𝒆 𝒍𝒆𝒂𝒔𝒕 𝒑𝒐𝒔𝒊𝒕𝒊𝒗𝒆 𝒓𝒆𝒔𝒊𝒅𝒖𝒆 𝟑𝟎𝟐𝟓𝟕 𝒎𝒐𝒅 𝟐𝟑 𝒊𝒔 𝟏𝟒
Perfect Numbers, Mersenne Numbers and Mersenne Primes

11. Show that 8128 is a perfect number

SOLUTION:
8128 = 26 27 − 1
= 26 × 127
• The proper divisors of 8128 are:
1, 2, 4, 8, 16, 32, 64, 127, 254, 508, 1016, 2032, 4064
• Sum of this divisors:
1 + 2 + 4 + 8 + 16 + 32 + 64 + 127 + 254 + 508 + 1016 + 2032
+ 4064 = 8128
THUS, 𝟖𝟏𝟐𝟖 𝒊𝒔 𝒂 𝒑𝒆𝒓𝒇𝒆𝒄𝒕 𝒏𝒖𝒎𝒃𝒆𝒓
Perfect Numbers, Mersenne Numbers and Mersenne Primes
12. Define and give example of Mersenne numbers and
Mersenne primes

SOLUTION:
A Mersenne number is of the form 𝑀𝑛 = 2𝑛 − 1 and a Mersenne prime is a
Mersenne number that is also a prime number.

Example:
𝑀3 = 23 − 1 = 7 which is a prime, so it is Mersenne prime
𝑀4 = 24 − 1 = 15 which is not a prime, so it is not Mersenne prime