DOCSLIB.ORG

Primitive Roots in Number Theory Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Primitive Roots in Number Theory Pdf Primitive roots in number theory pdf Continue When using a primitive root g gg mod n n, elements n∗ mathbb (_n) bn∗ can be written as 1.g,g2,...,gφ (n) 1, g, g'2, ldots, g'phi (n)-1 1,g2,...,gφ(n) Multiplying the two elements corresponds to the addition of their fashion exhibitors φ (n). Fi (n). φ (n). That is, the multiplier arithmetic in N∗ mathbb _n n∗ comes down to additive arithmetic in Zφ (n) mathbb phi (n) Zφ (n) . Let k k k be an integer and p p p the odd prime number. How many non-zero kthk'text'th'kth powers have mod p? p?p? The question certainly depends on the relationship between k kk and p pp. When kz2, k2, k'2, the answer is p-12 frak-r-12 2p-1 (see square residues), but when kp-1, k q p-1, k'p-1, answer 1 1 1 (small theorem). As an illustration, take k'9,p-13 k 9, p 13 to 9, page 13. Then it's easy to check that g'2 g'2 g'2 is a primitive root mod p pp. Ninth powers mod p p are 20,29,218,227,... 2'0, 2'9, 2'{18}, 2'{27}, 20,29,218,227,..., but we can consider mod exhibitors 12 12 12, because 212≡1 2'{12} Equiv 1 212≡1. So we get 20,29,26,23,20,...,2'0, 2'9, 2'6, 2'3, 2'0, 'ldots,20,29,26,23,20,..., so there are four 9th9 'text'th'9th mod powers 13 13 13 13. Exhibitors are multiples of 3 33, which is gcd (9.13-1) (9,13-1) (9,13-1). There are 13-134frac 13-1'3 and 4313'1 No 4 of them. In general, since each non-grain element pmathbb _p p can be written as ga g'a ga mod p p p for some integer x x x, equation xk≡y x≡y x'k q≡y mod p p p can be rewritten (ga≡k≡gb, (g'a) q q equiv g'b, (ga)k≡gb, or gak'b≡1 g'ak-b'equiv 1 gak≡1 mod p. Since g g g g g is a primitive root This happens if and only if (p'1) ∣ (ak'b) (p-1) (ak-b) (p.1)∣ (akb), so that ak≡b a ≡c equv b a≡b mod p-1 p-1 p. This raises the question: How does the range over p1 mathbb p-1 (p-1), how many values can ak ak mod p'1 p'1 p'1 take over? that ak (p:1)c:k∈ c∈ big'ak (p-1)c: k, c (in mathbb ∈ is a set of multiples of gcd (k,p-1) (k,p-1) (k,p-1) (k,p-1). so that's the answer. □□ Here's another problem where she can help write elements of n∗ matebb _p n∗ as the forces of primitive root. , branches of number theory, number g is a primitive root module n, if each number of coprime to n coincides with the force of g modulo n. That is, g is a primitive root modulo n, if for each integer coprime to n, there is an integer k such that gk ≡ a (mod n). This value k is called an index or discrete logarith of the base g modulo n. Note that g is a primitive root module n if and only if Mr. the multiplied group of integrators modulo n. Gauss identified primitive roots in article 57 of the Arithmeticae Discivism (1801), where he credited Euler with coining the term. In article 56, he stated that Lambert and Euler knew about them, but he was the first to strictly demonstrate that primitive roots exist for prime-n. In fact, disquisitions contain two evidence: one in article 54 is unconstructive proof of existence and the other in article 55 is constructive. Elementary example number 3 is a primitive root module 7.1, because 3 1 and 3 0 × 3 ≡ 1 × 3 x 3 ≡ 3 (Mod 7) 3 2 x 9 - 3 1 × 3 ≡ 3 × 3 and 9 ≡ 2 (Mod 7) 3 x 27th 3 3 3 2 × 3 ≡ 2 × 3 and 6 ≡ 6 (Mod 7) 3 4 81 3 3 × 3 ≡ 3 × 3 - 18 ≡ 4 (Mod 7) 3 5 x 243 - 3 3 4 × 3 ≡ 4 × 3 and 12 ≡ 5 (Mod 7) 3 6 x 729 - 3 5 × 3 ≡ 5 × 5 3 and 15 ≡ 1 (Mod 7) 3 7 and 2187 3 6 × 3 ≡ 1 × 3 x 3 ≡ 3 (Mod 7) Display Style Startrcrcrcrcr 3{1} 33'{0}'times 3 Equiv 3'3'equiv (3'pmod {7})3'3'{2} 9'3'3'{1} times 3'equiv (3'time 3) 9equiv 2pmod {7} 3{3} 273'{2} times 3'equiv 2time 3 6'equiv 6'pmod {7}'3'{4}'81'3'{3} times 3'equiv 6 'times 3'18'equi {7}v 3'{5} 243'3'{4} times 3'equiv 4'times 3'12'equi {6} {7} 729-3'{5} times 3'equiv 5 'times 3'15'equiv (1'pmod {7}'3'{7}'21872187s 3{6} times 3'equiv 1 times 3'3'equiv (3'pmod {7}'end) Here we see that the period 3k modulo 7 is 6. Remains in the period that is 3, 2, 6, 4, 5, 1, form a permutation of all the non-grain remnants of modulo 7, implying that 3 is a truly primitive root modulo 7. This stems from the fact that the sequence (gk modulo n) is always repeated after some k, as modulo n produces the final number of values. If g is a primitive root modlo n and n is prime, then the repetition period is n-1. Curiously, the permutations created in this way (and their circular shifts) were shown as Costas arrays. Definition If n is a positive integer, integers between 0 and n No. 1, who coprime to n (or equivalent, coprime class to n) form a group, multiplying modulo n as surgery; it is denoted by the ×n unit group, or group of primitive modulo n. As explained in the article of the multiplier group integers modulo n, this multiplier group (No×n) is cyclical, if and only if n is 2, 4, pk or 2pk, where PK is the force of a strange number. When (and only when) this group× is cyclical, the generator of this cyclical group is called primitive root modlo n'5 (or in a more complete language by the primitive root of modulo n unity, emphasizing its role as a fundamental solution to the roots of the unity of the polynomial equations Xm No. 1 in the n ring n), or simply primitive. When× × is non-cyclical, there are no such primitive elements of mod n. For any n (regardless of whether× is a z×n cyclical), order (i.e. number of elements in) z×n is given to totient euler function φ (n) (A000010 sequence in OEIS). And then, the Euler theorem says that aφ (n) ≡ 1 (mod n) for each coprime to n; the lowest power, which coincides with 1 modulo n, In particular, in order to be a primitive root module n, φ (n) must be the smallest force that coincides with 1 modulo n. Examples For example, if n No. 14, the elements of the z×n are classes of congruence No.1, 3, 5, 9, 11, 13; there are φ (14) and 6 of them. Here is a table of their powers modulo 14: x x, x2, x3, ... (mod 14) 1 : 1 3 : 3, 9, 13, 11, 5, 1 5 : 5, 11, 13, 9, 3, 1 9 : 9, 11, 11: 11, 9, 1 13 : 13, 1 Order 1 is 1, orders 3 and 5 6, orders 9 and 11 3, and order 13 2. Thus, 3 and 5 are the primitive roots of modulo 14. For the second example, let no 15. No×15 are congruence classes No.1, 2, 4, 7, 8, 11, 13, 14; there are φ (15) and 8 of them. x x, x2, x3, ... (mod 15) 1 : 1 2 : 2, 4, 8, 1 4 : 4, 1 7 : 7, 4, 13, 1 8 : 8, 4, 2, 11 : 11, 13 : 13: 13, 4, 7, 14, 1 So there is no room, order of which 8, there are no primitive roots modulo 15. In fact, No (15) No 4, where - carmichael's function. (A002322 in OEIS) Table of primitive roots Numbers that have primitive root 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18, 19, 22, 23, 25, 26, 27, 29, 31, 34, 37, 38, 41, 43, 46, 47, 49, 50, 53, 54, 58, 59, 61, 62, 67, 71, 73, 74, 81, 82, 83, 86, 89, 94, 74, 79, 97, 7, 99 , 98 , 101, 103, 106, 107, 109, 113, 118, 121, 122, 125, 127, 131, 134, 137, 139, 142, 146, 149, ... This is the Gauss table of primitive roots from Disquisitiones. Unlike most contemporary authors, it was not always chosen from the smallest primitive roots. Instead, he chose 10 if it was a primitive root; if it is not, he chose the one that the root gives the 10 smallest index, and, if there is more than one, chose the smallest of them. This not only simplifies the calculation of the hand, but is also used in the VI place, where periodic decimal expansion of rational numbers is investigated.
Load more

Recommended publications
  • Simultaneous Elements of Prescribed Multiplicative Orders 2
    Simultaneous Elements Of Prescribed Multiplicative Orders N. A. Carella Abstract: Let u 6= ±1, and v 6= ±1 be a pair of fixed relatively prime squarefree integers, and let d ≥ 1, and e ≥ 1 be a pair of fixed integers. It is shown that there are infinitely many primes p ≥ 2 such that u and v have simultaneous prescribed multiplicative orders ordp u = (p − 1)/d and ordp v = (p − 1)/e respectively, unconditionally. In particular, a squarefree odd integer u > 2 and v = 2 are simultaneous primitive roots and quadratic residues (or quadratic nonresidues) modulo p for infinitely many primes p, unconditionally. Contents 1 Introduction 1 2 Divisors Free Characteristic Function 4 3 Finite Summation Kernels 5 4 Gaussian Sums, And Weil Sums 7 5 Incomplete And Complete Exponential Sums 7 6 Explicit Exponential Sums 11 7 Equivalent Exponential Sums 12 8 Double Exponential Sums 13 9 The Main Term 14 10 The Error Terms 15 arXiv:2103.04822v1 [math.GM] 5 Mar 2021 11 Simultaneous Prescribed Multiplicative Orders 16 12 Probabilistic Results For Simultaneous Orders 18 1 Introduction The earliest study of admissible integers k-tuples u1, u2, . , uk ∈ Z of simultaneous prim- itive roots modulo a prime p seems to be the conditional result in [21]. Much more general March 9, 2021 AMS MSC2020 :Primary 11A07; Secondary 11N13 Keywords: Distribution of primes; Primes in arithmetic progressions; Simultaneous primitive roots; Simul- taneous prescribed orders; Schinzel-Wojcik problem. 1 Simultaneous Elements Of Prescribed Multiplicative Orders 2 results for admissible rationals k-tuples u1, u2, . , uk ∈ Q of simultaneous elements of independent (or pseudo independent) multiplicative orders modulo a prime p ≥ 2 are considered in [26], and [14].
    [Show full text]
  • 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]
  • Computing Multiplicative Order and Primitive Root in Finite Cyclic Group
    Computing Multiplicative Order and Primitive Root in Finite Cyclic Group Shri Prakash Dwivedi ∗ Abstract Multiplicative order of an element a of group G is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and Z∗ primitive root in p, we also present a logarithmic improvement over classical algorithms. 1 Introduction Algorithms for computing multiplicative order or simply order and primitive root or generator are important in the area of random number generation and discrete logarithm problem among oth- Z∗ ers. In this paper we consider the problem of computing the order of an element over p, which is Z∗ multiplicative group modulo p . As stated above order of an element a ∈ p is the least positive integer n such that an = 1. In number theoretic language, we say that the order of a modulo m is n, if n is the smallest positive integer such that an ≡ 1( mod m). We also consider the related Z∗ Z∗ problem of computing the primitive root in p. If order of an element a ∈ n usually denoted as Z∗ ordn(a) is equal to | n| i.e. order of multiplicative group modulo n, then a is called called primi- Z∗ tive root or primitive element or generator [3] of n. It is called generator because every element Z∗ in n is some power of a. Efficient deterministic algorithms for both of the above problems are not known yet.
    [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]
  • A Quantum Primality Test with Order Finding
    A quantum primality test with order finding Alvaro Donis-Vela1 and Juan Carlos Garcia-Escartin1,2, ∗ 1Universidad de Valladolid, G-FOR: Research Group on Photonics, Quantum Information and Radiation and Scattering of Electromagnetic Waves. o 2Universidad de Valladolid, Dpto. Teor´ıa de la Se˜nal e Ing. Telem´atica, Paseo Bel´en n 15, 47011 Valladolid, Spain (Dated: November 8, 2017) Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat’s theorem. For an integer N, the test tries to find an element of the multiplicative group of integers modulo N with order N − 1. If one is found, the number is known to be prime. During the test, we can also show most of the times N is composite with certainty (and a witness) or, after log log N unsuccessful attempts to find an element of order N − 1, declare it composite with high probability. The algorithm requires O((log n)2n3) operations for a number N with n bits, which can be reduced to O(log log n(log n)3n2) operations in the asymptotic limit if we use fast multiplication. Prime numbers are the fundamental entity in number For a prime N, ϕ(N) = N 1 and we recover Fermat’s theory and play a key role in many of its applications theorem. − such as cryptography. Primality tests are algorithms that If we can find an integer a for which aN−1 1 mod N, determine whether a given integer N is prime or not.
    [Show full text]
  • Exponential and Character Sums with Mersenne Numbers
    Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 65211, USA [email protected] John B. Friedlander Dept. of Mathematics, University of Toronto Toronto, Ontario M5S 3G3, Canada [email protected] Moubariz Z. Garaev Instituto de Matem´aticas Universidad Nacional Aut´onoma de M´exico C.P. 58089, Morelia, Michoac´an, M´exico [email protected] Igor E. Shparlinski Dept. of Computing, Macquarie University Sydney, NSW 2109, Australia [email protected] Dedicated to the memory of Alf van der Poorten 1 Abstract We give new bounds on sums of the form Λ(n) exp(2πiagn/m) and Λ(n)χ(gn + a), 6 6 nXN nXN where Λ is the von Mangoldt function, m is a natural number, a and g are integers coprime to m, and χ is a multiplicative character modulo m. In particular, our results yield bounds on the sums exp(2πiaMp/m) and χ(Mp) 6 6 pXN pXN p with Mersenne numbers Mp = 2 − 1, where p is prime. AMS Subject Classification Numbers: 11L07, 11L20. 1 Introduction Let m be an arbitrary natural number, and let a and g be integers that are coprime to m. Our aim in the present note is to give bounds on exponential sums and multiplicative character sums of the form n n Sm(a; N)= Λ(n)em(ag ) and Tm(χ, a; N)= Λ(n)χ(g + a), 6 6 nXN nXN where em is the additive character modulo m defined by em(x) = exp(2πix/m) (x ∈ R), and χ is a nontrivial multiplicative character modulo m.
    [Show full text]
  • Overpseudoprimes, Mersenne Numbers and Wieferich Primes 2
    OVERPSEUDOPRIMES, MERSENNE NUMBERS AND WIEFERICH PRIMES VLADIMIR SHEVELEV Abstract. We introduce a new class of pseudoprimes - so-called “overpseu- doprimes” which is a special subclass of super-Poulet pseudoprimes. De- noting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2p − 1, where p is prime, and squares of Wieferich primes are overpseudoprimes. 1. Introduction n Sometimes the numbers Mn =2 − 1, n =1, 2,..., are called Mersenne numbers, although this name is usually reserved for numbers of the form p (1) Mp =2 − 1 where p is prime. In our paper we use the latter name. In this form numbers Mp at the first time were studied by Marin Mersenne (1588-1648) at least in 1644 (see in [1, p.9] and a large bibliography there). We start with the following simple observation. Let n be odd and h(n) denote the multiplicative order of 2 modulo n. arXiv:0806.3412v9 [math.NT] 15 Mar 2012 Theorem 1. Odd d> 1 is a divisor of Mp if and only if h(d)= p. Proof. If d > 1 is a divisor of 2p − 1, then h(d) divides prime p. But h(d) > 1. Thus, h(d)= p. The converse statement is evident. Remark 1. This observation for prime divisors of Mp belongs to Max Alek- seyev ( see his comment to sequence A122094 in [5]).
    [Show full text]
  • Introduction to Abstract Algebra “Rings First”
    Introduction to Abstract Algebra \Rings First" Bruno Benedetti University of Miami January 2020 Abstract The main purpose of these notes is to understand what Z; Q; R; C are, as well as their polynomial rings. Contents 0 Preliminaries 4 0.1 Injective and Surjective Functions..........................4 0.2 Natural numbers, induction, and Euclid's theorem.................6 0.3 The Euclidean Algorithm and Diophantine Equations............... 12 0.4 From Z and Q to R: The need for geometry..................... 18 0.5 Modular Arithmetics and Divisibility Criteria.................... 23 0.6 *Fermat's little theorem and decimal representation................ 28 0.7 Exercises........................................ 31 1 C-Rings, Fields and Domains 33 1.1 Invertible elements and Fields............................. 34 1.2 Zerodivisors and Domains............................... 36 1.3 Nilpotent elements and reduced C-rings....................... 39 1.4 *Gaussian Integers................................... 39 1.5 Exercises........................................ 41 2 Polynomials 43 2.1 Degree of a polynomial................................. 44 2.2 Euclidean division................................... 46 2.3 Complex conjugation.................................. 50 2.4 Symmetric Polynomials................................ 52 2.5 Exercises........................................ 56 3 Subrings, Homomorphisms, Ideals 57 3.1 Subrings......................................... 57 3.2 Homomorphisms.................................... 58 3.3 Ideals.........................................
    [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]
  • Cyclic Groups and Primitive Roots
    Cyclic Groups and Primitive Roots Ryan C. Daileda Trinity University Number Theory Daileda Primitive Roots Cyclic Subgroups Let G be a group and let a ∈ G. The set hai = {am | m ∈ Z} is clearly closed under multiplication and inversion in G. hai is therefore a group in its own right, the cyclic subgroup generated by a. Our work last time immediately proves: Theorem 1 Let G be a group and let a ∈ G. If |a| is infinite, so is hai. If |a| = n ∈ N, then hai = {e, a, a2,..., an−1}, and these elements are all distinct. Daileda Primitive Roots Examples The (additive) subgroup of Z/20Z generated by 12 + 20Z is {12 + 20Z, 4 + 20Z, 16 + 20Z, 8 + 20Z, 0 + 20Z}, 20 which has 5 = (12,20) elements, as expected. The (multiplicative) subgroup of (Z/16Z)× generated by 3 + 16Z is {3 + 16Z, 9 + 16Z, 11 + 16Z, 1 + 16Z}, which has 4 = |3 + 16Z| elements. Daileda Primitive Roots Cyclic Groups Definition A group G is called cyclic if there is an a ∈ G so that G = hai. In this case we say that G is generated by a. Since |a| = hai , if G is finite we find that G is cyclic ⇔ G has an element of order |G|. Since the additive order of 1+ nZ in Z/nZ is exactly n, we conclude that Z/nZ (under addition) is always cyclic. Daileda Primitive Roots n Recall that the additive order of a + nZ in Z/nZ is (a,n) . Thus: The (additive) generators of Z/nZ are the elements of (Z/nZ)×.
    [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]
  • 2Y, X > 0, Y ≥ 0 1. Scope We Consider the Number of Ways to Repr
    THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x2 − 2y, x > 0, y ≥ 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2y +n = x2 for fixed positive n. The computational strategy is to count the solutions separately for even and odd exponents y, and to handle the odd case with modular residues for most cases of n. 1. Scope We consider the number of ways to represent n > 0 as (1) n = x2 − 2y; for pairs of the non-negative unknowns x and y. Equivalently we count the y such that (2) n + 2y = x2 are perfect squares. Remark 1. For n = 0 the number of solutions is infinite because each even value of y creates one solution. The n for which the count is nonzero end up in [8, A051204]. Remark 2. Negative n for which solutions exists are listed in [8, A051213] [4,2] . The solutions are counted separately for even y and odd y and added up. The total count is at most 4 [6]. 2. Even Exponents y Counting the squares x2 of the format (2) considering only even y is basically a matter of considering the values y = 0; 2; 4;::: in turn and checking explicitly each y2 + n against being a square. An upper limit to the y is determined as follows: • The y-values in the range 2y < n are all checked individually. • For larger y the values of 2y + n on the left hand side of (2) are represented in binary by some most significant bit contributed by 2y and|after a train of zero bits depending of how much larger 2y is than n|the trailing bits of n.
    [Show full text]