Perfect Power Riesel Numbers
|
|
- Brett Burns
- 5 years ago
- Views:
Transcription
1 Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA b Department of Mathematics, Shippensburg University, Shippensburg, PA Abstract A Riesel number k is an odd positive integer such that k 2 n 1 is composite for all integers n 1. In 2003, Chen proved that there are infinitely many Riesel numbers of the form k r, when r 0, 4, 6, 8 (mod 12), and he conjectured that such Riesel powers exist for all positive integers r. In 2008, Filaseta, Finch and Kozek extended Chen s theorem slightly by constructing Riesel numbers of the form k 4 and k 6. In this article, we extend these results further by proving that there exist infinitely many Riesel numbers of the form k r for any positive integer r that is coprime to 105. Keywords: Riesel number, covering 2010 MSC: 11B83, 11Y05 1. Introduction A Riesel number k is an odd positive integer with the property that k 2 n 1 is composite for all natural numbers n. The smallest known Riesel number is ; indeed, H. Riesel [9] showed that if k (mod ), then k is a Riesel number. It is believed that is the smallest Riesel number. As of this writing, there are 52 odd positive integers smaller that that are still candidates. See html for the most up-to-date information. In 2003, Y.G. Chen [2] showed that there are perfect power Riesel numbers for certain powers. In particular, for values of r that are either odd or twice an odd number not divisible by 3, he constructed integers k such that k r 2 n 1 is composite for all natural numbers n. Furthermore, Chen conjectured that there are Riesel numbers that are perfect rth powers for any positive integer r. In 2008, Filaseta, Finch and Kozek [5] provided further evidence for Chen s conjecture by proving for each n {4, 6} that there exists a set T n of Preprint submitted to Journal of Number Theory October 26, 2014
2 positive density such that each element in T n is a Riesel number of the form k r with r 0 (mod n). In this paper, we extend these previous results by establishing the following theorem. Theorem 1.1. For any positive integer r with gcd(r, 105) = 1, there exist infinitely many odd positive integers k such that k r 2 n 1 is composite for all integers n 1. Moreover, k r 2 n 1 has at least two distinct prime divisors for each value of n, when r Preliminaries The following concept, due to Erdős [4], is crucial to the proof of Theorem 1.1. Definition 2.1. A covering of the integers is a finite system of congruences x a i (mod m i ), where m i > 1, such that every integer n satisfies at least one of the congruences. For brevity of notation, we present a covering C as a set of ordered pairs (a i, m i ). We let L C denote the least common multiple of all the moduli m i occurring in C. Quite often when a covering C is used to solve a problem, there is a set of prime numbers associated with C. In the situation occurring in this article, for each (a i, m i ) C, there exists a corresponding prime p i, such that 2 m i 1 (mod p i ), where 2 s 1 (mod p i ) for all positive integers s < m i. We call such a prime a primitive divisor of 2 m i 1. In terms of group theory, a primitive divisor p of 2 m 1, where m > 1 is an integer, is a prime such that in the group of units modulo p, which we denote (Z p ), the element 2 has order m. We denote the order of the integer z modulo a prime p as ord p (z). A covering with certain restrictions on the moduli is used to establish Theorem 1.1. To build this covering, we can use a particular modulus m > 1 as many times as there are distinct primitive divisors of 2 m 1. It is well known that 2 m 1, with m > 1, has at least one primitive divisor as long as m 6. This result is originally due to Bang [1]. Two additional facts are needed here. The first result is due to Darmon and Granville [3]. Theorem 2.2 ([3]). Let A, B and C be nonzero integers. Let p, q and r be positive integers for which < 1. Then the generalized Fermat p q r equation Ax p + By q = Cz r has only finitely many solutions in integers x, y and z with gcd(x, y, z) = 1. 2
3 Lemma 2.3. Given integers P > 0 and r 3, there is a positive integer Y := Y (P, r) such that if k is an odd integer with k > Y and n is a positive integer, then k r 2 n 1 has a prime factor that is greater than P. Proof. Fix P and r as in the statement of the lemma. It suffices to show that there are only finitely many ordered pairs (k, n) with k odd such that k r 2 n 1 = p f 1 1 p ft t, (1) where the p i are all the distinct primes with p i P, and the f i are nonnegative integers. Suppose (1) holds with k odd. We put n = rn 1 + n 0 and f i = ru i + v i for each i {1, 2,..., t}, where n 1, u 1, u 2,... u t Z and n 0, v 1, v 2,..., v t {0, 1, 2,... r 1}. Then, we can rewrite (1) as p v 1 1 p vt t (p u 1 1 p ut t ) r 2 n 0 (2 n 1 k) r = 1. (2) Observe that, for r 3, the sum of the reciprocals of the generalized Fermat equation Ax r By r = Cz r+1, (3) where A, B and C are nonzero integers, is < 1. Thus, by Theorem 2.2, (3) has only finitely many solutions in integers x, y and z, with gcd(x, y, z) = 1. In particular, we let A = p v 1 1 p vt t, B = 2 n 0 and C = 1, and also suppose that z = 1. Then there are r t possibilities for A, depending on the v i, and r possibilities for B depending on n 0. We deduce that there are only finitely many possibilities for p u 1 1 p ut t and 2 n 1 k in (2) and, consequently, at most finitely many pairs (k, n) satisfying (1). Remark 2.4. An argument similar to the proof of Lemma 2.3 can be used to show that, given integers P > 0 and r 2, there is a positive integer Y := Y (P, r) such that if k is an odd integer with k > Y and n is a positive integer, then k r 2 n has a prime factor that is greater than P [5]. 3. The Proof of Theorem 1.1 To facilitate the building of a covering that can be used to establish Theorem 1.1, we prove and apply an extension of a group-theoretic result employed in [6]. Unlike the situation in [6], this extension has the advantage of being independent of the residues in our covering. 3
4 Lemma 3.1. Let m, r > 1 be integers such that gcd(m, r) = 1. Let p be an odd prime with p 1 (mod m), and let v (Z p ). If m 0 (mod ord p (v)), then there exists u (Z p ) such that v u r (mod p). In other words, v is an rth power modulo p. Proof. Let H = {x (Z p ) x m = 1}. Then H is a subgroup of (Z p ) with H = gcd(p 1, m) = m. Define a homomorphism θ : H H, by θ(h) = h r. Then the kernel of θ is precisely { h H h r = 1 } = {1}, since gcd(m, r) = 1. Hence, θ is an automorphism, and there exists u H such that v = θ(u) = u r. The following corollary, which is an immediate consequence of Lemma 3.1, is useful in our situation. Corollary 3.2. Let m > 1 be an integer with m 6, and let p be a primitive divisor of 2 m 1. If r is an integer with gcd(m, r) = 1, then 2 is an rth power modulo p The Proof of Theorem 1.1 Let C be a covering and let P be the set of all primes associated to C. What we deduce from Corollary 3.2 is that, given (a i, m i ) C with corresponding prime p i P, and a positive integer r with gcd(m i, r) = 1, there exists u i (Z pi ), such that u r i 2 a i (mod p i ). Thus, u r i 2 n 1 is divisible by p i whenever n a i (mod m i ). Therefore, Corollary 3.2 suggests that to maximize the density of the r-values captured, we should build C in which the number of distinct prime divisors of L C is minimized. This is precisely our strategy. We build our covering C with L C = = To determine how many times a particular modulus can be used in our covering, we first refer to the tables at [7, 8, 10]. These tables contain primitive divisors for numbers of the form 2 m 1, for certain values of m. If no information is given in these tables for a particular modulus m that we choose to use in our covering, then we simply use that particular modulus exactly one time since we are guaranteed to have at least one primitive divisor by Bang s theorem. Some of the prime divisors for 2 m 1 are not explicitly listed in the tables at [7, 8, 10], and since the primes that are actually listed are sometimes quite large, we refrain from providing them here. However, we do list below the congruences in our covering C, which was calculated using Magma and Maple. We point out that not every modulus m is used the maximum number of allowable times. For example, has nine 4
5 primitive divisors, but we only use the modulus m = 1225 eight times since using it more times is redundant with the choice of residues in C. Indeed, the covering C is minimal in the sense that no proper subset of C is a covering. The covering C contains 93 congruences and is C ={(1, 3), (4, 5), (0, 7), (2, 9), (3, 15), (9, 21), (0, 25), (20, 25), (26, 27), (12, 35), (31, 35), (23, 45), (32, 45), (20, 49), (39, 63), (60, 63), (15, 75), (30, 75), (44, 81), (71, 81), (17, 81), (36, 105), (57, 105), (87, 105), (8, 135), (116, 135), (131, 135), (111, 147), (110, 175), (85, 175), (10, 175), (18, 189), (81, 189), (140, 225), (5, 225), (176, 225), (131, 225), (116, 243), (35, 243), (197, 243), (8, 243), (6, 245), (181, 245), (201, 315), (96, 315), (306, 315), (62, 405), (332, 405), (305, 405), (321, 441), (342, 441), (174, 441), (195, 441), (447, 525), (132, 525), (342, 525), (510, 525), (446, 675), (311, 675), (221, 675), (86, 675), (531, 735), (132, 735), (447, 735), (321, 735), (636, 735), (237, 735), (522, 945), (711, 945), (575, 1215), (170, 1215), (491, 1215), (410, 1225), (1110, 1225), (760, 1225), (235, 1225), (60, 1225), (585, 1225), (935, 1225), (1077, 1225), (860, 1575), (1535, 1575), (491, 1575), (1391, 1575), (1166, 1575), (716, 1575), (167, 1701), (27, 2205), (2246, 2835), (41, 4725), (1812, 11025), (3191, 14175), (26816, 42525)}. Next, for any fixed r with gcd(r, 105) = 1, we apply the Chinese remainder theorem to the set of congruences { } {k 1 (mod 2)} k u i (mod p i ) i = 1,..., 93 to get infinitely many odd positive integers k in arithmetic progression, such that, for each integer n 1, we have that k r 2 n 1 is divisible by some prime in P. Since k r 2 n 1 > p i P for all i and n, the first part of the theorem is established. By Lemma 2.3, with P equal to the largest element in P, we deduce, when r 4, that there exist infinitely many values of k in our arithmetic progression such that k r 2 n 1 has at least two distinct prime divisors, and the proof of the theorem is complete. 5
6 4. Comments and Conclusions One of the first questions that comes to mind is: Can we do better?. In that regard, the techniques used in this paper contain an inherent weakness. Obviously, we cannot create a covering C such that L C has no prime divisors. Thus, we will always have holes in the set of values of r we are able to achieve using a single covering. We could attempt to patch these holes using multiple coverings with different values of L C, but there will still be holes corresponding to the overlap of the missing values in each situation. For example, using the covering C given in the proof of Theorem 1.1, we have captured r = 22 but not r = 6. If we can find a second covering C that captures all values of r with gcd(r, 11) = 1, but not values of r 0 (mod 11), then from C alone we have captured r = 6 but not r = 22. Together, of course, we have captured both r = 6 and r = 22, but we still have not captured r = 66. Aside from this drawback, it seems unlikely that we can achieve a better result using a single covering C C. Here, better means that either L C is odd and has exactly two distinct prime divisors, or L C is odd and has exactly three distinct prime divisors other than 3, 5 and 7. One difficulty in constructing C arises from the lack of the availability of enough primitive divisors, since repeated moduli must be used to compensate for the restrictions on the divisors of the moduli. Although we cannot provide a proof, we conjecture, for example, that it is impossible to construct a covering C satisfying both of the following conditions: the only prime divisors of L C are 3 and 5 each modulus m in C can be used as many times as there are primitive divisors of 2 m 1. References [1] A. S. Bang, Taltheoretiske Undersøgelser, Tidsskrift for Mat. 5(4) (1886), 70 80, [2] Y.-G. Chen, On integers of the forms k r 2 n and k r 2 n + 1, J. Number Theory 98 (2003), [3] H. Darmon and A. Granville, On the equations z m = F (x, y) and Ax p + By q = Cz r, Bull. London Math. Soc. 27 (1995),
7 [4] P. Erdős, On integers of the form 2k + p and some related problems, Summa Brasil Math, 29 (1949), [5] M. Filaseta, C. E. Finch, and M. R. Kozek, On powers associated with Sierpiński numbers, Riesel numbers and Polignac s conjecture, J. Number Theory 128 (2008), no. 7, [6] C. Finch, J. Harrington and L. Jones, Nonlinear Sierpiński and Riesel numbers, J. Number Theory 133 (2013), no. 2, [7] [8] P. Leyland, cunningham/2-.txt. [9] H. Riesel, Några stora primtal, Elementa 39 (1956) [10] S. S. Wagstaff, pmain814. 7
AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS
#A88 INTEGERS 18 (2018) AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS Joshua Harrington Department of Mathematics, Cedar Crest College, Allentown, Pennsylvania joshua.harrington@cedarcrest.edu
More informationPOLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS
#A40 INTEGERS 16 (2016) POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS Daniel Baczkowski Department of Mathematics, The University of Findlay, Findlay, Ohio
More information#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationChris K. Caldwell 1 Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN 38238, USA
#A36 INTEGERS 10 (2010), 423-436 POWERS OF SIERPIŃSKI NUMBERS BASE B Chris K. Caldwell 1 Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN 38238, USA caldwell@utm.edu
More informationAppending Digits to Generate an Infinite Sequence of Composite Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 2011, Article 11.5.7 Appending Digits to Generate an Infinite Sequence of Composite Numbers Lenny Jones and Daniel White Department of Mathematics
More informationJournal of Number Theory
Journal of Number Theory 132 (2012) 2836 2841 Contents lists available at SciVerse ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt On Cullen numbers which are both Riesel and Sierpiński
More informationMarcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela
#A89 INTEGERS 16 (016) ON SIERPIŃSKI NUMBERS OF THE FORM '(N)/ n Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela mago@usb.ve
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
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 informationWe only consider r finite. P. Erdős, On integers of the form 2 k +p and some related problems, Summa Brasil. Math. 2 (1950),
U niv e rsit y o f S o u th C ar o l ina e lf i las e ta b y M i cha A covering of the integers is a system of congruences x a j (mod m j ), j = 1, 2,..., r, with a j and m j integral and with m j 1, such
More informationEXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES
#A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny
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 informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
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 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 informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
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 informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d
10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to
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 informationPMA225 Practice Exam questions and solutions Victor P. Snaith
PMA225 Practice Exam questions and solutions 2005 Victor P. Snaith November 9, 2005 The duration of the PMA225 exam will be 2 HOURS. The rubric for the PMA225 exam will be: Answer any four questions. You
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationCovering Subsets of the Integers and a Result on Digits of Fibonacci Numbers
University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationRepresenting numbers as the sum of squares and powers in the ring Z n
Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two
More informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
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 informationOn Anti-Elite Prime Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.9.4 On Anti-Elite Prime Numbers Tom Müller Institut für Cusanus-Forschung an der Universität und der Theologischen Fakultät Trier
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 informationON NEAR RELATIVE PRIME NUMBER IN A SEQUENCE OF POSITIVE INTEGERS. Jyhmin Kuo and Hung-Lin Fu
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 123-129, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ ON NEAR RELATIVE PRIME NUMBER IN A SEQUENCE OF POSITIVE INTEGERS
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 informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationOn squares in Lucas sequences
On squares in Lucas sequences A. Bremner N. Tzanakis July, 2006 Abstract Let P and Q be non-zero integers. The Lucas sequence {U n (P, Q)} is defined by U 0 = 0, U 1 = 1, U n = P U n 1 QU n 2 (n 2). The
More information1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained
More informationTheory of Numbers Problems
Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationLECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS
LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite
More informationThe Composite Two-Step
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017), Article 17.9.1 The Composite Two-Step Eric Kaper Department of Mathematics University of Kentucky Lexington, KY 40506 USA eric.kaper@uky.edu
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS
ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More information#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S
#A42 INTEGERS 10 (2010), 497-515 ON THE ITERATION OF A FUNCTION RELATED TO EULER S φ-function Joshua Harrington Department of Mathematics, University of South Carolina, Columbia, SC 29208 jh3293@yahoo.com
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
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 informationON THE REDUCIBILITY OF EXACT COVERING SYSTEMS
ON THE REDUCIBILITY OF EXACT COVERING SYSTEMS OFIR SCHNABEL arxiv:1402.3957v2 [math.co] 2 Jun 2015 Abstract. There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
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 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 informationOn integers of the forms k ± 2 n and k2 n ± 1
Journal of Number Theory 125 2007 14 25 www.elsevier.com/locate/jnt On integers of the forms k ± 2 n and k2 n ± 1 Yong-Gao Chen Department of Mathematics, Nanjing Normal University, Nanjing 210097, Jiangsu,
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationSolutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00
Solutions to 18.781 Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 1. (Niven 2.3.3) Solve the congruences x 1 (mod 4), x 0 (mod 3), x 5 (mod 7). First we note that 4, 3, and 7 are pairwise relatively
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More information4.4 Solving Congruences using Inverses
4.4 Solving Congruences using Inverses Solving linear congruences is analogous to solving linear equations in calculus. Our first goal is to solve the linear congruence ax b pmod mq for x. Unfortunately
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 informationA Curious Connection Between Fermat Numbers and Finite Groups
A Curious Connection Between Fermat Numbers and Finite Groups Carrie E. Finch and Lenny Jones 1. INTRODUCTION. In the seventeenth century, Fermat defined the sequence of numbers F n = 2 2n + 1 for n 0,
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT115A-21 Summer Session 2 2018 Practice Final Solutions Name: Time Limit: 1 Hour 40 Minutes Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationBasic Algorithms in Number Theory
Basic Algorithms in Number Theory Algorithmic Complexity... 1 Basic Algorithms in Number Theory Francesco Pappalardi #2 - Discrete Logs, Modular Square Roots, Polynomials, Hensel s Lemma & Chinese Remainder
More informationBasic Algorithms in Number Theory
Basic Algorithms in Number Theory Algorithmic Complexity... 1 Basic Algorithms in Number Theory Francesco Pappalardi Discrete Logs, Modular Square Roots & Euclidean Algorithm. July 20 th 2010 Basic Algorithms
More informationCarmichael numbers and the sieve
June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 8 1 The following are equivalent (TFAE) 2 Inverses 3 More on Multiplicative Inverses 4 Linear Congruence Theorem 2 [LCT2] 5 Fermat
More information2 More on Congruences
2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever
More informationAlmost fifth powers in arithmetic progression
Almost fifth powers in arithmetic progression L. Hajdu and T. Kovács University of Debrecen, Institute of Mathematics and the Number Theory Research Group of the Hungarian Academy of Sciences Debrecen,
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
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 informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More information#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS
#A9 INTEGERS 12 (2012) PRIMITIVE PRIME DIVISORS IN ZERO ORBITS OF POLYNOMIALS Kevin Doerksen Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada kdoerkse@gmail.com Anna Haensch Department
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationPREPARATION NOTES FOR NUMBER THEORY PRACTICE WED. OCT. 3,2012
PREPARATION NOTES FOR NUMBER THEORY PRACTICE WED. OCT. 3,2012 0.1. Basic Num. Th. Techniques/Theorems/Terms. Modular arithmetic, Chinese Remainder Theorem, Little Fermat, Euler, Wilson, totient, Euclidean
More informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
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 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 informationThis is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
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 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 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 informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationColloq. Math. 145(2016), no. 1, ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS. 1. Introduction. x(x 1) (1.1) p m (x) = (m 2) + x.
Colloq. Math. 145(016), no. 1, 149-155. ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS FAN GE AND ZHI-WEI SUN Abstract. For m = 3, 4,... those p m (x) = (m )x(x 1)/ + x with x Z are called generalized
More informationarxiv: v1 [math.nt] 8 Sep 2014
arxiv:1409.2463v1 [math.nt] 8 Sep 2014 On the Diophantine equation X 2N +2 2α 5 2β p 2γ = Z 5 Eva G. Goedhart and Helen G. Grundman Abstract We prove that for each odd prime p, positive integer α, and
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
More information