A Formalisation of Lehmer s Primality Criterion
|
|
- Godfrey McBride
- 6 years ago
- Views:
Transcription
1 A Formalisation of Lehmer s Primality Criterion By Simon Wimmer and Lars Noschinski April 17, 2016 Abstract In 1927, Lehmer presented criterions for primality, based on the converse of Fermat s litte theorem [2]. This work formalizes the second criterion from Lehmer s paper, a necessary and sufficient condition for primality. As a side product we formalize some properties of Euler s ϕ-function, the notion of the order of an element of a group, and the cyclicity of the multiplicative group of a finite field. Contents 1 Introduction 1 2 Simplification Rules for Polynomials 2 3 Properties of the Euler ϕ-function 3 4 Order of an Element of a Group 5 5 Number of Roots of a Polynomial 7 6 The Multiplicative Group of a Field 8 7 Lehmer s Theorem 10 1 Introduction Section 2 provides some technical lemmas about polynomials. Section 3 to 5 formalize some basic number-theoretic and algebraic properties: Euler s ϕ-function, the order of an element of a group and an upper bound of the number of roots of a polynomial. Section 6 combines these results to prove that the multiplicative group of a finite field is cyclic. Based on that, Section 7 formalizes an exted version of Lehmer s Theorem, which gives us necessary and sufficient conditions to decide whether a number is prime. 1
2 theory Multiplicative-Group imports Complex-Main /src/hol/algebra/group /src/hol/number-theory/miscalgebra /src/hol/algebra/coset /src/hol/algebra/univpoly /src/hol/number-theory/number-theory begin 2 Simplification Rules for Polynomials lemma (in ring-hom-cring) hom-sub[simp]: assumes x carrier R y carrier R shows h (x y) = h x S h y context UP-ring begin lemma deg-nzero-nzero: assumes deg-p-nzero: deg R p 0 shows p 0 P lemma deg-add-eq: assumes c: p carrier P q carrier P assumes deg R q deg R p shows deg R (p P q) = max (deg R p) (deg R q) lemma deg-minus-eq: assumes p carrier P q carrier P deg R q deg R p shows deg R (p P q) = max (deg R p) (deg R q) context UP-cring begin lemma evalrr-add: assumes p carrier P q carrier P assumes x:x carrier R shows eval R R id x (p P q) = eval R R id x p eval R R id x q lemma evalrr-sub: assumes p carrier P q carrier P assumes x:x carrier R shows eval R R id x (p P q) = eval R R id x p eval R R id x q 2
3 lemma evalrr-mult: assumes p carrier P q carrier P assumes x:x carrier R shows eval R R id x (p P q) = eval R R id x p eval R R id x q lemma evalrr-monom: assumes a: a carrier R and x: x carrier R shows eval R R id x (monom P a d) = a x (ˆ) d lemma evalrr-one: assumes x: x carrier R shows eval R R id x 1 P = 1 lemma carrier-evalrr: assumes x: x carrier R and p carrier P shows eval R R id x p carrier R lemmas evalrr-simps = evalrr-add evalrr-sub evalrr-mult evalrr-monom evalrr-one carrier-evalrr 3 Properties of the Euler ϕ-function In this section we prove that for every positive natural number the equation n d n ϕ(d) = n holds. hide-const (open) Multiset.mult lemma dvd-div-ge-1 : fixes a b :: nat assumes a 1 b dvd a shows a div b 1 lemma dvd-nat-bounds : fixes n p :: nat assumes p > 0 n dvd p shows n > 0 n p definition phi :: nat => nat 3
4 where phi m = card {x. 1 x x m gcd x m = 1 } notation (latex-output) phi (ϕ -) lemma phi -nonzero : assumes m > 0 shows phi m > 0 lemma dvd-div-eq-1 : fixes a b c :: nat assumes c dvd a c dvd b a div c = b div c shows a = b lemma dvd-div-eq-2 : fixes a b c :: nat assumes c>0 a dvd c b dvd c c div a = c div b shows a = b lemma div-mult-mono: fixes a b c :: nat assumes a > 0 a d shows a b div d b We arrive at the main result of this section: For every positive natural number the equation n d n ϕ(d) = n holds. The outline of the proof for this lemma is as follows: We count the n fractions 1/n,..., (n 1)/n, n/n. We analyze the reduced form a/d = m/n for any of those fractions. We want to know how many fractions m/n have the reduced form denominator d. The condition 1 m n is equivalent to the condition 1 a d. Therefore we want to know how many a with 1 a d exist, s.t. coprime a d. This number is exactly phi d. Finally, by counting the fractions m/n according to their reduced form denominator, we get: ( d d dvd n. phi d) = n. To formalize this proof in Isabelle, we analyze for an arbitrary divisor d of n the set of reduced form numerators {a. 1 a a d coprime a d} the set of numerators m, for which m/n has the reduced form denominator d, i.e. the set {m {1..n}. n div gcd m n = d} 4
5 We show that λa. a n div d with the inverse λa. a div gcd a n is a bijection between theses sets, thus yielding the equality phi d = card {m {1..n}. n div gcd m n = d} This gives us ( d d dvd n. phi d) = card ( d {d. d dvd n} {m {1..n}. n div gcd m n = d}) and by showing {1..n} ( d {d. d dvd n} {m {1..n}. n div gcd m n = d}) (this is our counting argument) the thesis follows. lemma sum-phi -factors : fixes n :: nat assumes n > 0 shows ( d d dvd n. phi d) = n 4 Order of an Element of a Group context group begin lemma pow-eq-div2 : fixes m n :: nat assumes x-car: x carrier G assumes pow-eq: x (ˆ) m = x (ˆ) n shows x (ˆ) (m n) = 1 definition ord where ord a = Min {d {1.. order G}. a (ˆ) d = 1} lemma assumes finite:finite (carrier G) assumes a:a carrier G shows ord-ge-1 : 1 ord a and ord-le-group-order: ord a order G and pow-ord-eq-1 : a (ˆ) ord a = 1 lemma finite-group-elem-finite-ord : assumes finite (carrier G) x carrier G shows d::nat. d 1 x (ˆ) d = 1 lemma ord-min: assumes finite (carrier G) 1 d a carrier G a (ˆ) d = 1 shows ord a d lemma ord-inj : 5
6 assumes finite: finite (carrier G) assumes a: a carrier G shows inj-on (λ x. a (ˆ) x) {0.. ord a 1 } lemma ord-inj : assumes finite: finite (carrier G) assumes a: a carrier G shows inj-on (λ x. a (ˆ) x) {1.. ord a} lemma ord-elems : assumes finite (carrier G) a carrier G shows {a(ˆ)x x. x (UNIV :: nat set)} = {a(ˆ)x x. x {0.. ord a 1 }} (is?l =?R) lemma ord-dvd-pow-eq-1 : assumes finite (carrier G) a carrier G a (ˆ) k = 1 shows ord a dvd k lemma dvd-gcd : fixes a b :: nat obtains q where a (b div gcd a b) = b q lemma ord-pow-dvd-ord-elem : assumes finite[simp]: finite (carrier G) assumes a[simp]:a carrier G shows ord (a(ˆ)n) = ord a div gcd n (ord a) lemma ord-1-eq-1 : assumes finite (carrier G) shows ord 1 = 1 theorem lagrange-dvd: assumes finite(carrier G) subgroup H G shows (card H ) dvd (order G) lemma element-generates-subgroup: assumes finite[simp]: finite (carrier G) assumes a[simp]: a carrier G shows subgroup {a (ˆ) i i. i {0.. ord a 1 }} G lemma ord-dvd-group-order : 6
7 assumes finite[simp]: finite (carrier G) assumes a[simp]: a carrier G shows ord a dvd order G 5 Number of Roots of a Polynomial definition mult-of :: ( a, b) ring-scheme a monoid where mult-of R ( carrier = carrier R {0 R }, mult = mult R, one = 1 R ) lemma carrier-mult-of : carrier (mult-of R) = carrier R {0 R } lemma mult-mult-of : mult (mult-of R) = mult R lemma nat-pow-mult-of : op (ˆ) mult-of R = (op (ˆ) R :: - nat -) lemma one-mult-of : 1 mult-of R = 1 R lemmas mult-of-simps = carrier-mult-of mult-mult-of nat-pow-mult-of one-mult-of context field begin lemma field-mult-group : shows group (mult-of R) lemma finite-mult-of : finite (carrier R) = finite (carrier (mult-of R)) lemma order-mult-of : finite (carrier R) = order (mult-of R) = order R 1 lemma (in monoid) Units-pow-closed : fixes d :: nat assumes x Units G shows x (ˆ) d Units G lemma (in comm-monoid) is-monoid: 7
8 shows monoid G declare comm-monoid.is-monoid[intro?] lemma (in ring) r-right-minus-eq[simp]: assumes a carrier R b carrier R shows a b = 0 a = b context UP-cring begin lemma is-up-cring:up-cring R lemma is-up-ring : shows UP-ring R context UP-domain begin lemma roots-bound: assumes f [simp]: f carrier P assumes f-not-zero: f 0 P assumes finite: finite (carrier R) shows finite {a carrier R. eval R R id a f = 0} card {a carrier R. eval R R id a f = 0} deg R f lemma (in domain) num-roots-le-deg : fixes p d :: nat assumes finite:finite (carrier R) assumes d-neq-zero : d 0 shows card {x carrier R. x (ˆ) d = 1} d 6 The Multiplicative Group of a Field In this section we show that the multiplicative group of a finite field is generated by a single element, i.e. it is cyclic. The proof is inspired by the first proof given in the survey [1]. lemma (in group) pow-order-eq-1 : assumes finite (carrier G) x carrier G shows x (ˆ) order G = 1 lemma nat-div-eq: a 0 = (a :: nat) div b = a b = 1 8
9 lemma (in group) assumes finite : finite (carrier G) assumes a carrier G shows pow-ord-eq-ord-iff : group.ord G (a (ˆ) k) = ord a coprime k (ord a) (is?l?r) context field begin lemma num-elems-of-ord-eq-phi : assumes finite: finite (carrier R) and dvd: d dvd order (mult-of R) and exists: a carrier (mult-of R). group.ord (mult-of R) a = d shows card {a carrier (mult-of R). group.ord (mult-of R) a = d} = phi d theorem (in field) finite-field-mult-group-has-gen : assumes finite:finite (carrier R) shows a carrier (mult-of R). carrier (mult-of R) = {a(ˆ)i i::nat. i UNIV } This result can be transferred to the multiplicative group of Z/pZ for p prime. lemma mod-nat-int-pow-eq: fixes n :: nat and p a :: int assumes a 0 p 0 shows (nat a ˆ n) mod (nat p) = nat ((a ˆ n) mod p) theorem residue-prime-mult-group-has-gen : fixes p :: nat assumes prime-p : prime p shows a {1.. p 1 }. {1.. p 1 } = {aˆi mod p i. i UNIV } theory Lehmer imports Main Multiplicative-Group begin 9
10 7 Lehmer s Theorem In this section we prove Lehmer s Theorem [2] and its converse. These two theorems characterize a necessary and complete criterion for primality. This criterion is the basis of the Lucas-Lehmer primality test and the primality certificates of Pratt [3]. lemma mod-1-coprime-nat: fixes a b :: nat assumes 0 < n [a ˆ n = 1 ] (mod b) shows coprime a b lemma phi-leq: phi x nat x 1 lemma phi-nonzero: assumes 2 x shows phi x 0 This is a weak variant of Lehmer s theorem: All numbers less then p 1 must be considered. lemma lehmers-weak-theorem: assumes 2 p assumes min-cong1 : x. 0 < x = x < p 1 = [a ˆ x 1 ] (mod p) assumes cong1 : [a ˆ (p 1 ) = 1 ] (mod p) shows prime p lemma prime-factors-elem: fixes n :: nat assumes 1 < n shows p. p prime-factors n lemma prime-factors-dvd-nat: fixes p :: nat assumes x prime-factors p shows x dvd p lemma cong-pow-1-nat: fixes a b :: nat assumes [a = 1 ] (mod b) shows [a ˆ x = 1 ] (mod b) lemma cong-gcd-eq-1-nat: fixes a b :: nat assumes 0 < m and cong-props: [a ˆ m = 1 ] (mod b) [a ˆ n = 1 ] (mod b) shows [a ˆ gcd m n = 1 ] (mod b) lemma One-leq-div: fixes a b :: nat assumes a dvd b a < b shows 1 < b div a 10
11 theorem lehmers-theorem: assumes 2 p assumes pf-notcong1 : x. x prime-factors (p 1 ) = [a ˆ ((p 1 ) div x) 1 ] (mod p) assumes cong1 : [a ˆ (p 1 ) = 1 ] (mod p) shows prime p The converse of Lehmer s theorem is also true. lemma converse-lehmer-weak: assumes prime-p:prime p shows a. [aˆ(p 1 ) = 1 ] (mod p) ( x. 0 < x x p 2 [aˆx 1 ] (mod p)) a > 0 a < p theorem converse-lehmer: assumes prime-p:prime(p) shows a. [aˆ(p 1 ) = 1 ] (mod p) ( q. q prime-factors (p 1 ) [aˆ((p 1 ) div q) 1 ] (mod p)) a > 0 a < p References [1] K. Conrad. Cyclicity of (Z/(p)). kconrad/blurbs/grouptheory/cyclicfp.pdf. [2] D. H. Lehmer. Tests for primality by the converse of fermat s theorem. Bull. Amer. Math. Soc., 33: , [3] V. R. Pratt. Every prime has a succinct certificate. SIAM Journal on Computing, 4(3): ,
The Mason Stothers theorem
The Mason Stothers theorem Manuel Eberl August 16, 2018 Abstract This article provides a formalisation of Snyder s simple and elegant proof of the Mason Stothers theorem [2, 1], which is the polynomial
More informationSubresultants. Sebastiaan Joosten, René Thiemann and Akihisa Yamada. October 10, 2017
Subresultants Sebastiaan Joosten, René Thiemann and Akihisa Yamada October 10, 2017 Abstract We formalize the theory of subresultants and the subresultant polynomial remainder sequence as described by
More informationA Few Primality Testing Algorithms
A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others
More informationFree Groups. Joachim Breitner. April 17, 2016
Free Groups Joachim Breitner April 17, 2016 Abstract Free Groups are, in a sense, the most generic kind of group. They are defined over a set of generators with no additional relations in between them.
More informationThe Divergence of the Prime Harmonic Series
The Divergence of the Prime Harmonic Series Manuel Eberl December 16, 2018 Abstract In this work, we prove the lower bound ln(h n ) ln( 5 3 ) for the partial sum of the Prime Harmonic series and, based
More informationThe Divergence of the Prime Harmonic Series
The Divergence of the Prime Harmonic Series Manuel Eberl April 17, 2016 Abstract In this work, we prove the lower bound ln(h n ) ln( 5 3 ) for the partial sum of the Prime Harmonic series and, based on
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationThe Factorization Algorithm of Berlekamp and Zassenhaus
The Factorization Algorithm of Berlekamp and Zassenhaus Jose Divasón Sebastiaan Joosten René Thiemann Akihisa Yamada November 10, 2018 Abstract We formalize the Berlekamp-Zassenhaus algorithm for factoring
More informationIRREDUCIBILITY TESTS IN F p [T ]
IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are
More informationCongruences and Residue Class Rings
Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences
More informationOn the number of semi-primitive roots modulo n
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol. 21, 2015, No., 8 55 On the number of semi-primitive roots modulo n Pinkimani Goswami 1 and Madan Mohan Singh 2 1 Department of Mathematics,
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationR. Popovych (Nat. Univ. Lviv Polytechnic )
UDC 512.624 R. Popovych (Nat. Univ. Lviv Polytechnic ) SHARPENING OF THE EXPLICIT LOWER BOUNDS ON THE ORDER OF ELEMENTS IN FINITE FIELD EXTENSIONS BASED ON CYCLOTOMIC POLYNOMIALS ПІДСИЛЕННЯ ЯВНИХ НИЖНІХ
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationD-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationComputing N-th Roots using the Babylonian Method
Computing N-th Roots using the Babylonian Method René Thiemann May 27, 2015 Abstract We implement the Babylonian method [1] to compute n-th roots of numbers. We provide precise algorithms for naturals,
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationAdvanced Algorithms and Complexity Course Project Report
Advanced Algorithms and Complexity Course Project Report Eklavya Sharma (2014A7PS0130P) 26 November 2017 Abstract This document explores the problem of primality testing. It includes an analysis of the
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationIntroduction to Information Security
Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationCover Page. The handle holds various files of this Leiden University dissertation.
Cover Page The handle http://hdl.handle.net/1887/20310 holds various files of this Leiden University dissertation. Author: Jansen, Bas Title: Mersenne primes and class field theory Date: 2012-12-18 Chapter
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationPRIMALITY TESTING. Professor : Mr. Mohammad Amin Shokrollahi Assistant : Mahdi Cheraghchi. By TAHIRI JOUTI Kamal
PRIMALITY TESTING Professor : Mr. Mohammad Amin Shokrollahi Assistant : Mahdi Cheraghchi By TAHIRI JOUTI Kamal TABLE OF CONTENTS I- FUNDAMENTALS FROM NOMBER THEORY FOR RANDOMIZED ALGORITHMS:.page 4 1)
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationPrimality testing: variations on a theme of Lucas. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Primality testing: variations on a theme of Lucas Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA In 1801, Carl Friedrich Gauss wrote: The problem of distinguishing prime numbers from composite
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationRINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS
RINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS JACOB LOJEWSKI AND GREG OMAN Abstract. Let G be a nontrivial group, and assume that G = H for every nontrivial subgroup H of G. It is a simple matter to prove
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationarxiv: v3 [math.nt] 15 Dec 2016
Lehmer s totient problem over F q [x] arxiv:1312.3107v3 [math.nt] 15 Dec 2016 Qingzhong Ji and Hourong Qin Department of Mathematics, Nanjing University, Nanjing 210093, P.R.China Abstract: In this paper,
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationComputational Number Theory. Adam O Neill Based on
Computational Number Theory Adam O Neill Based on http://cseweb.ucsd.edu/~mihir/cse207/ Secret Key Exchange - * Is Alice Ka Public Network Ka = KB O KB 0^1 Eve should have a hard time getting information
More informationComputing Square Roots using the Babylonian Method
Computing Square Roots using the Babylonian Method René Thiemann February 16, 2013 Abstract We implement the Babylonian method [1] to compute square roots of numbers. We provide precise algorithms for
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationLecture 8: Finite fields
Lecture 8: Finite fields Rajat Mittal IIT Kanpur We have learnt about groups, rings, integral domains and fields till now. Fields have the maximum required properties and hence many nice theorems can be
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationIdeals: Definitions & Examples
Ideals: Definitions & Examples Defn: An ideal I of a commutative ring R is a subset of R such that for a, b I and r R we have a + b, a b, ra I Examples: All ideals of Z have form nz = (n) = {..., n, 0,
More informationMath 314 Course Notes: Brief description
Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationSimultaneous Linear, and Non-linear Congruences
Simultaneous Linear, and Non-linear Congruences CIS002-2 Computational Alegrba and Number Theory David Goodwin david.goodwin@perisic.com 09:00, Friday 18 th November 2011 Outline 1 Polynomials 2 Linear
More informationExamples for program extraction in Higher-Order Logic
Examples for program extraction in Higher-Order Logic Stefan Berghofer October 10, 2011 Contents 1 Auxiliary lemmas used in program extraction examples 1 2 Quotient and remainder 2 3 Greatest common divisor
More informationLARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0).
LARGE PRIME NUMBERS 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power a e % n. (Here x % n denotes the element of {0,, n 1}
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationLecture 7 Cyclic groups and subgroups
Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:
More informationModern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul...,..., f... DOI: 10.2478/aicu-2013-0013 ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS BY MARIUS TĂRNĂUCEANU and
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationA Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.6. A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve Ömer Küçüksakallı Mathematics Department Middle East
More informationON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP
ON THE SUBGROUP LATTICE OF AN ABELIAN FINITE GROUP Marius Tărnăuceanu Faculty of Mathematics Al.I. Cuza University of Iaşi, Romania e-mail: mtarnauceanu@yahoo.com The aim of this paper is to give some
More informationNecklaces, periodic points and permutation representations
Necklaces, periodic points and permutation representations Fermat s little theorem Somnath Basu, Anindita Bose, Sumit Sinha & Pankaj Vishe Published in Resonance, November 2001, P.18-26. One of the most
More informationLevel Structures of Drinfeld Modules Closing a Small Gap
Level Structures of Drinfeld Modules Closing a Small Gap Stefan Wiedmann Göttingen 2009 Contents 1 Drinfeld Modules 2 1.1 Basic Definitions............................ 2 1.2 Division Points and Level Structures................
More informationLEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID
LEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID JORDAN SCHETTLER Abstract. Lehmer s totient problem consists of determining the set of positive integers n such that ϕ(n) n 1 where ϕ is Euler s
More information4400/6400 EXERCISES. 1. Homework 1
4400/6400 EXERCISES PETE L. CLARK 1.1. 4400 Problems. 1. Homework 1 Exercise 1.1.1. (O) 1 How do you know there is no largest integer? Exercise 1.1.2. We recall the definition of divisibility in Z: if
More informationCYCLICITY OF (Z/(p))
CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic
More informationGeneralization of Hensel lemma: nding of roots of p-adic Lipschitz functions
Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions (joint talk with Andrei Khrennikov) Dr. Ekaterina Yurova Axelsson Linnaeus University, Sweden September 8, 2015 Outline Denitions
More informationK. Ireland, M. Rosen A Classical Introduction to Modern Number Theory, Springer.
Chapter 1 Number Theory and Algebra 1.1 Introduction Most of the concepts of discrete mathematics belong to the areas of combinatorics, number theory and algebra. In Chapter?? we studied the first area.
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationCS 6260 Some number theory
CS 6260 Some number theory Let Z = {..., 2, 1, 0, 1, 2,...} denote the set of integers. Let Z+ = {1, 2,...} denote the set of positive integers and N = {0, 1, 2,...} the set of non-negative integers. If
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationIRREDUCIBILITY TESTS IN Q[T ]
IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case
More informationp = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is
LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationThe running time of Euclid s algorithm
The running time of Euclid s algorithm We analyze the worst-case running time of EUCLID as a function of the size of and Assume w.l.g. that 0 The overall running time of EUCLID is proportional to the number
More informationPRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro
PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION Predrag Terzic Podgorica, Montenegro pedja.terzic@hotmail.com Abstract. We present deterministic primality test for Fermat numbers, F
More informationGOLOMB S ARITHMETICAL SEMIGROUP TOPOLOGY AND A SEMIPRIME SUFFICIENCY CONDITION FOR DIRICHLET S THEOREM
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 3, 2016 GOLOMB S ARITHMETICAL SEMIGROUP TOPOLOGY AND A SEMIPRIME SUFFICIENCY CONDITION FOR DIRICHLET S THEOREM CHRIS ORUM ABSTRACT. Dirichlet s theorem
More informationI216e Discrete Math (for Review)
I216e Discrete Math (for Review) Nov 22nd, 2017 To check your understanding. Proofs of do not appear in the exam. 1 Monoid Let (G, ) be a monoid. Proposition 1 Uniquness of Identity An idenity e is unique,
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationMATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4
MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts
More informationA Variation of a Congruence of Subbarao for n = 2 α 5 β, α 0, β 0
Introduction A Variation of a Congruence of Subbarao for n = 2 α 5 β, α 0, β 0 Diophantine Approximation and Related Topics, 2015 Aarhus, Denmark Sanda Bujačić 1 1 Department of Mathematics University
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationFIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS
FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic
More informationHOMEWORK 11 MATH 4753
HOMEWORK 11 MATH 4753 Recall that R = Z[x]/(x N 1) where N > 1. For p > 1 any modulus (not necessarily prime), R p = (Z/pZ)[x]/(x N 1). We do not assume p, q are prime below unless otherwise stated. Question
More informationChapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives
More informationLandau Symbols. Manuel Eberl. November 28, 2018
Landau Symbols Manuel Eberl November 28, 2018 Contents 1 Sorting and grouping factors 1 2 Decision procedure for real functions 4 2.1 Eventual non-negativity/non-zeroness............. 4 2.2 Rewriting Landau
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More informationMath 546, Exam 2 Information.
Math 546, Exam 2 Information. 10/21/09, LC 303B, 10:10-11:00. Exam 2 will be based on: Sections 3.2, 3.3, 3.4, 3.5; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/546fa09/546.html)
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More information17 More Groups, Lagrange s Theorem and Direct Products
7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationMidterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of
More information