# Counting Primes whose Sum of Digits is Prime

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Journal of Integer Sequences, Vol. 5 (202), Article Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey TW20 0EX United Kingdom Astract Motivated y recent work of Drmota, Mauduit and Rivat, we discuss the possiility of counting the numer of primes up to x whose sum of digits is also prime. We show that, although this is not possile unless we assume a hypothesis on the distriution of primes stronger than what is implied y the Riemann hypothesis, we can estalish a Mertens-type result. That is, we otain a formula for the numer of such primes p up to x weighted with a factor /p. Indeed, we can iterate the method and count primes with the sum of digits a prime whose sum of digits is a prime, and so on. Introduction Thanks to the revolutionary work of Mauduit and Rivat [7], in particular as developed in [2], our knowledge of the distriution of primes with constraints on their sum of digits has undergone a sustantial expansion in recent years. The question of counting the numer of primes up to x, whose sum of digits in ase is also prime, would have een considered far too difficult ten years ago in view of the difficulty in restricting the sum of digits function when its variale is prime. In this paper we discuss this question, showing that it is still impossily difficult at present, ut this is now a result of our lack of knowledge concerning the distriution of primes in short intervals, and no longer caused y the prolems of restricting the sum of digits function. However, we are ale to prove a Mertens-type result on counting

2 primes whose sum of digits is prime. Throughout this paper the letters p and q are reserved for prime variales. In 874 Mertens proved that p = log log X + A + O((log x) ), for a certain constant A (see [, p. 56]). In this paper we will otain analogues of this result for primes whose sum of digits written in ase ( 2) are also prime. For revity we shall write this set as P. If r r n = a k k, 0 a k, then we put σ (n) = k=0 for the sum of digits function in ase. In fact we shall e ale to iterate our working and estalish Mertens-type theorems for primes elonging to sets defined as follows: P () = P, P (j) = {p P : σ (p) P (j ) }, j = 2, 3... We write log x for the logarithm to ase, log x for the natural logarithm, and define L j (x) inductively y k=0 L (x) = max(, log x), L j (x) = L (L j (x)) for j 2. Our starting point will e a remarkale theorem of Drmota, Mauduit and Rivat [2]. Before stating the result precisely we need the following notation: s = 2 2, µ = 2 ( ), S(k,x) = {p x : σ (p) = k}. As usual we write φ(n) for Euler s totient function, and π(x) for the numer of primes up to x. We recall the prime numer theorem in the form π(x) = x ( ) x log x + O. () (log x) 2 Theorem (Drmota/Mauduit/Rivat). We have, uniformly for all integers k 0 with (k, ) =, S(k,x) = ( π(x) exp ( (k µ ) log x) 2 ( ) ) + O (log x) 2 +ǫ, (2) φ( ) 2πs log x 2s log x where ǫ > 0 is aritrary ut fixed. Since σ (p) p (mod ), for all ut the finitely many primes p satisfying (p, ) > we have (σ (p), ) =, and this leads to the ( )/φ( ) factor appearing frequently. From the aove result we can deduce some very interesting corollaries. Clearly, (2) shows that every sufficiently large integer is the sum of digits of a prime numer. So, in particular, there are infinitely many primes whose sum of digits is also prime. Also, every sufficiently large prime is the sum of digits of another prime which in turn is the sum of digits of another prime, and so on. We use Theorem to otain a Mertens-type result as follows. 2 a k

3 Theorem 2. Let 2 e an integer and X 2. Then we have p P p = φ( ) L 3(X) + O(). (3) In fact we shall use Theorem 2 as the first step in an inductive argument to estalish the following more general result for the sets P (j). Theorem 3. Let,j 2 e integers and X 2. Then we have ( ) j p = L j+2(x) + O(). (4) φ( ) p P (j) As a final application of Theorem we leave the following for the reader to prove. Theorem 4. Write P for the set of primes in P which have a prime numer of digits. Then L 2 (p) = p φ( ) L 3(X) + O(). p P 2 The prolem of the unweighted sum In this section we riefly consider the sum π(x) =. p P First we note the following result of Kátai [5]. Lemma 5. For every positive integer k we have σ (p) µ log x k k x(log x) k/2. p<x Now, even assuming the Riemann hypothesis and the pair correlation conjecture [3] we cannot prove that every interval I y = [y y 2(log y) 3,y+y 2(log y) 3] contains a prime numer. Suppose that I y contains no primes, and choose X so that y = µ log X. Then Theorem cannot supply an asymptotic formula for π (X), and y Lemma 5 with k = 3A π (X) A X XL (X)(L 2 (X)) A for every positive integer A. This shows that no asymptotic formula is possile unless a stronger result than can e otained on the Riemann hypothesis is assumed, for clearly π (X) should e of size X(L (X)L 2 (X)). We state here a hypothetical result to illustrate what we mean. 3

4 Theorem 6. Suppose that there exists a positive function f(x) 0 such that for all large x every interval of the form [x,x + x 2f(x)] contains f(x)x 2( + o())(log x) primes. Then π(x) X φ( ) L (X)L 2 (X). (5) The proof of this result is straightforward. By Lemma 5 we need only count primes whose sum of digits is q with q µ log x < (log x) 2 3. (6) Applying Theorem we need to estimate exp ( (q µ ) log x) 2. 2s log x (6) Breaking the summation range into shorter ranges of the form [y,y + y 2f(y)] and then comparing a sum with an integral we otain + o() ( ) t 2 exp dt = + o() 2s π log log(µ log x) 2s log x log(µ log x) x, which quickly estalishes the result. We remark that the hypothesis of Theorem 6 is almost always true unconditionally in the following sense. The method of Heath-Brown [4] shows that, given ǫ > 0, there exists η > 0 such that for all integers y [Y, 2Y ), with at most Y 3 4 +ǫ exceptions, every suinterval [z,z + z 2 η ] of [y Y 2 +ǫ,y + Y 2 +ǫ ] contains z 2 η ( + O((log z) ))(log z) primes. For these non-exceptional y and with X chosen to satisfy y = µ log X we then have (5). Indeed, we can otain the expected asymptotic formula for X on quite long ranges. We note that we are unale to use the stronger results otainale using a sieve method [6] since we require an asymptotic formula for the numer of primes in an interval rather than upper or lower ounds. 3 Proof of Theorem 2 Lemma 5, together with (2), shows that σ (p) is concentrated near its mean value µ log p, and so enales us to restrict our attention to certain p P with negligile error. We write ( ) M(m) = exp (log )m 7 8, µ(m) = µ m 7 8, ǫ(m) = M(m + ) M(m), δ(m) = (m + ) m 8, M(m) and put M(m) = [M(m), M(m + )). We note for future reference that ( ) ( ( )) ǫ(m) = O m 8 and ǫ(m) = δ(m) log + O m 8. (7) 4

5 Let V e the largest integer with M(V ) < X. Also, write P(m) = {p P : σ (p) = q, q µ(m) < q 2 3 }. We remark that the exponents 7 8, 2 3 aove are chosen as convenient fixed numers etween 2 and (which must satisfy certain inequalities to enale certain sums to converge later) and have no other special significance. From Lemma 5 we can deduce that converges. Hence Now write Q = log X. Then S(X) := p P S(X) = q<q m= p M(m) p P,p/ P(m) p = m V m V q µ(m) <q 2 3 M(m) M(m) p p M(m) p P(m) p M(m) σ (p)=q + O(). + O(). After applications of Theorem with ǫ = /4 and using () this ecomes ( ) ) ǫ(m) (q µ(m))2 exp ( + O(m 4 ). (8) φ( ) q<q m V (log )m 7 8 2πs m 7 2s 8 m 7 8 q µ(m) <q 2 3 Now the O(m 4) term in the aove leads to an error (using m = (q/µ ) O(q 8 7 3)) q<q q q 7 q q 2 q 2 7 = O(), and so we can concentrate on the main term in (8). By (7) we can replace ǫ(m) with δ(m) log and only incur an error which is O(m 8) times the main term. We can ignore this error as it will prove to e negligile. By using m 7 8 = q/µ + O(q 2 3) we can reduce the sum to (µ /q) 3 2 Σq + O(), φ( ) 2πs with Σ q = m V q µ(m) <q 2 3 q<q δ(m) exp ( µ ) (q µ(m)) 2. 2s q 5

6 We can identify this as a Riemann sum of an integral and so otain We have thus shown that as required to complete the proof. q/µ +q 2 3 Σ q = exp ( µ ) (q µ x) 2 dx + O() q/µ q 2 3 2s q 2s qπ = + O(). µ 3 2 S(X) = φ( ) q + O() = φ( ) L 3(X) + O() (9) q<q 4 Proof of Theorem 3 We prove Theorem 3 y induction; Theorem 2 is the case j =. Now assume that the case j has een proved. If we follow the working in 3, then in place of (9) we otain p P (j+) p = φ( ) p<y p P (j) p + O() where Y = log X. By the inductive hypothesis we therefore have p P (j+) as required to complete the proof. ( ) j+ p = L j+3(x) + O() φ( ) 5 Acknowledgement I would like to thank the referee for his suggestions and Christian Elsholtz whose conversation sparked my interest in this topic. References [] H. Davenport, Multiplicative Numer Theory, 2nd edition, revised y H. L. Montgomery, Springer, 980. [2] M. Drmota, C. Mauduit and J. Rivat, Primes with an average sum of digits, Compositio Math. 45 (2009),

7 [3] D. Goldston and D. R. Heath-Brown, A note on the difference etween consecutive primes, Math. Ann. 266 (984), [4] D. R. Heath-Brown, The differences etween consecutive primes, III, J. London Math. Soc. (2), 20, [5] I. Kátai, On the sum of digits of primes, Acta Math. Acad. Sci. Hungar. 30 (977), [6] K. Matomäki, Large differences etween consecutive primes, Quart. J. Math. 58 (2007), [7] C. Mauduit and J. Rivat, Sur un prolème de Gelfond: la somme des chiffres des nomres premiers, Ann. of Math. 7 (200), Mathematics Suject Classification: Primary A63; Secondary N05, N60. Keywords: prime numer, sum of digits, Mertens theorem. (Concerned with sequences A046704, A070027, and A0998.) Received Septemer 6 20; revised version received Decemer Pulished in Journal of Integer Sequences, Decemer Return to Journal of Integer Sequences home page. 7

### 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

### 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

### 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 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

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### 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,

### 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

### Digital properties of prime numbers

PROCEEDINGS OF THE ROMAN NUMBER THEORY ASSOCIATION Volume 1, Number 1, March 2016, pages 59 66 Joël Rivat Digital properties of prime numbers written by Claudio Stirpe 1 Introduction This exposition deals

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### 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

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### 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

### 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

### Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### 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,

### 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

### 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,

### 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

### Project: The Harmonic Series, the Integral Test

. Let s start with the sequence a n = n. Does this sequence converge or diverge? Explain. To determine if a sequence converges, we just take a limit: lim n n sequence converges to 0. = 0. The. Now consider

### Note on some explicit formulae for twin prime counting function

Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:

### The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit

The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),

### More Mathematical Induction. October 27, 2016

More Mathematical Induction October 7, 016 In these slides... Review of ordinary induction. Remark about exponential and polynomial growth. Example a second proof that P(A) = A. Strong induction. Least

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by 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

### 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

### Dynamic TCP Acknowledgement: Penalizing Long Delays

Dynamic TCP Acknowledgement: Penalizing Long Delays Karousatou Christina Network Algorithms June 8, 2010 Karousatou Christina (Network Algorithms) Dynamic TCP Acknowledgement June 8, 2010 1 / 63 Layout

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

### MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

### Arrangements of Stars on the American Flag

Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract. In this article, we examine the existence of nice arrangements of stars on the American flag. We show that

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### 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

### 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

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### 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

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### Concentration of points on two and three dimensional modular hyperbolas and applications

Concentration of points on two and three dimensional modular hyperbolas and applications J. Cilleruelo Instituto de Ciencias Matemáticas (CSIC-UAM-UC3M-UCM) and Departamento de Matemáticas Universidad

### MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

### The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### 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,

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

### 10.2 Series and Convergence

10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

### Some practice problems for midterm 2

Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

### Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

### RAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER

Volume 9 (008), Issue 3, Article 89, pp. RAMANUJAN S HARMONIC NUMBER EXPANSION INTO NEGATIVE POWERS OF A TRIANGULAR NUMBER MARK B. VILLARINO DEPTO. DE MATEMÁTICA, UNIVERSIDAD DE COSTA RICA, 060 SAN JOSÉ,

### 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

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### UNIFORM BOUNDS FOR THE LEAST ALMOST-PRIME PRIMITIVE ROOT

UNIFORM BOUNDS FOR THE LEAST ALMOST-PRIME PRIMITIVE ROOT GREG MARTIN 1. Introduction A recurring theme in number theory is that multiplicative and additive properties of integers are more or less independent

### Erdos and the Twin Prime Conjecture: Elementary Approaches to Characterizing the Differences of Primes

Erdos and the Twin Prime Conjecture: Elementary Approaches to Characterizing the Differences of Primes Jerry Li June, 010 Contents 1 Introduction Proof of Formula 1 3.1 Proof..................................

### 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

### Mean value theorems for long Dirichlet polynomials and tails of Dirichlet series

ACA ARIHMEICA LXXXIV.2 998 Mean value theorems for long Dirichlet polynomials and tails of Dirichlet series by D. A. Goldston San Jose, Calif. and S. M. Gonek Rochester, N.Y. We obtain formulas for computing

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

### A. Break even analysis

Lecture (50 minutes) Eighth week lessons Function (continued) & Quadratic Equations (Divided into 3 lectures of 50 minutes each) a) Break even analysis ) Supply, Demand and market equilirium. c) Class

### 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,

### Quantum dilogarithm. z n n 2 as q 1. n=1

Quantum dilogarithm Wadim Zudilin (Moscow & Bonn) 14 March 2006 Abstract The q-exponential function e q (z) 1/ (1 zqn ), defined for q < 1 and z < 1, satisfies the remarkable quantum pentagonal identity

### FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this

### 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.

### SOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS

Real Analysis Exchange Vol. 28(2), 2002/2003, pp. 43 59 Ruchi Das, Department of Mathematics, Faculty of Science, The M.S. University Of Baroda, Vadodara - 390002, India. email: ruchid99@yahoo.com Nikolaos

### Powers of Two in Generalized Fibonacci Sequences

Revista Colombiana de Matemáticas Volumen 462012)1, páginas 67-79 Powers of Two in Generalized Fibonacci Sequences Potencias de dos en sucesiones generalizadas de Fibonacci Jhon J. Bravo 1,a,B, Florian

### Notes on the second moment method, Erdős multiplication tables

Notes on the second moment method, Erdős multiplication tables January 25, 20 Erdős multiplication table theorem Suppose we form the N N multiplication table, containing all the N 2 products ab, where

### PRIME FACTORS OF CONSECUTIVE INTEGERS

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 FIRST MAYR-MEYER IDEAL

THE FIRST MAYR-MEYER IDEAL IRENA SWANSON New Mexico State University - Department of Mathematical Sciences, Las Cruces, New Mexico 88003-8001, USA E-mail: iswanson@nmsueu Summary This paper gives a complete

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Proof of Euler s φ (Phi) Function Formula

Rose- Hulman Undergraduate Mathematics Journal Proof of Euler s φ (Phi Function Formula Shashank Chorge a Juan Vargas b Volume 14, no. 2, Fall 2013 Sponsored by Rose-Hulman Institute of Technology Department

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### 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

### 61. REARRANGEMENTS 119

61. REARRANGEMENTS 119 61. Rearrangements Here the difference between conditionally and absolutely convergent series is further refined through the concept of rearrangement. Definition 15. (Rearrangement)

### Arrangements of Stars on the American Flag

Arrangements of Stars on the American Flag Dimitris Koukoulopoulos and Johann Thiel Abstract In this article, we examine the existence of nice arrangements of stars on the American flag. We show that despite

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### 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

### ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME

ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Mathematical Induction

Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

### ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

### 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.

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

### 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

### 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

### CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction

Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves

### Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

### Fourier Series. Chapter Some Properties of Functions Goal Preliminary Remarks

Chapter 3 Fourier Series 3.1 Some Properties of Functions 3.1.1 Goal We review some results about functions which play an important role in the development of the theory of Fourier series. These results

### Cylinder Maps and the Schwarzian

Cylinder Maps and the Schwarzian John Milnor Stony Brook University (www.math.sunysb.edu) Bremen June 16, 2008 Cylinder Maps 1 work with Araceli Bonifant Let C denote the cylinder (R/Z) I. (.5, 1) fixed

### STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS. 1. Introduction. The prime numbers 2, 3, 5, 7,... are one of the oldest topics studied in mathematics.

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.. Introduction The prime numbers 2, 3, 5, 7,... are one of the oldest

### Elementary Number Theory

Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,

### Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

### I. Pointwise convergence

MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.

### A Binary Recursive Gcd Algorithm

A Binary Recursive Gcd Algorithm Damien Stehlé and Paul Zimmermann LORIA/INRIA Lorraine, 615 rue du jardin otanique, BP 101, F-5460 Villers-lès-Nancy, France, {stehle,zimmerma}@loria.fr Astract. The inary