# PRIME FACTORS OF CONSECUTIVE INTEGERS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers all of whose prime factors exceed k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton. 1. Introduction A classic theorem of Sylvester [15] (see also [13]) states that if n and k are positive integers, with n > k, then the product of k consecutive integers Π n,k = n(n + 1) (n + k 1) is necessarily divisible by a prime p > k (i.e. P (Π n,k ) > k, where P (m) denotes greatest prime divisor of a positive integer m). If we therefore, following Erdős [6], define f(k) to be the least integer with the property that P ( Π n,f(k) ) > k whenever n > k, it follows that f(k) k. Asymptotically, one may in fact show that log k (log log k)(log log log log k) k log log log k (log log log k) 2 f(k) log k (log log k), via work of Rankin [12] and Shorey [14], respectively. Standard heuristics for the size of gaps between consecutive primes lead one to expect that, in fact, the actual order of magnitude of f(k) is (log k) 2. The explicit computation of f(k) for k 10 was carried out by Utz [16] (resolving a conjecture of Erdős [6]) and subsequently extended to k 42 by Lehmer [11], to k 46 by Ecklund and Eggleton [2], and to k 73 by Ecklund, Eggleton and Selfridge [3], [4]. We tabulate these results as follows : k f(k) k f(k) k f(k) In [2], Ecklund and Eggleton posed the question of whether or not f(k) is monotone and conjectured that it is not in fact they expressed a strong belief that f(113) = 14 and f(114) = 13 (and that f(127) = 12). In this short note, we will present a new algorithm for computing f(k) which will enable us to confirm Ecklund and Eggleton s suspicions. In particular, we prove the following : Received by the editors March 13, Mathematics Subject Classification. Primary 11N25, Secondary 11D09. The authors were supported in part by grants from NSERC. 1

2 2 MARK BAUER AND MICHAEL A. BENNETT Theorem 1.1. If 74 k 178, then the values of f(k) are as follows : k f(k) k f(k) The fact that f(114) < f(113) contradicts an assertion of Utz [16] to the effect that if k is composite, the value of f(k) is that of f(p), where p is the largest prime smaller than k. That this statement might potentially be false was already noted by Ecklund and Eggleton [2]. 2. The algorithm For fixed m and t, we will in fact consider the problem of classifying those positive integers n for which (2.1) P (Π n,m ) p t where p t is the t-th prime. Instead of proceeding as in Lehmer [11], where first inequality (2.1) is treated in case m = 2 and then extended to larger values of m, we will argue as follows. For any given m 3, we will split 4 [m/4] (or m 1, if m 1 (mod 4)) of the indices 0,, m 1 into disjoint pairs of the form (i, i + 2), where i 0, 1 (mod 4). There are [ m ] [ ] m such pairs. Choose t 0 such that π(m 1) t 0 t. If m 3, we can thus find an i [0, m 3] such that the product (n + i)(n + i + 2) is divisible by at most [ ] t t 0 (2.2) N = [ m ] [ 4 + m+1 ] 4 of the primes in (2.3) {p t0+1,, p t }. Writing D > 1 for the largest square-free integer dividing (n + i)(n + i + 2) and setting DY 2 = (n + i)(n + i + 2) and X = n + i + 1, we find that X 2 DY 2 = 1, whereby, if (T 1, U 1 ) are the smallest positive integers for which x 2 Dy 2 = 1, there necessarily exists a positive integer d for which (X, Y ) = (T d, U d ), where T d + ( D U d = T 1 + ) d D U 1. Classic results on primitive divisors (see e.g. Carmichael [1]; in this setting, this probably dates back rather earlier to Lucas) ensure that, at least for d > 12, there is a prime dividing U d that does not divide DU j for j < d. Since work of Lehmer

3 PRIME FACTORS 3 [9] guarantees that if an odd prime p divides some U d, then it necessarily divides U j where ( p (2.4) j 2 ) D p we conclude, from the assumption P (U d ) p t, that { } pt + 1 (2.5) d max, Our algorithm thus proceeds as follows. For each of the N ( ) t t0 (2.6) M = t0 j values of D under consideration (trivially omitting D = 1), we first compute the corresponding fundamental solution (T 1, U 1 ). Since we assume that P (T d U d D) p t and since T 1 U 1 T d U d, we need only consider those D for which both P (T 1 U 1 ) p t and with DU 1 divisible by at most N of the primes in (2.3). For each such D, we can compute (T d, U d ) for all d satisfying (2.5), via recursion say, and check whether P (T d U d ) p t and whether DU d is divisible by at most N primes in (2.3). Actually, we can usually get away with restricting our attention to prime values of d (since T p U p divides T d U d whenever p d), and moreover employ (2.4) to further reduce our computations. Essentially, what this algorithm accomplishes is to find all positive integers r such that P (r 3 r) p t, under the additional constraint that r 2 1 is divisible by at most N primes in (2.3). Having carried this out, in order to find all solutions to (2.1), it is left to see whether P (r ± j) p t holds for at least m consecutive integers of the form r ± j satisfying j m 2. Each r satisfying these criteria yields an integer n such that P (Π n,m ) p t, and possibly several such n with n [r (m 2), r + (m 2)]. The calculation of f(k) proceeds in two stages from here. Using the list of integers r that are output by the algorithm, we can find all integers n satisfying P (Π n,m ) k. If all such n are at most k in size, then this establishes an upper bound for f(k), namely, f(k) m. If we already know (say via naive search) an integer n > k such that P (Π n,m 1 ) k, then f(k) m and we may conclude that f(k) = m. Otherwise, we rerun the algorithm to classify those integers with P (Π n,m 1 ) k, and, if necessary, iterate the process, at each stage replacing m i by m i 1. If, on the other hand, our list of n for which P (Π n,m ) k contains an n > k such that P (Π n,m ) k, then f(k) > m. To determine f(k) explicitly, we merely examine all n with this property, and find, for each such n, the largest integer m n with the property that P (Π n,mn ) k. Then f(k) = max n {m n } + 1. j=0, 3. Computations By way of example, to find the values of n for which P (Π n,12 ) 173, we take t = 40 and m = 12. Our goal is to choose t 0 in such a way that the number of discriminants we need to consider, M as defined in (2.6), is minimized. In general, it

4 4 MARK BAUER AND MICHAEL A. BENNETT is easy to show that the optimal choice for t 0 comes from taking either t 0 = π(m 1) or from choosing t 0 to be the minimal integer with t 0 π(m 1) satisfying ( [ m ] [ ]) m + 1 t 0 t + 1 mod In the case (t, m) = (40, 12), this leads to t 0 = 5, with corresponding number of discriminants M = Proceeding as described above, we find that 2692 of these discriminants yield a suitable T 1 and U 1 satisfying both P (T 1 U 1 ) 173 and D U 1 divisible by at most 5 of the primes between 13 and 173. Corresponding to these, we find that 183 pairs (T d, U d ) (10 of which have d > 1) lead to n with P (Π n,12 ) 173. The values for r found using the algorithm satisfy r 175, 295 r 303 and 319 r 327. Calculating the corresponding n enables us to conclude as follows : Proposition 3.1. The positive integer n for which P (Π n,12 ) 173 are precisely those with either n 167 or n {294, 295, 318, 319}. From our remarks at the close of the preceding section and the fact that P (Π 294,13 ) = 151 and P (Π 318,13 ) = 163, we conclude that f(k) = 14 for 151 k 178. Similarly, from P (Π 200,11 ) = 103 and P (Π 114,13 ) = 61, it follows that, for 61 k 113, we have f(k) = 14, while f(114) = 13 and, for 115 k 150, f(k) = 12, as suspected by Ecklund and Eggleton. This completes the proof of Theorem Concluding remarks The computations leading to Proposition 3.1 were split and run in parallel (the algorithm is clearly well suited to parallelization) on a Mac PowerPC dual core 2.5 GHz processor, taking a total of just over 58 hours of processing time. Computationally, as one might expect, the costly step is the computation of fundamental units in real quadratic fields; the complexity of this part of the algorithm is well understood (see e.g [17]). The number of fields under consideration, M, is typically, for a good choice of t 0, substantially smaller than 2 t 1, the analogous quantity in Lehmer s approach (at least provided k > 3). Indeed, if we suppose that t is a fixed constant multiple of m, say t = κm with κ > 1, and take t 0 = π(m 1), then we have M = 2 (1+o(1)) m log m, which compares rather favourably with 2 κm. References [1] R. D. Carmichael. On the numerical factors of arithmetic forms α n ± β n. Ann. Math. 15 (1913), [2] E. F. Ecklund, Jr. and R. B. Eggleton. Prime factors of consecutive integers. Amer. Math. Monthly 79 (1972), [3] E. F. Ecklund, Jr., R. B. Eggleton and J. L. Selfridge. Factors of consecutive integers. Proc. Man. Conference Numerical Maths., Winnipeg (1971), [4] E. F. Ecklund, Jr., R. B. Eggleton and J. L. Selfridge. Consecutive integers all of whose prime factors belong to a given set. Proc. Man. Conference Numerical Maths., Winnipeg (1971),

5 PRIME FACTORS 5 [5] R.B. Eggleton and J.L. Selfridge. Consecutive integers with no large prime factors. J. Austral. Math. Soc. Ser. A 22 (1976), no. 1, [6] P.Erdős. On consecutive integers. Nieuw Arch. Wisk. 3 (1955), [7] P. Erdős and R. L. Graham. Old and New Problems and Results in Combinatorial Number Theory. Monograph Enseign. Math. 28, Geneva, [8] R. K. Guy. Unsolved Problems in Number Theory. 3rd ed. Springer, [9] D. H. Lehmer. An extended theory of Lucas functions. Ann. Math. 31 (1930), [10] D. H. Lehmer. On a problem of Störmer. Illinois J. Math. 8 (1964), [11] D. H. Lehmer. The prime factors of consecutive integers. Amer. Math. Monthly 72 (1965), [12] R. Rankin. The difference between consecutive prime numbers. J. London Math. Soc. 13 (1938), [13] J. Schur. Einege Sätze über Primzahlen mit Anwendung auf Irreduzibilitätsfragen. S.-B. Deutsch. Akad. Wiss Berlin Kl. Math. Phys. Tech. 23 (1929), [14] T.N. Shorey. On gaps between numbers with a large prime factor II. Acta Arith. 25 (1974), [15] J. J. Sylvester. On arithmetical series. Messenger Math. 21 (1892), 1 19, [16] W. R. Utz. A conjecture of Erdős concerning consecutive integers. Amer. Math. Monthly 68 (1961), [17] H. C. Williams. Solving the Pell equation. Number theory for the millennium, III (Urbana, IL, 2000), , A K Peters, Natick, MA, Department of Mathematics, University of Calgary, Calgary AB address: Department of Mathematics, University of British Columbia, Vancouver BC address:

### On the largest prime factor of x 2 1

On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical

### On the greatest and least prime factors of n! + 1, II

Publ. Math. Debrecen Manuscript May 7, 004 On the greatest and least prime factors of n! + 1, II By C.L. Stewart In memory of Béla Brindza Abstract. Let ε be a positive real number. We prove that 145 1

### On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression

On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials

### On the largest prime factor of the Mersenne numbers

On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801, USA ford@math.uiuc.edu Florian Luca Instituto

### ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM

Acta Math. Univ. Comenianae Vol. LXXXI, (01), pp. 03 09 03 ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### On the Union of Arithmetic Progressions

On the Union of Arithmetic Progressions Shoni Gilboa Rom Pinchasi August, 04 Abstract We show that for any integer n and real ɛ > 0, the union of n arithmetic progressions with pairwise distinct differences,

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

### The square-free kernel of x 2n a 2n

ACTA ARITHMETICA 101.2 (2002) The square-free kernel of x 2n a 2n by Paulo Ribenboim (Kingston, Ont.) Dedicated to my long-time friend and collaborator Wayne McDaniel, at the occasion of his retirement

### ON THE PRIME FACTORIZATION OF BINOMIAL COEFFICIENTS

J. Austral. Math. Soc. (Series A 26 (1978, 257-269 ON THE PRIME FACTORIZATION OF BINOMIAL COEFFICIENTS E. F. ECKLUND, JR., R. B. EGGLETON, P. ERDŐS and J. L. SELFRIDGE Dedicated to Kurt Mahler on his 75th

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### The sum of digits of polynomial values in arithmetic progressions

The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS

ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number

### MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS

1 CHAPTER 6. MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 Introduction Recurrence

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### AMBIGUOUS CLASSES IN QUADRATIC FIELDS

MATHEMATICS OF COMPUTATION VOLUME, NUMBER 0 JULY 99, PAGES -0 AMBIGUOUS CLASSES IN QUADRATIC FIELDS R. A. MOLLIN Dedicated to the memory ofd. H. Lehmer Abstract. We provide sufficient conditions for the

### Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences

Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences Brian Rice brice@hmc.edu July 19, 2006 Abstract The question of which terms of a recurrence sequence fail to have primitive prime

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### Characterizing the Sum of Two Cubes

1 3 47 6 3 11 Journal of Integer Sequences, Vol. 6 (003), Article 03.4.6 Characterizing the Sum of Two Cubes Kevin A. Broughan University of Waikato Hamilton 001 New Zealand kab@waikato.ac.nz Abstract

### arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### 2 Primality and Compositeness Tests

Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 33, 1635-1642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/

### Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### On the number-theoretic functions ν(n) and Ω(n)

ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,

### Generalizing the Ramsey Problem through Diameter

Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

### 12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Prime and Composite Terms in Sloane s Sequence A056542

1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.3 Prime and Composite Terms in Sloane s Sequence A056542 Tom Müller Institute for Cusanus-Research University and Theological

### THE PRODUCT OF CONSECUTIVE INTEGERS 29 3 (n + 1)... (n + k) to the first power. This conjecture, if true, seems very deep. The requirement of k >_ 4 i

THE PRODUCT OF CONSECUTIVE INTEGERS IS NEVER A POWER P. BY ERDŐS AND J. L. SELFRIDGE We dedicate this paper to the memory of our friends H. Davenport, Ju.V. Linnik, L. J. Mordell, L. Moser, A. Rényi and

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Finding Carmichael numbers

Finding Carmichael numbers Notes by G.J.O. Jameson Introduction Recall that Fermat s little theorem says that if p is prime and a is not a multiple of p, then a p 1 1 mod p. This theorem gives a possible

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### Egyptian fraction representations of 1 with odd denominators

Egyptian fraction representations of with odd denominators P. Shiu Department of Mathematical Sciences Loughborough University Leicestershire LE 3TU United Kingdon Email: P.Shiu@lboro.ac.uk Abstract The

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

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

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### On k-free Sequences of Integers

mathematics of computation, volume 26, number 119, july, 1972 On k-free Sequences of Integers By Samuel S. Wagstaff, Jr. Abstract. Let A

### THE 2-ADIC, BINARY AND DECIMAL PERIODS OF 1/3 k APPROACH FULL COMPLEXITY FOR INCREASING k

#A28 INTEGERS 12 (2012) THE 2-ADIC BINARY AND DECIMAL PERIODS OF 1/ k APPROACH FULL COMPLEXITY FOR INCREASING k Josefina López Villa Aecia Sud Cinti Chuquisaca Bolivia josefinapedro@hotmailcom Peter Stoll

### International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,

### LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO

LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Solving a family of quartic Thue inequalities using continued fractions

Solving a family of quartic Thue inequalities using continued fractions Andrej Dujella, Bernadin Ibrahimpašić and Borka Jadrijević Abstract In this paper we find all primitive solutions of the Thue inequality

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### The minimum number of monochromatic 4-term progressions

The minimum number of monochromatic 4-term progressions Rutgers University May 28, 2009 Monochromatic 3-term progressions Monochromatic 4-term progressions 1 Introduction Monochromatic 3-term progressions

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### FACTORING. n = 2 25 + 1. fall in the arithmetic sequence

FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously. As some sort of backward evidence that factoring is hard,

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Recent progress in additive prime number theory

Recent progress in additive prime number theory University of California, Los Angeles Mahler Lecture Series Additive prime number theory Additive prime number theory is the study of additive patterns in

### The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### On the number of prime factors of an odd perfect number

On the number of prime factors of an odd perfect number Pascal Ochem CNRS, LIRMM, Université Montpellier 2 161 rue Ada, 34095 Montpellier Cedex 5, France ochem@lirmm.fr Michaël Rao CNRS, LIP, ENS Lyon

### Double Sequences and Double Series

Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### PYTHAGOREAN NUMBERS. Bowling Green State University, Bowling Green, OH (Submitted February 1988)

S u p r i y a Mohanty a n d S. P. Mohanty Bowling Green State University, Bowling Green, OH 43403-0221 (Submitted February 1988) Let M be a right angled triangle with legs x and y and hypotenuse z. Then

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### 15 Prime and Composite Numbers

15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

### Sets and Counting. Let A and B be two sets. It is easy to see (from the diagram above) that A B = A + B A B

Sets and Counting Let us remind that the integer part of a number is the greatest integer that is less or equal to. It is denoted by []. Eample [3.1] = 3, [.76] = but [ 3.1] = 4 and [.76] = 6 A B Let A