Prime Numbers in Generalized Pascal Triangles
|
|
- Sheena Arnold
- 5 years ago
- Views:
Transcription
1 Prime Numbers in Generalized Pascal Triangles G. Farkas, G. Kallós Eötvös Loránd University, H-1117, Budapest, Pázmány Péter sétány 1/C, Széchenyi István University, H-9026, Győr, Egyetem tér 1, Abstract: In this paper we generalize the Pascal triangle and examine the connections among the generalized triangles and powering integers respectively polynomials. We emphasize connections with the binomial and multinomial theorems, and we present some computational results in topics of prime numbers and prime factorization. Some prime numbers (candidates) connected to the generalized Pascal triangle are presented. We describe a very efficient primality proving algorithm called ECPP (Elliptic Curve Primality Proving) and for one of the candidates an exact primality proof is given. Since this prime number has more than 1000 digits, it is a so-called titanic prime. Keywords: Pascal triangle, Generalized binomial coefficient, Primality testing, ECPP 1. Generalized Pascal Triangles 1.1 Introduction The interesting and really romantic Pascal triangle has a number of generalizations. We can construct the generalized Pascal triangles of s th order (or kind s), from the generalized binomial coefficients of order s. This idea was first published in 1956 by J. E. Freund [4]. The so-called Pascal pyramid is constructed from trinomial coefficients, which occur in the expansions (x + y + z) n (first mentioned by E. B. Rosenthal, 1960, [1]). Each of the outer faces of the pyramid are Pascal triangles. We can extend this idea to the multidimensional case, so Pascal hyperpyramids can be constructed from multinomial coefficients [1]. 109
2 Our generalization 1 is based on the well-known fact (see e.g. the paper of R. L. Morton from 1964, [9]) that from the n th row of the Pascal triangle with positional addition we get the n th power of 11 (Figure 1), where n is a non-negative integer, and the indices in the rows and columns run from =11 0, 11=11 1, 121=11 2, 1331=11 3, 14641=11 4, =11 5, Figure 1: Powers of 11 in the Pascal triangle This comes directly from the binomial equality n 10 0 n n 10 1 n 1 n 10 2 n 2 n n 1 n n 1 0 n (1) 1.2. Generalization Let us construct triangles, in which the powers of other numbers appear. To achieve this, let us consider the Pascal triangle as the 11-based triangle, and take the following definition. Definition Let 0 a 0, a 1,, a m-1 9 be integers. We get the k th element in the n th row of the a 0 a 1 a m-1 -based triangle if we multiply the k-m th element in the n-1 th row by a m-1, the k-m+1 th element in the n-1 th row by a m-2,, the k th element in the n-1 th row by a 0, and add the products. If for some index i we have k m + i < 0 or k m + i > n(m - 1) (i.e., an element in the n-1 th row does not exist) then we consider this element to be 0. The indices in the rows and columns run from 0 (Figure 2) Figure 2: The 257-based triangle 1 The main idea was presented by the second author in 1993, and later in a subsequent paper in 1997 ([6], [7]). Although the construction of triangles of coefficients in expansions of (a + bx) n and (a + bx + cx 2 ) n have already been mentioned by few other authors in the last years (see e.g. [10]), systematic analysis was published first only in [6] and [7]. 110
3 Remark Triangles with base-number 11 1 (s pieces of 1 digits) have already been known for decades as generalized Pascal triangles of s th order [1]. However, they were introduced using a combinatorial approach, by the generalization of the binomial coefficients [4]. The generalized binomial coefficient n (2) m s is the number of different ways of distributing m objects among n cells where each cell may contain at most s-1 objects [1]. This is the element in the m th column of the n th row in the generalized Pascal triangles of s th order. For s = 2 we get the "normal" binomial coefficients and the Pascal triangle. Now we summarize the main results about the general triangles. The proofs are here omitted. Details can be found in [7]. Theorem From the n th row of the a 0 a 1 a m-1 -based triangle by positional addition we get the n th power of the number a 0 a 1 a m-1. Example In the second row of the 257-based triangle = = Proposition The elements in the n th row of the general triangle are exactly the coefficients of the polynomial (a 0 + a 1 x + + a m-1 x m-1 ) n, where the k th element is the coefficient of x k. Example From the third row of the 257-based triangle (Figure 2) (2 + 5x + 7x 2 ) 3 = x + 234x x x x x 6. These results show that we have the "right" to call the new triangles as generalized Pascal triangles, since their general properties are very similar to those of the Pascal triangle. With deeper analysis we are able to discover a nice connection of the general triangle with the multinomial (sometimes referred as the polynomial) theorem. Definition For the digits of the base-number number a 0 a 1 a m-1 let the weight of a digit be its distance from the centerline. So w(a 0 ) = -w(a m-1 ), w(a 1 ) = -w(a m-2 ),. If the base number is odd, then w(a (m-1)/2 ) = 0. Let the unit of the weights be the distance of two neighboring elements in the triangle, i.e., w(a i ) = w(a i+1 ) + 1. As the elements of the triangle are sums, consider the parts of them. For such an expression let the weight of the part be the sum of the weights of its digits. If a digit is on the i th power, then we count its weight i-times. Theorem The elements in the n th row of the a 0 a 1 a m-1 -based triangle are exactly such sums of the coefficients of the polynomial (a 0 x 0 + a 1 x a m-1 x m-1 ) n, in which the weights of the parts are identical. 111
4 1.3. Investigations We can investigate a lot of interesting properties of general triangles. E.g. we can generalize further properties of the Pascal triangle, we can analyze divisibility results and modulo n coloring and calculate fractal dimensions. Some of these topics are partly covered in [6] and in [7]. Here we present a summary about the topics of prime numbers and factorizations in general triangles Prime numbers It is a trivial result that in triangles with base 11a 2 a 3 we get all of the prime numbers in the first position of the rows (similarly, as in the Pascal triangle). For general triangles it follows from the multinomial theorem and our Theorem that we can find prime numbers in given "directions" (details in [6]). E.g. in the abc-based triangles the middle position is interesting. Investigations on computer show that small primes are relatively common; however large primes are very rare. We can find all of the small primes up to 101 in the first 3 rows of the abc-based triangles in positions (2, 2) and (3, 3), except for 47, which occur first in the third row of the 1231-based triangle. The most common small prime is 13, which occur in triangles 112, 116, 132, 211, 213, 231, 312 and 611 in positions (2, 2) and (3, 3), by solving equations ac b and 13 6abc b, for a, b and c. R. C. Bollinger proved for triangles with base 11 1 (generalized Pascal triangle of order p) that for large n, "almost all" coefficients in the n th row are divisible by p (details in [1]). It is a conjecture that we have a similar result for our general triangles (e.g. in the 112-based triangle "almost all" coefficients are divisible by 5 and 7, in the 113- based triangle "almost all" coefficients are divisible by 7 and 11). Thus, we have only very little chance to find a large prime number in an arbitrary triangle. With a computer program e.g. in triangles with base numbers we can find 4 primes (candidates) more than 500 decimal digits checking the first 1100 rows (Tabular 1). Base Position Digits , , , , Table 1: Primes (candidates) in triangles with base numbers Factorizations Analyzing factorizations of numbers in general triangles on a computer, we find usually a few small factors some of which are repetitive, and a lot of composite parts, which are only possible to be decomposed with a large effort. Pure large prime factors are very rare (in 1 percent of the elements, or even less). 112
5 E.g. in the 112-based triangle we have found 7 pure large prime factors (candidates) more than 600 digits in the middle positions up to the 1750 th row (Tabular 2). Position Prime factor digits 1048, , , , , , , Table 2: Pure large prime factors (candidates) in the 112-based triangle The factorization of element (1726, 1726) is as follows: (5)*(7)^2*( ) Here the last number is the 1002-digit prime candidate. Our goal was to prove the prime property of this candidate. The importance of this proof was to overcome the 1000 decimal-digit limit, since after S. Yates we call these primes titanic ones. He started to collect the list of such numbers and their founders in the mid 80s. 2. Primality Testing 2.1. Introduction As a matter of fact, "primality test" is a procedure for deciding whether a positive integer n is prime or not. Finding an efficient algorithm for solving the above mentioned problem has been occupying the attention of lots of famous mathematicians for hundreds of years. 113
6 We have to distinguish two kinds of primality test methods. An exact primality test gives one of the following two answers: "n is a prime" or "n is a composite number". If we use a probabilistic primality test, the first answer is "n may be a prime". The running time of the probabilistic test is shorter, but we could not be hundred percent sure of the prime property of n. Although the exact tests are exclusively suited for primality proving, the probabilistic tests are very useful for producing so-called "candidates (for primality)". The following statement published by Euler, known as Fermat's Little Theorem, was the basic idea of the probabilistic primality tests: Theorem Let p be a prime and a an arbitrary integer. Then a p a (mod p). In particular, if p does not divide a then a p 1 a (mod p). Unfortunately, there are such n composite integers for that the congruence a n 1 a (mod n) is valid. In general if n is an odd composite number which is relatively prime to a and satisfies the above congruence, then n is a pseudoprime for the base a. We speak about a Carmichael number, if n is a pseudoprime for all bases to which they are relatively prime. Luckily, Carmichael numbers are less than up to Elliptic Curve Primality Proving (ECPP) Due to the total lack of space we give just a schematic description of the oldest and one of the newest exact primality proving methods (see the number-theoretical details in [2] and additional information about the algorithms and their implementation in [3] and [5]). The following routine, which checks the divisors of n from 2 to n, was the first algorithm for primality testing: 1 for d 2 to n 2 do if d n 3 then return COMPOSITE 4 return PRIME Let us observe that with this algorithm it takes a very long time to carry out the primality test for large numbers n. These days the most efficient exact primality testing algorithms are based on the theory of elliptic curves. The basic idea rises from the following theorem which is well-known in Group Theory: Theorem Let n be a candidate for primality and assume that we have a group (mod n), denoted by G. Let G d be the restricted group (mod d) and e the identity in G. If we can find an x G and an integer m satisfying the following conditions, then n is a prime: 114
7 1. m > G q for any prime q, where q n and q < n, 2. x m = e, 3. For each prime p dividing m, some coordinate of x (m/p) e is relatively prime to n. Note that for an integer n and a positive integer m the expression (m/p) is the Jacobi symbol which is the generalization of Legendre symbol to composite numbers. The appropriate group can be constructed with elliptic curves. Let K be one of the fields Q, R, C and Fq, where q is a prime number and Fq is the appropriate finite field. Let us consider the polynomial x 3 + ax + b K[x] from which we can get the base set of the group in the following way: Definition Let E(K) be the set of those points (x, y) K 2 which satisfy the equation y 2 = x 3 + ax + b. Then we say that E(K) is an elliptic curve over K. Note that if 4a b 0 then x 3 + ax + b has three distinct roots. Naturally, we need an identity element in E(K), therefore, let us complete it with the point infinitely far north denoted by O. To get a group we need to define a binary operation on E(K) which is associative and for each element a E(K) there exists an inverse element -a such that a + (-a) = (-a) + a = O. To do this, we can make use of such an extraordinary property of the elliptic curves that if a non-vertical line intersects it at two points, then it will also have a third point of intersection. It can be proved that this third point can be calculated in a similar way. Using additive notation we define the + operation by (x 1, y 1 ) + (x 2, y 2 ) = (x 3, -y 3 ), if (x 2, y 2 ) (x 1, -y 1 ). Thus, the sum of two points is not the third intersection point, but the reflection across the x-axis of it which is still on the same elliptic curve. Let us observe that if (x 2, y 2 ) = (x 1, -y 1 ), these two points define a vertical line which has no third intersection point, thus in this case (x, y) + (x, -y) = (x, -y) + (x, y) = O. It can be proved further that if (x 1, y 1 ), (x 2, y 2 ) are rational points than so is (x 3, -y 3 ). Now, we can define the appropriate group: Definition For a given elliptic curve y 2 = x 3 + ax + b, where 4a b 0, let E denote the group of rational points on the curve together with the identity O with the binary operation +. We present the assertion on which the elliptic curve primality tests are based. Theorem Let n N, (6, n) =1, E n is an elliptic curve over Z/nZ and m, s such integers for that s m. Let us assume that there exists such a point P E n for which m m P O and P O q 115
8 are valid for every prime factor q of s. Then for every prime divisor p of n the congruence E n 0 (mod s) is true, and if (3) then n is a prime number. s 4 n 1 2, Here m and m/q are integers, where c P means repeated addition c-times for point P. Now we can give a schematic pseudocode of ECPP using the notation of the previous theorem. ECPP(n) 1 E n random elliptic curve over over Z/nZ 2 m E n 3 if m = q s, where s is probably prime and the factorization of q is known 4 then goto 8 5 else goto if s n then goto 1 8 P random point from E n 9 if q P is not defined 10 then return COMPOSITE 11 if (m/q) P = O 12 then goto 8 13 if m P O 14 then return COMPOSITE 15 while we are not sure 16 do ECPP(s) During the application of the algorithm we get a strictly monotone decreasing series of numbers s, the first of which is n itself. Practically this algorithm terminates either in case of a composite n, or in a case when s is a small prime, which can be proved by easy effort. The effective proof for our 1002-digit candidate was carried out by the ECPP package version developed by F. Morain. This is a free program, which can be found on page [8]. The running time was sec on a processor AMD Athlon 64. References [1] Bondarenko, B. A., Pascal Triangles and Pyramids, Their Fractals, Graphs and Applications, The Fibonacci Association, Santa Clara, 1993, [2] Bressoud, D. M., Factorization and Primality Testing, Springer-Verlag, New York, 1989,
9 [3] Farkas, G., Kátai, I., Informatical Algorithms (Number Theory) (in Hungarian), ELTE Eötvös Kiadó, Budapest, 2005, [4] Freund, J. E., Restricted Occupancy Theory - A Generalization of Pascal's Triangle, Amer. Math. Monthly, 63 (1956), [5] Járai, A., Computatitonal Number Theory (in Hungarian), ELTE IK, Budapest, 1998, [6] Kallós, G., Generalizations of Pascal s Triangle (in Hungarian), MSc thesis, ELTE, Budapest, 1993, [7] Kallós, G., The Generalization of Pascal's Triangle from Algebraic Point of View, Acta Acad. Paed. Agriensis, XXIV, (1997), [8] Morain, F., The ECPP homepage, [9] Morton, R. L., Pascal's Triangle and Powers of 11, Math. Teacher, 57 (1964), [10] Sloane, N. J. A., On-line Encyclopedia of Integer Sequences, 117
10 118
Fermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
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 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 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 informationFERMAT S TEST KEITH CONRAD
FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
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 information6: Polynomials and Polynomial Functions
6: Polynomials and Polynomial Functions 6-1: Polynomial Functions Okay you know what a variable is A term is a product of constants and powers of variables (for example: x ; 5xy ) For now, let's restrict
More informationUnit 2-1: Factoring and Solving Quadratics. 0. I can add, subtract and multiply polynomial expressions
CP Algebra Unit -1: Factoring and Solving Quadratics NOTE PACKET Name: Period Learning Targets: 0. I can add, subtract and multiply polynomial expressions 1. I can factor using GCF.. I can factor by grouping.
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 informationMath 5330 Spring Notes Congruences
Math 5330 Spring 2018 Notes Congruences One of the fundamental tools of number theory is the congruence. This idea will be critical to most of what we do the rest of the term. This set of notes partially
More informationUNIQUE-PERIOD PRIMES. Chris K. Caldwell 5856 Harry Daniels Road Rives, Tennessee
Appeared in: J. Recreational Math., 29:1 (1998) 43--48. UNIQUE-PERIOD PRIMES Chris K. Caldwell 5856 Harry Daniels Road Rives, Tennessee 38253 email: caldwell@utmartin.edu Harvey Dubner 449 Beverly Road
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 informationAlgebra. Table of Contents
Algebra...4 Patterns...5 Adding Real Numbers...7 Subtracting Real Numbers...9 Multiplying Real Numbers...11 Dividing Real Numbers...12 Order of Operations...13 Real-Number Operations with Absolute Value...16
More informationTHE SOLOVAY STRASSEN TEST
THE SOLOVAY STRASSEN TEST KEITH CONRAD 1. Introduction The Jacobi symbol satisfies many formulas that the Legendre symbol does, such as these: for a, b Z and odd m, n Z +, (1) a b mod n ( a n ) = ( b n
More informationCK-12 Middle School Math Grade 8
CK-12 Middle School Math aligned with COMMON CORE MATH STATE STANDARDS INITIATIVE Middle School Standards for Math Content Common Core Math Standards for CK-12 Middle School Math The Number System (8.NS)
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 informationElliptic curves: Theory and Applications. Day 3: Counting points.
Elliptic curves: Theory and Applications. Day 3: Counting points. Elisa Lorenzo García Université de Rennes 1 13-09-2017 Elisa Lorenzo García (Rennes 1) Elliptic Curves 3 13-09-2017 1 / 26 Counting points:
More informationEULER S THEOREM KEITH CONRAD
EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
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 informationMathathon Round 1 (2 points each)
Mathathon Round ( points each). A circle is inscribed inside a square such that the cube of the radius of the circle is numerically equal to the perimeter of the square. What is the area of the circle?
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 informationElliptic Curves Spring 2013 Lecture #12 03/19/2013
18.783 Elliptic Curves Spring 2013 Lecture #12 03/19/2013 We now consider our first practical application of elliptic curves: factoring integers. Before presenting the elliptic curve method (ECM) for factoring
More information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationTHE MILLER RABIN TEST
THE MILLER RABIN TEST KEITH CONRAD 1. Introduction The Miller Rabin test is the most widely used probabilistic primality test. For odd composite n > 1 at least 75% of numbers from to 1 to n 1 are witnesses
More informationUnit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power.
MODULE 1 1 Polynomial A function that contains 1 or more or terms. The variables may be to any non-negative power. 1 Modeling Mathematical modeling is the process of using, and to represent real world
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 informationRational Numbers and Exponents
Rational and Exponents Math 7 Topic 4 Math 7 Topic 5 Math 8 - Topic 1 4-2: Adding Integers 4-3: Adding Rational 4-4: Subtracting Integers 4-5: Subtracting Rational 4-6: Distance on a Number Line 5-1: Multiplying
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationCryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press
AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis
More informationCP Algebra 2. Unit 2-1 Factoring and Solving Quadratics
CP Algebra Unit -1 Factoring and Solving Quadratics Name: Period: 1 Unit -1 Factoring and Solving Quadratics Learning Targets: 1. I can factor using GCF.. I can factor by grouping. Factoring Quadratic
More informationEuler s, Fermat s and Wilson s Theorems
Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
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 informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationMath 3 Variable Manipulation Part 3 Polynomials A
Math 3 Variable Manipulation Part 3 Polynomials A 1 MATH 1 & 2 REVIEW: VOCABULARY Constant: A term that does not have a variable is called a constant. Example: the number 5 is a constant because it does
More informationContents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition
Contents Preface to the First Edition Preface to the Second Edition Preface to the Third Edition i iii iv Glossary of Symbols A. Prime Numbers 3 A1. Prime values of quadratic functions. 7 A2. Primes connected
More informationORDERS OF UNITS IN MODULAR ARITHMETIC
ORDERS OF UNITS IN MODULAR ARITHMETIC KEITH CONRAD. Introduction If a mod m is a unit then a ϕ(m) mod m by Euler s theorem. Depending on a, it might happen that a n mod m for a positive integer n that
More informationFlorida Math Curriculum (433 topics)
Florida Math 0028 This course covers the topics shown below. Students navigate learning paths based on their level of readiness. Institutional users may customize the scope and sequence to meet curricular
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
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 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 information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationIntermediate Math Circles February 14, 2018 Contest Prep: Number Theory
Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory Part 1: Prime Factorization A prime number is an integer greater than 1 whose only positive divisors are 1 and itself. An integer
More informationPrentice Hall CME Project, Algebra
Prentice Hall Advanced Algebra C O R R E L A T E D T O Oregon High School Standards Draft 6.0, March 2009, Advanced Algebra Advanced Algebra A.A.1 Relations and Functions: Analyze functions and relations
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationFibonacci Pseudoprimes and their Place in Primality Testing
Fibonacci Pseudoprimes and their Place in Primality Testing Carly Allen December 2015 Abstract In this paper, we examine the basic building blocks of the Fibonacci Primality Theorem, as well as the theorem
More informationOleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, , Russia
ON THE NUMBER OF PRIME DIVISORS OF HIGHER-ORDER CARMICHAEL NUMBERS Oleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, 198904, Russia Maxim Vsemirnov Sidney Sussex College,
More informationLARGE PRIME NUMBERS. In sum, Fermat pseudoprimes are reasonable candidates to be prime.
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 informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More information4 Number Theory and Cryptography
4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.
More informationMath 75 Mini-Mod Due Dates Spring 2016
Mini-Mod 1 Whole Numbers Due: 4/3 1.1 Whole Numbers 1.2 Rounding 1.3 Adding Whole Numbers; Estimation 1.4 Subtracting Whole Numbers 1.5 Basic Problem Solving 1.6 Multiplying Whole Numbers 1.7 Dividing
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving integers
More informationMA094 Part 2 - Beginning Algebra Summary
MA094 Part - Beginning Algebra Summary Page of 8/8/0 Big Picture Algebra is Solving Equations with Variables* Variable Variables Linear Equations x 0 MA090 Solution: Point 0 Linear Inequalities x < 0 page
More informationPart 2 - Beginning Algebra Summary
Part - Beginning Algebra Summary Page 1 of 4 1/1/01 1. Numbers... 1.1. Number Lines... 1.. Interval Notation.... Inequalities... 4.1. Linear with 1 Variable... 4. Linear Equations... 5.1. The Cartesian
More informationChapter R - Review of Basic Algebraic Concepts (26 topics, no due date)
Course Name: Math 00023 Course Code: N/A ALEKS Course: Intermediate Algebra Instructor: Master Templates Course Dates: Begin: 08/15/2014 End: 08/15/2015 Course Content: 245 topics Textbook: Miller/O'Neill/Hyde:
More informationGEOMETRY OF BINOMIAL COEFFICIENTS. STEPHEN WOLFRAM The Institute jor Advanced Study, Princeton NJ 08540
Reprinted from the AMERICAN MATHEMATICAL MONTHLY Vol. 91, No.9, November 1984 GEOMETRY OF BINOMIAL COEFFICIENTS STEPHEN WOLFRAM The Institute jor Advanced Study, Princeton NJ 08540 This note describes
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 informationNumbers, Groups and Cryptography. Gordan Savin
Numbers, Groups and Cryptography Gordan Savin Contents Chapter 1. Euclidean Algorithm 5 1. Euclidean Algorithm 5 2. Fundamental Theorem of Arithmetic 9 3. Uniqueness of Factorization 14 4. Efficiency
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationUNCORRECTED SAMPLE PAGES. Extension 1. The binomial expansion and. Digital resources for this chapter
15 Pascal s In Chapter 10 we discussed the factoring of a polynomial into irreducible factors, so that it could be written in a form such as P(x) = (x 4) 2 (x + 1) 3 (x 2 + x + 1). In this chapter we will
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationcorrelated to the Utah 2007 Secondary Math Core Curriculum Algebra 1
correlated to the Utah 2007 Secondary Math Core Curriculum Algebra 1 McDougal Littell Algebra 1 2007 correlated to the Utah 2007 Secondary Math Core Curriculum Algebra 1 The main goal of Algebra is to
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationWXML Final Report: Primality of Polynomials
WXML Final Report: Primality of Polynomials William Stein, Travis Scholl, Astrid Berge, Daria Micovic, Xiaowen Yang Autumn 016 1 Introduction The density of certain types of primes is a classical question
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationMultiplying Products of Prime Powers
Problem 1: Multiplying Products of Prime Powers Each positive integer can be expressed (in a unique way, according to the Fundamental Theorem of Arithmetic) as a product of powers of the prime numbers.
More informationThe New Book of Prime Number Records
Paulo Ribenboim The New Book of Prime Number Records Springer Contents Preface Guiding the Reader Index of Notations ix xv xvii Introduction 1 CHARTER 1 How Many Prime Numbers Are There? 3 I. Euclid's
More informationSelected Chapters from Number Theory and Algebra
Selected Chapters from Number Theory and Algebra A project under construction Franz Rothe Department of Mathematics University of North Carolina at Charlotte Charlotte, NC 83 frothe@uncc.edu December 8,
More informationExtend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1
Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Nico F. Benschop AmSpade Research, The Netherlands Abstract By (p ± 1) p p 2 ± 1 mod p 3 and by the lattice structure of Z(.) mod q
More information1: Please compute the Jacobi symbol ( 99
SCORE/xx: Math 470 Communications Cryptography NAME: PRACTICE FINAL Please show your work write only in pen. Notes are forbidden. Calculators, all other electronic devices, are forbidden. Brains are encouraged,
More information7. Prime Numbers Part VI of PJE
7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.
More informationThe RSA cryptosystem and primality tests
Mathematics, KTH Bengt Ek November 2015 Supplementary material for SF2736, Discrete mathematics: The RSA cryptosystem and primality tests Secret codes (i.e. codes used to make messages unreadable to outsiders
More informationA characterization of the identity function
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae, 4. 1997) pp. 3 9 A characterization of the identity function BUI MINH PHONG Abstract. We prove that if a multiplicative function f satisfies
More informationAlgorithms (II) Yu Yu. Shanghai Jiaotong University
Algorithms (II) Yu Yu Shanghai Jiaotong University Chapter 1. Algorithms with Numbers Two seemingly similar problems Factoring: Given a number N, express it as a product of its prime factors. Primality:
More informationASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9.
ASSIGNMENT 1 1. Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. 2. (i) If d a and d b, prove that d (a + b). (ii) More generally,
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationTopic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number
Topic Contents Factoring Methods Unit 3 The smallest divisor of an integer The GCD of two numbers Generating prime numbers Computing prime factors of an integer Generating pseudo random numbers Raising
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationPseudoprimes and Carmichael Numbers
Pseudoprimes and Carmichael Numbers Emily Riemer MATH0420 May 3, 2016 1 Fermat s Little Theorem and Primality Fermat s Little Theorem is foundational to the study of Carmichael numbers and many classes
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationDefining Valuation Rings
East Carolina University, Greenville, North Carolina, USA June 8, 2018 Outline 1 What? Valuations and Valuation Rings Definability Questions in Number Theory 2 Why? Some Questions and Answers Becoming
More informationBasic Math. Curriculum (358 topics additional topics)
Basic Math This course covers the topics outlined below and is available for use with integrated, interactive ebooks. You can customize the scope and sequence of this course to meet your curricular needs.
More information6.5 Elliptic Curves Over the Rational Numbers
6.5 Elliptic Curves Over the Rational Numbers 117 FIGURE 6.5. Louis J. Mordell 6.5 Elliptic Curves Over the Rational Numbers Let E be an elliptic curve defined over Q. The following is a deep theorem about
More informationOn New Identities For Mersenne Numbers
Applied Mathematics E-Notes, 18018), 100-105 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ On New Identities For Mersenne Numbers Taras Goy Received April 017 Abstract
More informationarxiv: v1 [math.nt] 29 Jul 2014
A PRIMALITY CRITERION BASED ON A LUCAS CONGRUENCE ROMEO MEŠTROVIĆ arxiv:407.7894v [math.nt] 29 Jul 204 ABSTRACT. Let p be a prime. In 878 É. Lucas proved that the congruence ( ) p ( ) (mod p) holds for
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 information