Number Theory Module for IOQM (Extended)

1. Divisibility and Euclidean Algorithm (Part 1)

Theory:

Divisibility rules determine if one number divides another exactly. The Euclidean Algorithm helps compute

GCD(a, b) using repeated division.

Example 1:

Find GCD(252, 105):

252 = 105*2 + 42

105 = 42*2 + 21

42 = 21*2 + 0 -> GCD = 21

Example 2:

Is 3 a divisor of 1458?

Check sum of digits: 1+4+5+8=18, divisible by 3 -> Yes.

Advanced:

Bézout's identity states there exist integers x, y such that ax + by = gcd(a, b).

2. Prime Numbers and Factorization (Part 1)

Theory:

A prime number is only divisible by 1 and itself. Every number >1 is either a prime or a product of primes.

Example 1:

List primes < 20: 2, 3, 5, 7, 11, 13, 17, 19

 Number Theory Module for IOQM (Extended)

Example 2:

Prime factorize 360:

360 = 2^3 * 3^2 * 5

Advanced:

Sieve of Eratosthenes is a method to generate primes up to n.

3. Congruences and Modular Arithmetic (Part 1)

Theory:

If a equiv b (mod n), then a and b leave the same remainder when divided by n.

You can add, subtract, and multiply both sides of congruences.

Example 1:

34 equiv 4 (mod 10)

Example 2:

Solve x equiv 3 (mod 5), x equiv 4 (mod 7) using trial or CRT.

Advanced:

Linear congruences ax equiv b (mod n) have solutions if gcd(a, n) divides b.

4. Fermat's Little Theorem and Euler's Theorem (Part 1)

Theory:

Fermat: a^(p-1) equiv 1 (mod p) if p is prime and a not divisible by p.

Euler: a^phi(n) equiv 1 (mod n) if a and n are coprime.

 Number Theory Module for IOQM (Extended)

Example 1:

7^4 mod 11 -> 2401 mod 11 = 4

Example 2:

Euler's theorem with a = 3, n = 10 (phi(10)=4): 3^4 = 81 equiv 1 (mod 10)

Advanced:

These theorems help solve large powers mod n efficiently.

5. Diophantine Equations (Part 1)

Theory:

These equations seek integer solutions. ax + by = c has a solution iff gcd(a, b) divides c.

Example 1:

Solve 6x + 9y = 30 -> gcd(6,9)=3, 3 divides 30 -> solutions exist.

Example 2:

Find all integer solutions of 4x + 5y = 1 using Extended Euclidean Algorithm.

Advanced:

Use parameterization: general solution is x = x0 + bt/g, y = y0 - at/g where g = gcd(a, b).

6. Number Theoretic Functions (Part 1)

Theory:

phi(n): numbers < n that are coprime to n.

sigma(n): sum of divisors.

 Number Theory Module for IOQM (Extended)

d(n): number of divisors.

Example 1:

phi(12) = 4 (coprime: 1, 5, 7, 11)

Example 2:

sigma(6) = 1 + 2 + 3 + 6 = 12

d(6) = 4

Advanced:

If n = p^a * q^b, then phi(n) = n*(1 - 1/p)*(1 - 1/q).

7. Miscellaneous Topics and Problem Solving (Part 1)

Theory:

Perfect numbers: sum of proper divisors = number (e.g. 6, 28)

Amicable numbers: each is the sum of proper divisors of the other.

Wilson's Theorem: (p-1)! equiv -1 (mod p) iff p is prime.

Example 1:

6: divisors 1,2,3 -> sum = 6 -> perfect

Example 2:

(4!) = 24, 24 mod 5 = -1 -> Wilson verified for p = 5

Advanced:
 Number Theory Module for IOQM (Extended)

Use these properties to verify primality or construct problems.

1. Divisibility and Euclidean Algorithm (Part 2)

Theory:

Divisibility rules determine if one number divides another exactly. The Euclidean Algorithm helps compute

GCD(a, b) using repeated division.

Example 1:

Find GCD(252, 105):

252 = 105*2 + 42

105 = 42*2 + 21

42 = 21*2 + 0 -> GCD = 21

Example 2:

Is 3 a divisor of 1458?

Check sum of digits: 1+4+5+8=18, divisible by 3 -> Yes.

Advanced:

Bézout's identity states there exist integers x, y such that ax + by = gcd(a, b).

2. Prime Numbers and Factorization (Part 2)

Theory:

A prime number is only divisible by 1 and itself. Every number >1 is either a prime or a product of primes.

Example 1:

List primes < 20: 2, 3, 5, 7, 11, 13, 17, 19

 Number Theory Module for IOQM (Extended)

Example 2:

Prime factorize 360:

360 = 2^3 * 3^2 * 5

Advanced:

Sieve of Eratosthenes is a method to generate primes up to n.

3. Congruences and Modular Arithmetic (Part 2)

Theory:

If a equiv b (mod n), then a and b leave the same remainder when divided by n.

You can add, subtract, and multiply both sides of congruences.

Example 1:

34 equiv 4 (mod 10)

Example 2:

Solve x equiv 3 (mod 5), x equiv 4 (mod 7) using trial or CRT.

Advanced:

Linear congruences ax equiv b (mod n) have solutions if gcd(a, n) divides b.

4. Fermat's Little Theorem and Euler's Theorem (Part 2)

Theory:

Fermat: a^(p-1) equiv 1 (mod p) if p is prime and a not divisible by p.

Euler: a^phi(n) equiv 1 (mod n) if a and n are coprime.

 Number Theory Module for IOQM (Extended)

Example 1:

7^4 mod 11 -> 2401 mod 11 = 4

Example 2:

Euler's theorem with a = 3, n = 10 (phi(10)=4): 3^4 = 81 equiv 1 (mod 10)

Advanced:

These theorems help solve large powers mod n efficiently.

5. Diophantine Equations (Part 2)

Theory:

These equations seek integer solutions. ax + by = c has a solution iff gcd(a, b) divides c.

Example 1:

Solve 6x + 9y = 30 -> gcd(6,9)=3, 3 divides 30 -> solutions exist.

Example 2:

Find all integer solutions of 4x + 5y = 1 using Extended Euclidean Algorithm.

Advanced:

Use parameterization: general solution is x = x0 + bt/g, y = y0 - at/g where g = gcd(a, b).

6. Number Theoretic Functions (Part 2)

Theory:

phi(n): numbers < n that are coprime to n.

 Number Theory Module for IOQM (Extended)

sigma(n): sum of divisors.

d(n): number of divisors.

Example 1:

phi(12) = 4 (coprime: 1, 5, 7, 11)

Example 2:

sigma(6) = 1 + 2 + 3 + 6 = 12

d(6) = 4

Advanced:

If n = p^a * q^b, then phi(n) = n*(1 - 1/p)*(1 - 1/q).

7. Miscellaneous Topics and Problem Solving (Part 2)

Theory:

Perfect numbers: sum of proper divisors = number (e.g. 6, 28)

Amicable numbers: each is the sum of proper divisors of the other.

Wilson's Theorem: (p-1)! equiv -1 (mod p) iff p is prime.

Example 1:

6: divisors 1,2,3 -> sum = 6 -> perfect

Example 2:

(4!) = 24, 24 mod 5 = -1 -> Wilson verified for p = 5

 Number Theory Module for IOQM (Extended)

Advanced:

Use these properties to verify primality or construct problems.

1. Divisibility and Euclidean Algorithm (Part 3)

Theory:

Divisibility rules determine if one number divides another exactly. The Euclidean Algorithm helps compute

GCD(a, b) using repeated division.

Example 1:

Find GCD(252, 105):

252 = 105*2 + 42

105 = 42*2 + 21

42 = 21*2 + 0 -> GCD = 21

Example 2:

Is 3 a divisor of 1458?

Check sum of digits: 1+4+5+8=18, divisible by 3 -> Yes.

Advanced:

Bézout's identity states there exist integers x, y such that ax + by = gcd(a, b).

2. Prime Numbers and Factorization (Part 3)

Theory:

A prime number is only divisible by 1 and itself. Every number >1 is either a prime or a product of primes.

Example 1:
 Number Theory Module for IOQM (Extended)

List primes < 20: 2, 3, 5, 7, 11, 13, 17, 19

Example 2:

Prime factorize 360:

360 = 2^3 * 3^2 * 5

Advanced:

Sieve of Eratosthenes is a method to generate primes up to n.

3. Congruences and Modular Arithmetic (Part 3)

Theory:

If a equiv b (mod n), then a and b leave the same remainder when divided by n.

You can add, subtract, and multiply both sides of congruences.

Example 1:

34 equiv 4 (mod 10)

Example 2:

Solve x equiv 3 (mod 5), x equiv 4 (mod 7) using trial or CRT.

Advanced:

Linear congruences ax equiv b (mod n) have solutions if gcd(a, n) divides b.

4. Fermat's Little Theorem and Euler's Theorem (Part 3)

Theory:

Fermat: a^(p-1) equiv 1 (mod p) if p is prime and a not divisible by p.

 Number Theory Module for IOQM (Extended)

Euler: a^phi(n) equiv 1 (mod n) if a and n are coprime.

Example 1:

7^4 mod 11 -> 2401 mod 11 = 4

Example 2:

Euler's theorem with a = 3, n = 10 (phi(10)=4): 3^4 = 81 equiv 1 (mod 10)

Advanced:

These theorems help solve large powers mod n efficiently.

5. Diophantine Equations (Part 3)

Theory:

These equations seek integer solutions. ax + by = c has a solution iff gcd(a, b) divides c.

Example 1:

Solve 6x + 9y = 30 -> gcd(6,9)=3, 3 divides 30 -> solutions exist.

Example 2:

Find all integer solutions of 4x + 5y = 1 using Extended Euclidean Algorithm.

Advanced:

Use parameterization: general solution is x = x0 + bt/g, y = y0 - at/g where g = gcd(a, b).

6. Number Theoretic Functions (Part 3)

Theory:
 Number Theory Module for IOQM (Extended)

phi(n): numbers < n that are coprime to n.

sigma(n): sum of divisors.

d(n): number of divisors.

Example 1:

phi(12) = 4 (coprime: 1, 5, 7, 11)

Example 2:

sigma(6) = 1 + 2 + 3 + 6 = 12

d(6) = 4

Advanced:

If n = p^a * q^b, then phi(n) = n*(1 - 1/p)*(1 - 1/q).

7. Miscellaneous Topics and Problem Solving (Part 3)

Theory:

Perfect numbers: sum of proper divisors = number (e.g. 6, 28)

Amicable numbers: each is the sum of proper divisors of the other.

Wilson's Theorem: (p-1)! equiv -1 (mod p) iff p is prime.

Example 1:

6: divisors 1,2,3 -> sum = 6 -> perfect

Example 2:

(4!) = 24, 24 mod 5 = -1 -> Wilson verified for p = 5

 Number Theory Module for IOQM (Extended)

Advanced:

Use these properties to verify primality or construct problems.

1. Divisibility and Euclidean Algorithm (Part 4)

Theory:

Divisibility rules determine if one number divides another exactly. The Euclidean Algorithm helps compute

GCD(a, b) using repeated division.

Example 1:

Find GCD(252, 105):

252 = 105*2 + 42

105 = 42*2 + 21

42 = 21*2 + 0 -> GCD = 21

Example 2:

Is 3 a divisor of 1458?

Check sum of digits: 1+4+5+8=18, divisible by 3 -> Yes.

Advanced:

Bézout's identity states there exist integers x, y such that ax + by = gcd(a, b).

2. Prime Numbers and Factorization (Part 4)

Theory:

A prime number is only divisible by 1 and itself. Every number >1 is either a prime or a product of primes.
 Number Theory Module for IOQM (Extended)

Example 1:

List primes < 20: 2, 3, 5, 7, 11, 13, 17, 19

Example 2:

Prime factorize 360:

360 = 2^3 * 3^2 * 5

Advanced:

Sieve of Eratosthenes is a method to generate primes up to n.

3. Congruences and Modular Arithmetic (Part 4)

Theory:

If a equiv b (mod n), then a and b leave the same remainder when divided by n.

You can add, subtract, and multiply both sides of congruences.

Example 1:

34 equiv 4 (mod 10)

Example 2:

Solve x equiv 3 (mod 5), x equiv 4 (mod 7) using trial or CRT.

Advanced:

Linear congruences ax equiv b (mod n) have solutions if gcd(a, n) divides b.

4. Fermat's Little Theorem and Euler's Theorem (Part 4)

Theory:
 Number Theory Module for IOQM (Extended)

Fermat: a^(p-1) equiv 1 (mod p) if p is prime and a not divisible by p.

Euler: a^phi(n) equiv 1 (mod n) if a and n are coprime.

Example 1:

7^4 mod 11 -> 2401 mod 11 = 4

Example 2:

Euler's theorem with a = 3, n = 10 (phi(10)=4): 3^4 = 81 equiv 1 (mod 10)

Advanced:

These theorems help solve large powers mod n efficiently.

5. Diophantine Equations (Part 4)

Theory:

These equations seek integer solutions. ax + by = c has a solution iff gcd(a, b) divides c.

Example 1:

Solve 6x + 9y = 30 -> gcd(6,9)=3, 3 divides 30 -> solutions exist.

Example 2:

Find all integer solutions of 4x + 5y = 1 using Extended Euclidean Algorithm.

Advanced:

Use parameterization: general solution is x = x0 + bt/g, y = y0 - at/g where g = gcd(a, b).

6. Number Theoretic Functions (Part 4)

 Number Theory Module for IOQM (Extended)

Theory:

phi(n): numbers < n that are coprime to n.

sigma(n): sum of divisors.

d(n): number of divisors.

Example 1:

phi(12) = 4 (coprime: 1, 5, 7, 11)

Example 2:

sigma(6) = 1 + 2 + 3 + 6 = 12

d(6) = 4

Advanced:

If n = p^a * q^b, then phi(n) = n*(1 - 1/p)*(1 - 1/q).

7. Miscellaneous Topics and Problem Solving (Part 4)

Theory:

Perfect numbers: sum of proper divisors = number (e.g. 6, 28)

Amicable numbers: each is the sum of proper divisors of the other.

Wilson's Theorem: (p-1)! equiv -1 (mod p) iff p is prime.

Example 1:

6: divisors 1,2,3 -> sum = 6 -> perfect

Example 2:
 Number Theory Module for IOQM (Extended)

(4!) = 24, 24 mod 5 = -1 -> Wilson verified for p = 5

Advanced:

Use these properties to verify primality or construct problems.

1. Divisibility and Euclidean Algorithm (Part 5)

Theory:

Divisibility rules determine if one number divides another exactly. The Euclidean Algorithm helps compute

GCD(a, b) using repeated division.

Example 1:

Find GCD(252, 105):

252 = 105*2 + 42

105 = 42*2 + 21

42 = 21*2 + 0 -> GCD = 21

Example 2:

Is 3 a divisor of 1458?

Check sum of digits: 1+4+5+8=18, divisible by 3 -> Yes.

Advanced:

Bézout's identity states there exist integers x, y such that ax + by = gcd(a, b).

2. Prime Numbers and Factorization (Part 5)

Theory:

A prime number is only divisible by 1 and itself. Every number >1 is either a prime or a product of primes.
 Number Theory Module for IOQM (Extended)

Example 1:

List primes < 20: 2, 3, 5, 7, 11, 13, 17, 19

Example 2:

Prime factorize 360:

360 = 2^3 * 3^2 * 5

Advanced:

Sieve of Eratosthenes is a method to generate primes up to n.