DOCSLIB.ORG

Number Theory and Graph Theory Chapter 4 Primitive Roots And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Number Theory and Graph Theory Chapter 4 Primitive Roots And 1 Number Theory and Graph Theory Chapter 4 Primitive roots and Quadratic residues By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: [email protected] 2 Module-1: Primitive roots Objectives • Group of units of Zn(= f0;1;2;:::;n − 1g). • Order of an integer Modulo n, where n 2 N: • Primitive roots of n. Let n 2 N: We write Un = fx 2 Nj1 ≤ x ≤ n;(x;n) = 1g. So, Un is set of all numbers from 1 to n that are relatively prime to n. For example, U8 = f1;3;5;7g, U12 = f1;5;7;11g;Up = f1;2;3;:::; p − 1g: Why are we interested in these numbers? • As we know Zn = f0;1;2;:::;n − 1g forms a group with respect to addition modulo n: But, ∗ in general, Zn = Zn n f0g does not form a group with respect to multiplication modulo n. ∗ • For example Z6 = f0;1;2;3;4;5g is a group with respect to addition modulo 6, but Z6 = Z6 nf0g = f1;2;3;4;5g is not a group with respect to multiplication modulo 6 as 2∗3 = 6 ≡ 0 (mod 6): Also, the elements 2;3 and 4 do not have multiplicative inverses modulo 6. Or equivalently, ax ≡ 1 (mod 6) does not have a solution whenever a = 2;3;4: • Next obvious question is “Is Un = fx 2 Nj1 ≤ x ≤ n;(x;n) = 1g a group with respect to multiplication modulo n:” Answer: YES. Verify it. 3 • The next question is “Is Un = fx 2 Nj1 ≤ x ≤ n;(x;n) = 1g cyclic for all n 2 N”?. Answer: NO. For example, U8 is not cyclic. In general, Un is cyclic whenever n = 2;4; pk;2pk k ≥ 1, where p is an odd prime. For n = 2;4; pk;2pk k ≥ 1, the generators of Un are called primitive roots modulo n. • For example, for n = 5, U5 = f1;2;3;4g and 2;3 are primitive roots modulo 5. As 0 1 2 3 U5 = f2 ;2 ≡ 2 (mod 5);2 ≡ 4 (mod 5);2 ≡ 3 (mod 5)g: Verify that 3 is also a primitive root modulo 5. In other words 2 and 3 are generators of the cyclic group U5. • Further, Un is the set of all generators of the additive cyclic group Zn, addition modulo n. That is, Un is the collection of all elements in Zn that have multiplicative inverses. Hence, Un is called the group of units of Zn. The Order of an Integer (n) Fix a positive integer n. Then, by Euler’s theorem, for any a 2 N;gcd(a;n) = 1, one has aj ≡ 1 (mod n): Therefore, there exists a smallest positive integer, say x, such that ax ≡ 1 (mod n) and ak 6≡ 1 (mod n), for 1 ≤ k ≤ x − 1. Definition 1. Fix a positive integer n and let a 2 N with gcd(a;n) = 1. 1. Then, the least positive integer x such that ax ≡ 1 (mod n) is called the order of a modulo n, denoted ordn(a): 2. If ordn(a) = j(n) then, a is said to be a primitive root modulo n. For example, for n = 13, 31 ≡ 3 (mod 13);32 ≡ 9 (mod 13);33 ≡ 1 (mod 13): 4 2 So ord13(3) = 3, 12 ≡ 1 (mod 13) so ord13(12) = 2: (In fact n − 1 ≡ −1 (mod n) for every n and hence ordn(n − 1) = 2.) Whereas, ord13(2) = 12 = j(13), so 2 is a primitive root modulo 13. Problem 2. 1. Show that there are no primitive roots modulo 8. 2 2 2 Solution:U8 = f1;3;5;7g it is easy to check that 3 ≡ 5 ≡ 7 ≡ 1 (mod 8): Hence ord8(a) ≤ 2 for all a 2 U8: 2. Show that there are no primitive roots modulo 16. Solution:U16 = f1;3;5;7;9;11;13;15g. So j(16) = jU16j = 8: Verify that 4 a ≡ 1 (mod 16); for all a 2 U16: Hence, there is no element a with (a;16) = 1 such that ord16(a) = 8 = j(16): 3. Fix a positive integer n and let a 2 N such that gcd(a;n) = 1. If a is primitive root of n and Un = fa1;a2;:::;aj(n)g then, 2 j(n) fa1;a2;:::;aj(n)g ≡ fa;a ;:::;a g (mod n): Solution:As a is a primitive root modulo n, the numbers ai (mod n) and a j (mod n) are distinct, whenever 1 ≤ i 6= j ≤ j(n) − 1. Moreover, gcd(a;n) = 1 implies that gcd(ak;n) = 1 for all 1 ≤ k ≤ j(n): Thus, the required result follows. 4. Fix a positive integer n and assume that n has a primitive root. Then, the number of primitive roots of n equals j(j(n)). Solution:Note that if a is a primitive root modulo n then, ordn(a) = j(n). Now, observe that k for 1 ≤ k ≤ j(n), ordn(a ) = j(n) if and only if gcd(k;j(n)) = 1. But, by definition jfk : 1 ≤ k ≤ j(n);gcd(k;j(n)) = 1gj = j(j(n)) and hence the required result follows. 5 5. Find all primitive roots modulo 13: Solution:Using the example given before Problem 2, we see that 2 is a primitive root modulo 13. As j(13) = 12 and the number 1;5;7 and 11 are coprime to 12, we see that 2 = 21;6 ≡ 25 (mod 13);11 ≡ 27 (mod 13) and 7 ≡ 211 (mod 13) are the primitive roots modulo 13. Thus, the number of primitive roots modulo 13 equals 4 = j(j(13)) = j(12). k Theorem 3. Let n = 2 , for some positive integer k. Then, n has a primitive root modulo n (Un is cyclic) whenever k = 1 or k = 2. Proof. If k = 1 or k = 2 then, U2 = f1g and U4 = f1;3g are indeed cyclic. So, we now show that k k−1 U2k is not cyclic for k ≥ 3: To do so, it is sufficient to prove that ord2k (x) < j(2 ) = 2 ; for all 2k−2 k x 2 U2k : In fact, we will use induction to show that x ≡ 1 (mod 2 ), for all x 2 U2k whenever k ≥ 3: Base case k = 3 In Problem 2.1 we showed that U8 is not cyclic and hence has no primitive root modulo 8. Induction hypothesis Suppose the result is true for k, where k ≥ 3: That is, we assume that 2k−2 k 2k−2 k x ≡ 1 (mod 2 ), for all x 2 U2k with k ≥ 3: Or equivalently, x = 1 + m2 for some positive integer m: We will now prove the result for k + 1. That is, we need to show that for 2k−1 k+1 every y 2 U2k+1 , y ≡ 1 (mod 2 ). k k k So, let y 2 U2k+1 . Then, either 1 ≤ y < 2 or y = x + 2 with 1 ≤ x < 2 . In either case, y = x +t2k, where t 2 f0;1g and 1 ≤ x < 2k. Hence, using k ≥ 3 and the binomial theorem, we have k−1 k−1 k−1 k−2 y2 = (x +t2k)2 ≡ x2 (mod 2k+1) ≡ (x2 )2 (mod 2k+1): k−2 Thus, using x2 = 1 + m2k for some positive integer m and k ≥ 3, we get k−1 k−2 y2 ≡ (x2 )2 (mod 2k+1) ≡ (1 + m2k)2 = 1 + m2k+1 + m222k ≡ 1 (mod 2k+1): 6 We will now show that Upk is cyclic for all odd primes p and for all k ≥ 1. To do so, we need the following results. n n−1 Theorem 4 (Division algorithm). Let f (x) = anx + an−1x + ··· + a1x + a0 be a polynomial m m−1 of degree n ≥ 1 with integer coefficients. If g(x) = x + bm−1x + ··· + b1x + b0 is a non- zero polynomial then there exists unique polynomials q(x) and r(x) with integer coefficients such that f (x) = g(x)q(x) + r(x) with either r(x) is identically the zero polynomial or deg(r(x)) < deg(g(x)) = m. Proof. We first proof the existence of the polynomials q(x) and r(x). The result is clearly true if deg( f (x)) < deg(g(x)) as in this case, f (x) = 0g(x) + f (x). So, let the result be true for all polynomials of degree n − 1 and consider the polynomial f (x) of degree n. If n < m, we are done. So, let us assume that n ≥ m. Then, we see that the n−m polynomial h(x) = f (x) − anx g(x) has integer coefficients and deg(h(x)) ≤ n − 1. Thus, be induction hypothesis, there exists polynomials q1(x) and r1(x) with integer coefficients such that n−m f (x) − anx g(x) = h(x) = g(x)q1(x) + r1(x) n−m with either r1(x) as the zero polynomial of deg(r1(x)) < deg(g(x)). Hence, f (x) = g(x)(anx + q1(x))+ n−m r1(x). Thus, we obtained the required result as we have obtained q(x) = anx + q1(x) and r(x) = r1(x). The proof of uniqueness is left for the reader. Lemma 5. Let f (x) be a polynomial of degree n ≥ 1 with integer coefficients. Then, f (a) is the remainder when f (x) is divided by x − a. Proof. The division algorithm applied to the polynomials f (x) and x−a gives us unique polynomials q(x) and r(x) such that f (x) = (x − a)q(x) + r(x), with either r(x) as the zero polynomial or deg(r(x)) < deg(x − a) = 1.
Load more

Recommended publications
  • Elementary Number Theory
    Elementary Number Theory Peter Hackman HHH Productions November 5, 2007 ii c P Hackman, 2007. Contents Preface ix A Divisibility, Unique Factorization 1 A.I The gcd and B´ezout . 1 A.II Two Divisibility Theorems . 6 A.III Unique Factorization . 8 A.IV Residue Classes, Congruences . 11 A.V Order, Little Fermat, Euler . 20 A.VI A Brief Account of RSA . 32 B Congruences. The CRT. 35 B.I The Chinese Remainder Theorem . 35 B.II Euler’s Phi Function Revisited . 42 * B.III General CRT . 46 B.IV Application to Algebraic Congruences . 51 B.V Linear Congruences . 52 B.VI Congruences Modulo a Prime . 54 B.VII Modulo a Prime Power . 58 C Primitive Roots 67 iii iv CONTENTS C.I False Cases Excluded . 67 C.II Primitive Roots Modulo a Prime . 70 C.III Binomial Congruences . 73 C.IV Prime Powers . 78 C.V The Carmichael Exponent . 85 * C.VI Pseudorandom Sequences . 89 C.VII Discrete Logarithms . 91 * C.VIII Computing Discrete Logarithms . 92 D Quadratic Reciprocity 103 D.I The Legendre Symbol . 103 D.II The Jacobi Symbol . 114 D.III A Cryptographic Application . 119 D.IV Gauß’ Lemma . 119 D.V The “Rectangle Proof” . 123 D.VI Gerstenhaber’s Proof . 125 * D.VII Zolotareff’s Proof . 127 E Some Diophantine Problems 139 E.I Primes as Sums of Squares . 139 E.II Composite Numbers . 146 E.III Another Diophantine Problem . 152 E.IV Modular Square Roots . 156 E.V Applications . 161 F Multiplicative Functions 163 F.I Definitions and Examples . 163 CONTENTS v F.II The Dirichlet Product .
    [Show full text]
  • Arxiv:Math/0412262V2 [Math.NT] 8 Aug 2012 Etrgae Tgte Ihm)O Atnscnetr and Conjecture fie ‘Artin’S Number on of Cojoc Me) Domains’
    ARTIN’S PRIMITIVE ROOT CONJECTURE - a survey - PIETER MOREE (with contributions by A.C. Cojocaru, W. Gajda and H. Graves) To the memory of John L. Selfridge (1927-2010) Abstract. One of the first concepts one meets in elementary number theory is that of the multiplicative order. We give a survey of the lit- erature on this topic emphasizing the Artin primitive root conjecture (1927). The first part of the survey is intended for a rather general audience and rather colloquial, whereas the second part is intended for number theorists and ends with several open problems. The contribu- tions in the survey on ‘elliptic Artin’ are due to Alina Cojocaru. Woj- ciec Gajda wrote a section on ‘Artin for K-theory of number fields’, and Hester Graves (together with me) on ‘Artin’s conjecture and Euclidean domains’. Contents 1. Introduction 2 2. Naive heuristic approach 5 3. Algebraic number theory 5 3.1. Analytic algebraic number theory 6 4. Artin’s heuristic approach 8 5. Modified heuristic approach (`ala Artin) 9 6. Hooley’s work 10 6.1. Unconditional results 12 7. Probabilistic model 13 8. The indicator function 17 arXiv:math/0412262v2 [math.NT] 8 Aug 2012 8.1. The indicator function and probabilistic models 17 8.2. The indicator function in the function field setting 18 9. Some variations of Artin’s problem 20 9.1. Elliptic Artin (by A.C. Cojocaru) 20 9.2. Even order 22 9.3. Order in a prescribed arithmetic progression 24 9.4. Divisors of second order recurrences 25 9.5. Lenstra’s work 29 9.6.
    [Show full text]
  • MAS330 FULL NOTES Week 1. Euclidean Algorithm, Linear
    MAS330 FULL NOTES Week 1. Euclidean Algorithm, Linear congruences, Chinese Remainder Theorem Elementary Number Theory studies modular arithmetic (i.e. counting modulo an integer n), primes, integers and equations. This week we review modular arithmetic and Euclidean algorithm. 1. Introduction 1.1. What is Number Theory? Not trying to answer this directly, let us mention some typical questions we will deal with in this course. Q. What is the last decimal digit of 31000? A. The last decimal digit of 31000 is 1. This is a simple computation we'll do using Euler's Theorem in Week 4. Q. Is there a formula for prime numbers? A. We don't know if any such formula exists. P. Fermat thought that all numbers of the form 2n Fn = 2 + 1 are prime, but he was mistaken! We study Fermat primes Fn in Week 6. Q. Are there any positive integers (x; y; z) satisfying x2 + y2 = z2? A. There are plenty of solutions of x2 + y2 = z2, e.g. (x; y; z) = (3; 4; 5); (5; 12; 13). In fact, there are infinitely many of them. Ancient Greeks have written the formula for all the solutions! We'll discover this formula in Week 8. Q. How about xn + yn = zn for n ≥ 3? A. There are no solutions of xn + yn = zn in positive integers! This fact is called Fermat's Last Theorem and we discuss it in Week 8. Q. Which terms of the Fibonacci sequence un = f1; 1; 2; 3; 5; 8; 13; 21; 34; 55; 89; 144; 233;::: g are divisible by 3? A.
    [Show full text]
  • Introduction to Number Theory
    Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: ℕ={0 ,1, 2,} . Integers: ℤ={0 ,±1,±2,} . Definition: Divisor ∣ If a∈ℤ can be writeen as a=bc where b , c∈ℤ , then we say a is divisible by b or, b divides a (denoted b a ), or b is a divisor of a . Definition: Prime We call a number p≥2 prime if its only positive divisors are 1 and p . Definition: Congruent ∣ − If d ≥2 , d ∈ℕ , we say integers a and b are congruent modulo d if d a b and write it a≡bmod d . Examples of Number Theory Questions 1. What are the solutions to a 2b2 =c2 ? s2 −t 2 s2 t 2 Answer: a=s t , b= , c= . 2 2 2. Fundamental Theorem of Arithmetic. Each integer can be written as a product of primes; moreover, the representation is unique up to the order of factors. 3. Theorem (Euclid). There are infinitely many prime numbers. 4. Suppose a , b=1 , i.e. a and d have no common divisors except 1. Are there infinitely many primes ≡ p a mod d ? Equivalently, are there infinitely many prime values of the linear polynomial dxa , x∈ℤ ? Answer: Yes (Dirichlet, 1837). 5. Are there infinitely many primes of the form p=x 21, x∈ℤ ? Not known, expect yes. It is known that there are infinitely many numbers n=x 21 such that n is either prime or has 2 prime factors. 2 2 = ≡ 6. What primes can be written as p=a b ? Answer: If p 2 or p 1 mod 4 .
    [Show full text]
  • Primitive Roots
    Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are there- fore generators in that sense, and their properties will be very instrumental in subsequent developments of the theory of congruences, especially where exponentiation is involved. 5.1 Orders and Primitive Roots With gcd(a, n) = 1, we know that the sequence a % n, a2 % n, a3 % n, . must eventually reach 1 and make a loop back to the first term. In fact, Euler’s theorem says that the length of this periodicity is at most φ(n). We will define this length, for a given a, and ask whether it can sometimes equal φ(n). Definition. Suppose a and n > 0 are relatively prime. The order of a modulo n is the smallest positive integer k such that ak % n = 1. We denote this quantity by |a|n, or simply |a| when there is no ambiguity. For example, |2|7 = 3 because x = 3 is the smallest positive solution to the congruence 2x ≡ 1 (mod 7). Exercise 5.1. Find these orders. a) |3|7 b) |3|10 c) |5|12 d) |7|24 e) |4|25 Exercise 5.2. Suppose |a| = 6. Find |ak| for k = 2, 3, 4, 5, 6. 43 44 Theory of Numbers From now on we agree that the notation |a|n implicitly assumes the condition gcd(a, n) = 1, for otherwise it makes no sense. In particular, by Euler’s theorem, |a|n ≤ φ(n).
    [Show full text]
  • Distribution of Quadratic Non-Residues Which Are Not Primitive Roots
    DISTRIBUTION OF QUADRATIC NON-RESIDUES WHICH ARE NOT PRIMITIVE ROOTS S. GUN, B. RAMAKRISHNAN, B. SAHU AND R. THANGADURAI Abstract. In this article, we shall study, using elementary and combinatorial methods, the distribution of quadratic non-residues which are not primitive roots modulo ph or 2ph for an odd prime p and h 1 is an integer. ≥ 1. Introduction Distribution of quadratic residues, non-residues and primitive roots modulo n for any positive integer n is one of the classical problems in Number Theory. In this article, by applying elementary and combinatorial methods, we shall study the distribution of quadratic non-residues which are not primitive roots modulo odd prime powers. Let n be any positive integer and p be any odd prime number. We denote the additive cyclic group of order n by Zn: The multiplicative group modulo n is denoted by Zn∗ of order φ(n); the Euler phi function. Definition 1.1. A primitive root g modulo n is a generator of Zn∗ whenever Zn∗ is cyclic. A well-known result of C. F. Gauss says that Zn∗ has a primitive root g if and only if n = 2; 4 or ph or 2ph for any positive integer h 1: Moreover, the number of primitive roots modulo these n's is equal to φ(φ(n)):≥ Definition 1.2. Let n 2 and a be integers such that (a; n) = 1: If the quadratic congruence ≥ x2 a (mod n) ≡ has an integer solution x; then a is called a quadratic residue modulo n. Otherwise, a is called a quadratic non-residue modulo n: 2` 1 Whenever Zn∗ is cyclic and g is a primitive root modulo n; then g − for ` = 1; 2 ; φ(n)=2 are all the quadratic non-residue modulo n and g2` for ` = · · · 2` 1 0; 1; ; φ(n)=2 1 are all the quadratic residue modulo n: Also, g − for all ` = 1·;·2· ; ; φ(n−)=2 such that (2` 1; φ(n)) > 1 are all the quadratic non-residues which are· · not· primitive roots modulo− n: For a positive integer n; set M(n) = g Zn∗ g is a primitive root modulo n f 2 j g 2000 Mathematics Subject Classification.
    [Show full text]
  • Arxiv:1911.08176V1 [Math.NT]
    A GENERALIZATION OF A RESULT OF GAUSS ON PRIMITIVE ROOT HAO ZHONG AND TIANXIN CAI Abstract. A primitive root modulo an integer n is the generator of the multiplicative group of integers modulo n. Gauss proved that for any prime number p greater than 3, the sum of its primitive roots is congruent to 1 modulo p while its product is congruent to µ(p − 1) modulo p, where µ is the M¨obius function. In this paper, we will generalize these two interesting congruences and give the congruences of the sum and the product of integers with the same index modulo n. 1. Introduction Let a and n be two relatively prime integers. The index of a modulo n, denoted by k indn(a), is the smallest positive number k such that a ≡ 1 (mod n). If indn(a)= φ(n), where φ is the Euler’s totient function, then we say a is a primitive root modulo n. Primitive roots are widely used in cryptography, such as attacking the discrete log problem, key exchange problem and many other public key cryptosystem. The primitive root theorem identifies all moduli which primitive roots exist, that is, 1, 2, 4, pα and 2pα where p is an odd prime and α is a positive integer. For an odd prime p > 3, Gauss obtained the following congruences in Article 81, Theorem 1.1 (Gauss). g ≡ 1 (mod p). is a primitive root mod g Y p Theorem 1.2 (Gauss). arXiv:1911.08176v1 [math.NT] 19 Nov 2019 g ≡ µ(p − 1) (mod p).
    [Show full text]
  • Topics in Primitive Roots N
    Topics In Primitive Roots N. A. Carella Abstract: This monograph considers a few topics in the theory of primitive roots modulo a prime p≥ 2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g *(p) modulo p, a large prime, are determined. One of the estimate here seems to sharpen the Burgess estimate g(p)≪p 1/4+ϵ for arbitrarily small number ϵ> 0, to the smaller estimate g(p)≪p 5/loglogp uniformly for all large primes p⩾ 2. The expected order of magnitude is g(p)≪(logp) c, c> 1 constant. The corre- sponding estimates for least prime primitive roots g*(p) are slightly higher. The last topics deal with Artin conjecture and its generalization to the set of integers. Some effective lower bounds such as {p⩽x : ord(g)=p-1}≫x(logx) -1 for the number of primes p⩽x with a fixed primitive root g≠±1,b 2 for all large number x⩾ 1 will be provided. The current results in the literature have the lower bound {p⩽x : ord(g)=p-1}≫x(logx) -2, and have restrictions on the minimal number of fixed integers to three or more. Mathematics Subject Classifications: Primary 11A07, Secondary 11Y16, 11M26. Keywords: Prime number; Primitive root; Least primitive root; Prime primitive root; Artin primitive root conjecture; Cyclic group. Copyright 2015 ii Table Of Contents 1. Introduction 1.1. Least Primitive Roots 1.2. Least Prime Primitive Roots 1.3. Subsets of Primes with a Fixed Primitive Roots 1.4.
    [Show full text]
  • Number Theory Week 10
    Week 10 Summary Lecture 19 The following proposition is proved by exactly the same argument used to prove the second statement in the Fermat-Euler Theorem (see Lecture 12, Week 6). + *Proposition: Let a, n Z , and suppose that gcd(a, n) = 1. Let m = ordn(a). Then ak 1 (mod n) if and∈ only if m k. ≡ | We made use of this in Lecture 18 in the proof of the following result. *Proposition: Let p be prime and q any prime divisor of p 1. Let p 1 = qnK where K is not divisible by q. Then there is some integer t whose− order− modulo p is qn. K qn p 1 The point is that since (t ) = t − 1 (mod p) the preceding proposition tells K n ≡ us that ordp(t ) is a divisor of q for all nonzero t in Zp. But the only divisor n n 1 n of q that is not also a divisor of q − is q itself; so if there is no t such that n 1 K n K q − ordp(t ) = q then (t ) 1 = 0 for all nonzero t Zp. This is impossible − ∈ since a polynomial equation of degree less than p 1 cannot have p 1 roots in Zp. − − *Theorem: Let p be a prime. There there is an integer t such that ordp(t) = p 1. That is, there exists a primitive root modulo p. − n1 n2 nr If we factorize p 1 as q q q , where the qi are distinct primes, then the − 1 2 ··· r preceding proposition tells us that for each i there exists an element ti such that ni ordp(ti) = qi .
    [Show full text]
  • An Exploration of Mathematical Applications in Cryptography
    AN EXPLORATION OF MATHEMATICAL APPLICATIONS IN CRYPTOGRAPHY THESIS Presented in Partial Fulfillment of the Requirements for the Degree Masters of Mathematical Sciences in the Graduate School of the Ohio State University By Amy Kosek, B.S. in Mathematics Graduate Program in Mathematical Sciences The Ohio State University 2015 Thesis Committee: James Cogdell, Advisor Rodica Costin c Copyright by Amy Kosek 2015 ABSTRACT Modern cryptography relies heavily on concepts from mathematics. In this thesis we will be discussing several cryptographic ciphers and discovering the mathematical applications which can be found by exploring them. This paper is intended to be accessible to undergraduate or graduate students as a supplement to a course in number theory or modern algebra. The structure of the paper also lends itself to be accessible to a person interested in learning about mathematics in cryptography on their own, since we will always give a review of the background material which will be needed before delving into the cryptographic ciphers. ii ACKNOWLEDGMENTS My sincerest thanks to Jim Cogdell for working with me as my advisor for this thesis project. His encouragement and guidance during the last year has meant so much to me, and I am exceedingly grateful for it. Working with him has been a pleasure and an honor. Also, thank you to Rodica Costin for being a member of my thesis committee and my academic advisor. I so appreciate all of the advice and support she has given me during my time at OSU. Lastly, I would like to thank my wonderful husband, Pete Kosek. He has loved and supported me through every part of this process, and I wouldn't be where I am today without him.
    [Show full text]
  • On the Second Moment Estimate Involving the $\Lambda $-Primitive
    ON THE SECOND MOMENT ESTIMATE INVOLVING THE λ-PRIMITIVE ROOTS MODULO n KIM, SUNGJIN Abstract. Artin’s Conjecture on Primitive Roots states that a non-square non unit integer a is a primitive root modulo p for positive proportion of p. This conjecture remains open, but on average, there are many results due to P. J. Stephens (see [14], also [15]). There is a natural generalization of the conjecture for ∗ composite moduli. We can consider a as the primitive root modulo (Z/nZ) if a is an element of maximal exponent in the group. The behavior is more complex for composite moduli, and the corresponding average results are provided by S. Li and C. Pomerance (see [8], [9], and [10]), and recently by the author (see [6]). P. J. Stephens included the second moment results in his work, but for composite moduli, there were no such results previously. We prove that the corresponding second moment result in this case. 1. Introduction 1 Let a> 1 be an integer and n be a positive integer coprime to a. Denote by ℓa(n) the multiplicative order of a modulo n. Carmichael (see [2]) introduced the lambda function λ(n) which is defined by the universal exponent of the group (Z/nZ)∗. The lambda function can be evaluated by the following procedure: λ(n) = l.c.m.(λ(pe1 ), , λ(per )), 1 · · · r where n = pe1 per (p ’s distinct prime numbers), 1 · · · r i e e 1 λ(p )= p − (p 1) if p is odd prime, and e 1, − ≥ e e 1 λ(2 ) = 2 − if 1 e 2, ≤ ≤ e e 2 λ(2 ) = 2 − if e 3, and ≥ λ(1) = 1.
    [Show full text]
  • Primitive Root Bias for Twin Primes
    EXPERIMENTAL MATHEMATICS 2019, VOL. 28, NO. 2, 151–160 https://doi.org/./.. Primitive Root Bias for Twin Primes Stephan Ramon Garciaa,Elvis Kahoroa,and Florian Lucab,c,d aDepartment of Mathematics, Pomona College, Claremont, CA, USA; bSchool of Mathematics, University of the Witwatersrand, Wits, Johannesburg, South Africa; cMax Planck Institute for Mathematics, Bonn, Germany; dDepartment of Mathematics, Faculty of Sciences, University of Ostrava, Ostrava, Czech Republic ABSTRACT KEYWORDS Numerical evidence suggests that for only about 2% of pairs p, p 2oftwinprimes,p 2 has more prime; twin prime; primitive primitive roots than does p.If this occurs,we say that p is exceptional+ (there are only two+exceptional root; Bateman–Horn conjecture; Twin Prime pairs with 5 ! p ! 10,000).Assuming the Bateman–Horn conjecture,we prove that at least 0.459% of twin prime pairs are exceptional and at least 65.13% are not exceptional.We also conjecture a precise Conjecture; Brun Sieve formula for the proportion of exceptional twin primes. 2010 AMS SUBJECT CLASSIFICATION A; A; N; N 1. Introduction primitive roots as p 2; that is, ϕ(p 1) ϕ(p 1). + − " + Let n be a positive integer. An integer coprime to n is a If this occurs, then p is unexceptional.Thepreceding primitive root modulo n if it generates the multiplicative inequality holds for all twin primes p, p 2with5 p + ! ! group (Z/nZ)× of units modulo n.Afamous resultof 10,000, except for the pairs 2381, 2383 and 3851, 3853. Gauss states that n possessesprimitiverootsifandonly If p, p 2areprimeswithp 5andϕ(p 1)< + " − if n is 2, 4, an odd prime power, or twice an odd prime ϕ(p 1),thenp is exceptional.Wedonotregardp 3 + = power.
    [Show full text]