Solution

Elementary Number Theory Problems 4.3 Solution (David M. Burton's 7th Edition) - Q3 Members Public

My Solution for "Find the last two digits of the number $9^{9^{9}}$. [Hint: $9^{9} \equiv 9 \pmod {10}$; hence, $9^{9^{9}} = 9^{9+10k}$; notice that $9^{9} \equiv 89 \pmod {100}$.]"

Ran
Ran
Math

Elementary Number Theory Problems 4.3 Solution (David M. Burton's 7th Edition) - Q2 Members Public

My solution for "Prove the following statements: (a) For any integer $a$, the units digit of $a^{2}$ is $0, 1, 4, 5, 6,$ or $9$. (b) Any one of the integers $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$ can occur as the units digit of $a^{3}$. (c) For any integer $a$, the units digit of $a^{4}$ is $0, 1, ...$ "

Ran
Ran
Math

Elementary Number Theory Problems 4.3 Solution (David M. Burton's 7th Edition) - Q1 Members Public

My Solution for "Use the binary exponentiation algorithm to compute both $19^{53} \pmod {503}$ and $141^{47} \pmod {1537}$. "

Ran
Ran
Math

Basic Techniques for Solving Theory of Congruence Problems - 1 Members Public

8 Basic Techniques for solving theory of congruence/Modular Arithmetic problems summarised from my solution on Chapter 4.2 Elementary Number Theory 7th Edition Problems (David M. Burton).

Ran
Ran
Math

Elementary Number Theory Problems 4.2 Solution (David M. Burton's 7th Edition) Members Public

My solutions for Burton's Elementary Number Theory Problems 4.2 (7th Edition)

Ran
Ran
Math

Elementary Number Theory Problems 4.2 Solution (David M. Burton's 7th Edition) - Q18 Members Public

My Solution for "If $a \equiv b \pmod {n_{1}}$ and $a \equiv c \pmod {n2}$, prove that $b \equiv c \pmod {n}$, where the integer $n = gcd(n_{1}, n_{2})$."

Ran
Ran
Math

Elementary Number Theory Problems 4.2 Solution (David M. Burton's 7th Edition) - Q17 Members Public

My Solution for "Prove that whenever $ab \equiv cd \pmod {n}$ and $b \equiv d \pmod {n}$, with $gcd(b, n) = 1$, then $a \equiv c \pmod {n}$."

Ran
Ran
Math

Elementary Number Theory Problems 4.2 Solution (David M. Burton's 7th Edition) - Q16 Members Public

My Solution for "Use the theory of congruences to verify that $$89 \mid 2^{44} - 1 \qquad \text{and} \qquad 97 \mid 2 ^{48} - 1$$"

Ran
Ran
Math