Asymptotic Formulae for the n-th Perfect Power

Similar documents
Two Topics in Number Theory: Sum of Divisors of the Factorial and a Formula for Primes

Logarithm of the Kernel Function. 1 Introduction and Preliminary Results

Gaps between Consecutive Perfect Powers

New Results for the Fibonacci Sequence Using Binet s Formula

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

Sequences of Definite Integrals, Factorials and Double Factorials

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

MDIV. Multiple divisor functions

The 4-Nicol Numbers Having Five Different Prime Divisors

Dr. Clemens Kroll. Abstract

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

Harmonic Number Identities Via Euler s Transform

Interesting Series Associated with Central Binomial Coefficients, Catalan Numbers and Harmonic Numbers

Bertrand s Postulate

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

A Note on the Symmetric Powers of the Standard Representation of S n

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

2.4.2 A Theorem About Absolutely Convergent Series

Linear recurrence sequences and periodicity of multidimensional continued fractions

Math 104: Homework 2 solutions

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients

The log-behavior of n p(n) and n p(n)/n

On Certain Sums Extended over Prime Factors

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

ON POINTWISE BINOMIAL APPROXIMATION

Different kinds of Mathematical Induction

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

Assignment 5: Solutions

Roger Apéry's proof that zeta(3) is irrational

Zeros of Polynomials

Asymptotic distribution of products of sums of independent random variables

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

The Positivity of a Sequence of Numbers and the Riemann Hypothesis

The Riemann Zeta Function

CALCULATION OF FIBONACCI VECTORS

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

On a Conjecture of Dris Regarding Odd Perfect Numbers

Dirichlet s Theorem on Arithmetic Progressions

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

On a Smarandache problem concerning the prime gaps

Properties and Tests of Zeros of Polynomial Functions

Lecture 1. January 8, 2018

f(x)g(x) dx is an inner product on D.

Induction: Solutions

Some p-adic congruences for p q -Catalan numbers

On the Inverse of a Certain Matrix Involving Binomial Coefficients

EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv: v6 [math.ho] 13 Feb 2018

Chapter 4. Fourier Series

Complex Numbers Solutions

Equations and Inequalities Involving v p (n!)

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

The natural exponential function

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

A Simplified Binet Formula for k-generalized Fibonacci Numbers

Sequences and Series

Practical solution of the diophantine equation X nr +Y n = q

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Section 5.1 The Basics of Counting

On Divisibility concerning Binomial Coefficients

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

Week 5-6: The Binomial Coefficients

ROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions.

Regent College Maths Department. Further Pure 1. Proof by Induction

Solutions to Math 347 Practice Problems for the final

Optimally Sparse SVMs

Modern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.

Boundaries and the James theorem

The multiplicative structure of finite field and a construction of LRC

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Accepted in Fibonacci Quarterly (2007) Archived in SEQUENCE BALANCING AND COBALANCING NUMBERS

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

n n 2 n n + 1 +

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

SOME TRIGONOMETRIC IDENTITIES RELATED TO POWERS OF COSINE AND SINE FUNCTIONS

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

ON THE EXTENDED AND ALLAN SPECTRA AND TOPOLOGICAL RADII. Hugo Arizmendi-Peimbert, Angel Carrillo-Hoyo, and Jairo Roa-Fajardo

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

Math 61CM - Solutions to homework 3

Largest families without an r-fork

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE (1 + 1/n) n

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

DANIELL AND RIEMANN INTEGRABILITY

Expected Norms of Zero-One Polynomials

MATH 304: MIDTERM EXAM SOLUTIONS

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

The Random Walk For Dummies

Homework 2. Show that if h is a bounded sesquilinear form on the Hilbert spaces X and Y, then h has the representation

Transcription:

3 47 6 3 Joural of Iteger Sequeces, Vol. 5 0, Article.5.5 Asymptotic Formulae for the -th Perfect Power Rafael Jakimczuk Divisió Matemática Uiversidad Nacioal de Lujá Bueos Aires Argetia jakimczu@mail.ulu.edu.ar I memory of my sister Fedra Maria Jakimczuk 970 00 Abstract Let P be the -th perfect power. I this article we prove asymptotic formulae for P. For example, we prove the followig formula P = 5/3 7/5 + 3 3 4/3 9/7 + 6/5 3/ + o 3/. Itroductio A atural umber of the form m where m is a positive iteger ad is called a perfect power. The first few terms of the iteger sequece of perfect powers are, 4, 8, 9, 6, 5, 7, 3, 36, 49, 64, 8, 00,, 5, 8... ad they form sequece A00597 i Sloae s Ecyclopedia. Let P be the -th perfect power. That is, P =,P = 4,P 3 = 8,P 4 = 9,... I this article we prove asymptotic formulae for P. For example, P = 5/3 7/5 + 3 3 4/3 9/7 + 6/5 3/ + o 3/. This formula is a corollary of our mai theorem Theorem 6, which ca give as may terms i the expasio as desired.

There exist various theorems ad cojectures o the sequece P. For example, the followig theorem: = µk ζk = 0, 87446... P = k= where µk is the Möbius fuctio ad ζk is the Riema zeta fuctio. We also have the followig theorem called the Goldbach-Euler theorem: P =. = This result was first published by Euler i 737. Euler attributed the result to a letter ow lost from Goldbach. Mihăilescu [4, 5, 6] proved that the oly pair of cosecutive perfect powers is 8 ad 9, thus provig Catala s cojecture. The Pillai s cojecture establish the followig limit lim P + P =. This is a usolved problem. There exist algorithms for detectig perfect powers [, ]. Let Nx be the umber of perfect powers ot exceedig x. M. A. Nyblom [7] proved the followig asymptotic formula Nx x. M. A. Nyblom [8] also obtaied a formula for the exact value of Nx usig the iclusioexclusio priciple. Let be the h-th prime. Cosequetly we have, p =,p = 3,p 3 = 5,p 4 = 7,p 5 =,p 6 = 3,... Jakimczuk [3] proved the followig theorem where more precise formulae for Nx are established. This theorem will be used later. Theorem. Let be the h-th prime with h, where h is a arbitrary but fixed positive iteger. The h Nx = k+ k= i < <i k h p i p ik < p x i p ik + + ox /, where the ier sum is take over the k-elemet subsets {i,...,i k } of the set {,,...,h } such that the iequality p i p ik < holds. If h = 5 the Theorem becomes, Nx = x + 3 x + 5 x 6 x + 7 x 0 x + + o x. Note that equatio iclude the cases h =, 3, 4. I geeral, equatio for a certai value of h = k iclude the cases h =, 3,...,k. This fact is a direct cosequece of equatio.

Some Lemmas The followig lemma is a immediate cosequece of the biomial theorem. Lemma. We have + x α = + α + ox x 0, + x α = + αx + Ox x 0, + x α αα = + αx + x + Ox 3 x 0. Lemma 3. Let P be the -th perfect power. We have P. Proof. Equatio gives Nx x. Cosequetly NP = P. Therefore P. Lemma 4. Let be the h-th prime. If h 3 the we have Proof. We have 3 <. 3 < < 3 < 6. Clearly, the last iequality is true if h 5 sice 7. O the other had, we have p p 3 = 3 5 = 5 < 6 p 3 p 4 = 5 7 = 35 < 6 3 The Fudametal Lemma The followig lemma is a characterizatio of asymptotic formulae for P. The lemma prove the existece of asymptotic formulae for P. Lemma 5. Let h 3 be the h-th prime. We have m P = 5/3 + d i g i + + o +, 3 where > 5/3 > g > > g m > +, the d i are ratioal coefficiets ad i equatio 3 appear the terms + p i i =,...,h. Besides the ratioal expoets 5/3 ad g i i =,...,m are of the form b i c i where b i ad c i are relatively prime ad the c i are squarefree itegers with prime divisors bouded by. 3

Proof. We shall use mathematical iductio. First, we shall prove that the lemma is true for h = 3. If h = the Theorem becomes see Nx = x + + o 3 x. Substitutig x = P ito this equatio ad usig Lemma 3 we obtai NP = = P + + o 3 P = P + + o /3. That is P = + + o /3. Therefore P = + + o /3 If h = 3 the Theorem becomes see = + + o 5/3 + + o 4/3 = + + o 5/3. 4 Nx = x + 3 x + + o 5 x. Substitutig x = P ito this equatio ad usig equatio 4, Lemma 3 ad Lemma we obtai NP = = P / + P /3 + + o /5 = P / + + + o 5/3 /3 + + o /5 = P / + /3 + + o /3 /3 + + o /5 = P / + /3 + /3 + o /3 + + o /5 = P / + /3 + + o /5. That is Therefore P / = /3 + + o /5. That is P = /3 + + o /5 = 5/3 + + o 7/5. P = 5/3 + + o 7/5. 5 Equatio 5 is Lemma 5 for h = 3. Cosequetly the lemma is true for h = 3. Suppose that the lemma is true for h 3. We shall prove that the lemma is also true for h 4. 4

We have see Nx = + h k+ k= i < <i k h p i p ik < h h x /p i + k+ i= k= p x i p ik + + ox / = x / i < <i k h p i p ik < x p i p ik + + ox / h 4. 6 Substitutig x = P ito 6 ad usig Lemma 3 we obtai h h = P / + P /p i + k+ i= By iductive hypothesis we have k= i < <i k h p i p ik < P p i p ik + + o / h 4. 7 P = 5/3 + a i r i + + o + h 4, 8 where > 5/3 > r > > r s > +, the a i are ratioal coefficiets ad i equatio 8 appear the terms + p i i =,...,h. Besides the ratioal expoets 5/3 ad r i i =,...,s are of the form l i f i where l i ad f i are relatively prime ad the f i are squarefree itegers with prime divisors bouded by. Equatio 8 gives P = /3 + a i +r i + + o +, 9 where Cosequetly /3 + a i +r i + + o + /3. /3 + a i +r i + + o + = O /3 = o. 0 5

Let t 3 be a positive iteger. Equatios 9, 0 ad Lemma give P /t = /t /3 + = /t + t /3 + a i +r i + + o + /t a i +r i + + o + + O /3 = /t t 3 + t + t a i +r i+ + + p + o + h t + O 3 + t t Note that if t 3 the see Lemma 4 t. ad if t 3 the t + p + o + h t = o h /p, O 3 + t = o h /p. 3 Cosequetly becomes see ad 3 P /t = /t t 3 + t + t a i +r i+ t + o /. 4 Note that see 4 if t 3 the expoet < ad cosequetly also + < ad t 3 t + r i + < sice + r t i < 0 see 8 Substitutig 4 ito 7 we fid that h = P / + + j= i < <i k h p i p ik < /p j p j 3 + p j + p i p ik a i +r i+ p i p ik = P / + p i p ik a i +r h i+ p j + k+ p j 3 + p i p ik p i p ik + + o / l b i s i + + o / h 4, 5 where > s > > s l >. That is k= P / = l b i s i + + o /. 6 6

Note that all positive expoets i equatio 5, that is, the positive expoets of the form p j, 3 + p j, + r i + p j, p i p ik 3 +, + r i + p i p ik p i p ik are see 8 of the form m i i where m i ad i are relatively prime ad the i are squarefree itegers with prime divisors bouded by. Therefore these expoets are differet from ad cosequetly the expoets s i i =,...,l i 6 are of this same form. Note that + >, sice <. Cosequetly equatio 6 gives P = l b i s i + + o h /p = + + o + = 5/3 + l b i s i q a i r i + + c i k i + + o + h 4, 7 where > 5/3 > r > > r s > + > k > > k q > +. Note also that the first terms i equatio 7 are the terms of equatio 8. O the other had i equatio 7 appear the term + see equatio 8. We ow prove these facts. Equatio 7 ca be writte i the form P = Q + q c i k i + + o + = Q + o +, 8 where Q is a sum of terms of the form e i q i q i +. O the other had, equatio 8 ca be writte i the form P = 5/3 + a i r i + + o +. 9 Equatios 8 ad 9 give 0 = P P = Q 5/3 + a i r i + + o +. If Q 5/3 + a i r i + 7

the we obtai 0 = P P a q a 0 q +. That is, a evidet cotradictio. Cosequetly Q = 5/3 + a i r i +. 0 Fially, equatios 8 ad 0 give 7. Lemma 5 is costructive, we ca build the ext formula usig the former formula. Next, we build the formula that correspod to h = 4. We shall eed this formula. If h = 4 equatio 6 is see Nx = x / + x /3 + x /5 x /6 + + ox /7. O the other had Lemma 5 equatio 8 is see 5 Cosequetly equatio 5 is = P / + /3 3 3 + 3 Therefore + + o /7 = P / P = 5/3 + + o 7/5. = P / + /3 + /5 5 3 /3 + + o /7. Cosequetly see 7 + /5 5 3 + 5 /6 6 3 + 6 + /3 3 /3 + /5 5 /5 /3 + + + o/7 3 P / = /3 /5 + 5 3 /3 + + o /7. P = /3 /5 + 5 3 /3 + + o 9/7 That is = 5/3 7/5 + 3 3 8/6 + + o 9/7. P = 5/3 7/5 + 3 3 8/6 + + o 9/7. 8

4 Mai Result The followig theorem is the mai result of this article. I this theorem we obtai explicit formulae for P. Theorem 6. Let be the h-th prime with h 3, where h is a arbitrary but fixed positive iteger. Let us cosider the formula see We have h Nx = k+ k= i < <i k h p i p ik < P = + 3 3 8/6 + 3 h 5 3/30 + k k= p x i p ik + + ox /. 3 i < <i k h p i p ik <, p i p ik, 6, 30 + p i p ik + + o +. 4 Proof. We shall see that everythig relies o Theorem. The theorem is true for h = 3 see Lemma 5 ad for h = 4 see ad. Suppose h 5, that is. Equatio 3 ca be writte i the form see Nx = x / + x /3 + x /5 x /6 + +a i x / i + + ox /, 5 where a i is the umber of differet prime factors i i ad the expoets are i decreasig order, > 3 > 5 > 6 > > > s >. 6 For example, if h = 5 the equatio 5 becomes equatio. O the other had, we have Lemma 5 ad equatio P = 5/3 7/5 + 3 3 8/6 + where the expoets are i decreasig order, d i r i + + o +, 7 > 5 3 > 7 5 > 8 6 > r > > r t > +. 8 Equatio 7 gives P = /3 3/5 + 3 3 4/6 + 9 d i r i + + o + 9

where /3 3/5 + 3 3 4/6 + d i r i + + o + /3, sice see 8 3 > 3 5 > 4 6 > r > > r t > +. 30 Cosequetly Besides A = /3 3/5 + 3 3 4/6 + B = = d i r i + + o + = O /3 = o. 3 /3 3/5 + 3 3 4/6 + 3 /3 3/5 + 3 + o 4/6 d i r i + + o + = 4 /3 + 8 4/5 + O. 3 Substitutig x = P ito equatio 5 ad usig Lemma 3 we obtai = P / + P /3 + P /5 P /6 + Equatios 9, 3, 3 ad Lemma give P / = + A + = /3 /5 + 3 6 /6 + Equatios 9, 3, 30 ad Lemma give +a i P / i + / + o /. 33 B + O d i r i / + o /p h /6 /30 + O. 34 P /3 = /3 + 3 A + O /3 = /3 3 /6 3 /30 + O. 35 P /5 = /5 + 5 A + O /3 = /5 5 /30 + o. 36 0

P / i = / i P /6 = /6 + 6 A + O /3 = /6 + O. 37 + i A + O /3 = / i + o i =,...,s. 38 Substitutig equatios 34, 35, 36, 37 ad 38 ito equatio 33 we fid that 0 = d i r i + +a i / i 3 5 /30 + o /. 39 Note that see 8 ad 6 r i > ad i >. If 9 the 3 5 /30 = o /. Cosequetly we have d i r i = a i / i, where t = s, d i = a i i =,...,s ad r i = + i i =,...,s. Sice i cotrary case we have 0 a b where a 0 ad b >, a evidet cotradictio. Substitutig these values ito 7 we obtai 4 see 5. If 3 the > 30 ad there exists k such that k = 30 =.3.5 see 3. Cosequetly we have d i r i = a i / i + 3 5 /30, where t = s, d i = a i i k, d k = + 3 = 3 ad r 5 5 i = + i i =,...,s. Sice i cotrary case we have 0 a b where a 0 ad b >, a evidet cotradictio. Substitutig these values ito 7 we obtai 4 see 5. Example 7. If h = 5 equatio 3 is see Nx = x / + x /3 + x /5 x /6 + x /7 x /0 + + ox /. Cosequetly Theorem 6 gives P = 5/3 7/5 + 3 3 4/3 9/7 + 6/5 + + o 3/ 5 Ackowledgemets The author would like to thak the aoymous referee for his/her valuable commets ad suggestios for improvig the origial versio of this article. The author is also very grateful to Uiversidad Nacioal de Lujá.

Refereces [] E. Bach ad J. Soreso, Sieve algorithms for perfect power testig, Algorithmica 9 993, 33 38. [] D. Berstei, Detectig perfect powers i essetially liear time, Math. Comp. 67 998, 53 83. [3] R. Jakimczuk, O the distributio of perfect powers, J. Iteger Seq. 4 0, Article.8.5. [4] P. Mihăilescu, A class umber free criterio for Catala s cojecture, J. Number Theory 99 003, 5 3. [5] P. Mihăilescu, Primary cyclotomic uits ad a proof of Catala s cojecture, J. Reie Agew. Math 57 004, 67 95. [6] P. Mihăilescu, O the class groups of cyclotomic extesios i presece of a solutio to Catala s equatio, J. Number Theory 8 006, 3 44. [7] M. A. Nyblom, A coutig fuctio for the sequece of perfect powers, Austral. Math. Soc. Gaz. 33 006, 338 343. [8] M. A. Nyblom, Coutig the perfect powers, Math. Spectrum 4 008, 7 3. 000 Mathematics Subject Classificatio: Primary A99; Secodary B99. Keywords: -th perfect power, asymptotic formula. Cocered with sequece A00597. Received October 0; revised versios received Jauary 4 0; March 0 0; May 9 0. Published i Joural of Iteger Sequeces, May 9 0. Retur to Joural of Iteger Sequeces home page.