The Order of An Integer Modulo N - Report On Number Theory
Uploaded by
Polemer Cuarto IVThe Order of An Integer Modulo N - Report On Number Theory
Uploaded by
Polemer Cuarto IVSubject: Number Theory
Polemer M. Cuarto
The Order of an Integer Modulo n
Definition 8.1. Let n > 1 and gcd(a, n)= 1.The order of a modulo n is the smallest positive integer k such that ak 1(mod n).
Example 1: Consider the successive powers of 2 modulo 7. For this modulus, we obtain the congruence, 21 2 22 4 23 1 24 2 25 4 26 1 from which it follows that the integer 2 has order 3 modulo 7. Exanple 2: Consider the successive powers of 3 modulo 8. For this modulus, we obtain the congruence, 31 3 32 1 33 3 34 1 from which it follows that the integer 3 has order 2 modulo 8.
Theorem 8.1. Let the integer have an order k modulo n. Then ah if and only if k | h; in particular, k | n.
1(mod n)
From the first example, 3 is the order of 2 modulo 7. From there, k = 3, a = 2 and n = 7. For theorem 8.1 be satisfied, h should be divisible by k which means that in the given example, h should be divisible by 3. Thus, h could be 6,9,12,15
Theorem 8.2. If the integer k has order k modulo n, then ai and only if i j (mod k).
aj (mod n) if
From the first example, 3 is the order of 2 modulo 7. From there, k = 3, a = 2 and n = 7. Condition: ai aj(mod n) iff i j(mod k). Proof: Let j = 0 and i = 6. i j(mod k) 6 0(mod 3) ai aj(mod n) 26 20(mod 7) 64 1(mod 7)
Corollary: If a has order k modulo n, then the integers a, a2,a3ak are incongruent modulo n.
1|p o lem er m. cu ar t o
Subject: Number Theory
Polemer M. Cuarto
Theorem 8.3. If the integer a has k modulo n and h > 0, then ah has order k / gcd(h,k) modulo n.
From the first example, 3 is the order of 2 modulo 7. From there, k = 3, a = 2 and n = 7. Proof: Let h = 6. ah has order k / gcd(h,k) modulo n 26 has order 3 / gcd(6,3) modulo 7 64 has order 3 / 3 modulo 7 64 has order 1 modulo 7
Corollary: Let a have order k modulo n. Then ah also has order k if and only if gcd(h,k) = 1.
From the first example, 3 is the order of 2 modulo 7. From there, k = 3, a = 2 and n = 7. Condition: ah has order k if and only if gcd(h,k) = 1. Proof: Let h = 4. gcd(h,k) = 1 gcd(4,3) = 1 k is the order of ah (mod 7) 3 is the order of 24 (mod 7) 3 is the order of 16 (mod 7)
Definition 8.2. If gcd(a,n) = 1 and a is of order n , then a is a primitive root of the integer n.
36 It is easy to see that 3 is a primitive root of 7, for 31 1(mod 7). 3, 32 4, 33 6, 34 4, 35 5,
Theorem 8.4. Let gcd(a,n) =1 and let a1,a2,,a n be the positive integers less than n and relatively prime to n. If a is a primitive root of n, then a, a2,,a n are congruent modulo n to a1,a2,,a n in some order.
Proof: Let a = 3 and n = 8. gcd(a,n) = 1 gcd(3,8) = 1 1, 3, 5 and 7 are relatively prime to 8. From here, 4 is a primitive root of 8 because 34
1 (mod 8)
2|p o lem er m. cu ar t o
Subject: Number Theory
Polemer M. Cuarto
Exercises: 1. Find the order of the integers 2, 3 and 5: a. modulo 17 b. modulo 19 c. modulo 23 2. Find the primitive root/s of the following: a. 8 b. 10 c. 20 3. Evaluate n if n is equal to: a. 18 b. 35 c. 40 References: Elementary Number Theory by David M. Burton Introduction to Number Theory by David Savtt Elementary Number Theory : Primes, Congruences and Secrets by William Stein
3|p o lem er m. cu ar t o
