Improvements on Waring s Problem

Similar documents
Improvements on Waring s Problem

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials.

Chapter 11. Supplemental Text Material. The method of steepest ascent can be derived as follows. Suppose that we have fit a firstorder

a new crytoytem baed on the dea of Shmuley and roved t rovably ecure baed on ntractablty of factorng [Mc88] After that n 999 El Bham, Dan Boneh and Om

Design of Recursive Digital Filters IIR

Small signal analysis

Two Approaches to Proving. Goldbach s Conjecture

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters

Harmonic oscillator approximation

Introduction to Interfacial Segregation. Xiaozhe Zhang 10/02/2015

Some congruences related to harmonic numbers and the terms of the second order sequences

An improved lower-bound on the counterfeit coins problem

The 7 th Balkan Conference on Operational Research BACOR 05 Constanta, May 2005, Romania

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

Algorithms for factoring

Statistical Properties of the OLS Coefficient Estimators. 1. Introduction

Iterative Methods for Searching Optimal Classifier Combination Function

Foundations of Arithmetic

Pythagorean triples. Leen Noordzij.

Introduction. Modeling Data. Approach. Quality of Fit. Likelihood. Probabilistic Approach

Team. Outline. Statistics and Art: Sampling, Response Error, Mixed Models, Missing Data, and Inference

Additional File 1 - Detailed explanation of the expression level CPD

SMARANDACHE-GALOIS FIELDS

Problem #1. Known: All required parameters. Schematic: Find: Depth of freezing as function of time. Strategy:

2.3 Nilpotent endomorphisms

Chapter 8: Fast Convolution. Keshab K. Parhi

7. Algorithms for Massive Data Problems

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Randić Energy and Randić Estrada Index of a Graph

Chapter 5: Root Locus

and decompose in cycles of length two

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration

Root Locus Techniques

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

Math 217 Fall 2013 Homework 2 Solutions

EEE 241: Linear Systems

Section 3.6 Complex Zeros

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Some Results on the Counterfeit Coins Problem. Li An-Ping. Beijing , P.R.China Abstract

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

AP Statistics Ch 3 Examining Relationships

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

arxiv: v1 [math.co] 12 Sep 2014

Ballot Paths Avoiding Depth Zero Patterns

On the singular series in the Jiang prime k-tuple theorem

Recover plaintext attack to block ciphers

y i x P vap 10 A T SOLUTION TO HOMEWORK #7 #Problem

Y. Guo. A. Liu, T. Liu, Q. Ma UDC

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction

On the singular series in the Jiang prime k-tuple theorem

Homework Notes Week 7

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Generalized Linear Methods

AGC Introduction

A MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

Start Point and Trajectory Analysis for the Minimal Time System Design Algorithm

1 GSW Iterative Techniques for y = Ax

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

8. INVERSE Z-TRANSFORM

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Zhi-Wei Sun (Nanjing)

Pre-Talbot ANSS. Michael Andrews Department of Mathematics MIT. April 2, 2013

UNIT 7. THE FUNDAMENTAL EQUATIONS OF HYPERSURFACE THEORY

Linear Approximating to Integer Addition

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA

( N) Chun-Xuan Jiang. P. O. Box 3924, Beijing , P. R. China

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

BULLETIN OF MATHEMATICS AND STATISTICS RESEARCH

J. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES

FE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)( ) 8/25/2010

Appendix B. Criterion of Riemann-Stieltjes Integrability

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Société de Calcul Mathématique SA

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Numerical Algorithms for Visual Computing 2008/09 Example Solutions for Assignment 4. Problem 1 (Shift invariance of the Laplace operator)

Weak McCoy Ore Extensions

A Simple Proof of Sylvester s (Determinants) Identity

Estimation of a proportion under a certain two-stage sampling design

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

A Computational Method for Solving Two Point Boundary Value Problems of Order Four

Homework 9 Solutions. 1. (Exercises from the book, 6 th edition, 6.6, 1-3.) Determine the number of distinct orderings of the letters given:

Estimation of Finite Population Total under PPS Sampling in Presence of Extra Auxiliary Information

Scattering of two identical particles in the center-of. of-mass frame. (b)

Lecture 4: Universal Hash Functions/Streaming Cont d

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Errors for Linear Systems

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

On quasiperfect numbers

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

A combinatorial problem associated with nonograms

Lecture Space-Bounded Derandomization

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

8 Waves in Uniform Magnetized Media

Method Of Fundamental Solutions For Modeling Electromagnetic Wave Scattering Problems

Transcription:

Imrovement on Warng Problem L An-Png Bejng 85, PR Chna al@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th aer, we wll gve ome mrovement for Warng roblem Keyword: Warng Problem, Hardy-Lttlewood method, recurve algorthm, auxlary equaton

Introducton Warng roblem now to fnd G ( ), the leat nteger, uch that each uffcent large nteger may be rereented a um of at mot th ower of natural number The Hardy-Lttlewood method, that, o called crcle method man analy method, whch rooed by Hardy Ramanujan and Lttlewood n about 9, whch have been aled uccefully n olvng ome roblem of number theory, eg Warng roblem and Goldbach roblem The nown bet reult for Warng roblem u to now are a followng For uffcently large (Wooley [5] ), G ( ) log( log ) O () And for maller, G(5) 7, G(6) 4, G(7) 33, G(8) 4, () For the detal referred to ee the Vaughan and Wooley urvey aer [4] In th aer, by a new recurve algorthm, we wll gve ome mrovement for G ( ) Theorem For uffcently large, 3 G ( ) log(3/ ) o ( ) (3) 3 Theorem For 5, let F ( ) be a n the Lt, then G ( ) F ( ) (4) F ( ) F ( ) F ( ) F ( ) 5 6 7 33 8 3 9 4 37 49 45 3 57 4 5 5 65 6 64 7 74 8 69 9 85 77 Lt

The Proof of Theorem Suoe that P a uffcent large nteger, C ( P) a ubet of [, P ], a gven nteger, conder the equaton x x y y, x, y C ( P), () Denoted by S ( C ( P)) the number of oluton of (), or mly S ( P ), when the electon C ( P) clear n context The equaton above called auxlary equaton of Warng roblem In the followng, we wll tae ue of teratve method to contruct C ( P) Suoe that a real number, Let P P, P a et of rme number n nterval [ P /, P ], wrte P Z, defne C( P ) x xc ( P), P () Wth reect to the contructon, we wll alo conder followng a relatve equaton x x y yq x x y y, x, y C ( P), where, qp, q Denote by T, (, q) the number of oluton of (3), and T, ( q) T, (, q) (3) Lemma For nteger,, t ha S P Z T q (4) ( ), ( ) Proof A uual, wrte ex ( ) e x, let f( ) e x, f(, ) e x, f( ) e y xc ( P) xc ( P) yc ( P) Then clearly, f ( ) e x f(, ) P xc ( P) P Alyng Hölder nequalty, t ha S ( P ) f( ) d f( ) f( ) d P qp f(, ) f(, q) d

d q q q, P, q ( ) ZS( P) Z f(, f ) (, q) d q, P, q Z f( ) d ( f(, ) f(, q) ) d It clear that Z S ( P ) mnor for S ( P ) Moreover, for a non-negatve nteger, let (,, ) (, ) q f f(, q), then by Cauchy nequalty, t ha f (, ) f(, q) d (,, q) (, q, ) d (, q, ) d (,, ) q d / / And / / f(, ) f(, q) d (,, ) (,, ) q d q d q, P, q q, P, q q, P, q (, q, ) d Clearly, the nner ntegral the number of oluton of equaton (3) Denote by P [ ab, ] the et of rme number n the nterval[ ab, ] Smlar to contruct (), let,, be real number, /,, whch wll be determned later, and let Z P, P P [ Z /, Z], P P / Z, H P/ Z, Recurvely defne C ( P) x xc ( P ), P,(, x),,, Smly wrte C C ( P),,,, In the followng, t wll be ued the notaton of dfference of a functon: A uual, for an nteger coeffcent of olynomal ( x), recurvely defne the forward dfference ( ( x ), t ) ( xt ) ( x ), ( ( x), h, h,, h, h ) ( ( x), h, h,, h), h,, Suoe that t h m, m a contant, then we now that m ( ( x t) ( x)), n th cae we

defne modfed dfference ( ( ), ; ) ( ) ( ) x hm m x hm x ( ( x), h,, h, h ; m,, m, m ) ( ( x), h,, h; m,, m), h ; m Smly wrte, ( x, h,, h;,, ) ( x, h,, h;,, ),,, And defne f ( ) ex ( ), f(, ) ex ( ), P, xc xc,( x, ) g ( ; h,, h;,, ) e( ( x) ), x And () (4) hh hh P P F(, q) g ( q ) F (, q) g ( q ) hh hh P P F (, q) g ( q ) Let hh hh P P ( ) 4 f(, ) f(, q) d ( ) () f ( ) F (, q) d, ( ) f ( ) F(, q) d, 4 (5) (6) (7) Lemma ( ) (4) C f (, ) F (, q) d ( Z ) P Z H S ( P ) P( Z ) P (8) Proof A uual, for a number x, denote by x wth that x x mod Smly wrte ( x) ( x), and For a P, let, P P h h h D(, ) x xc, ( x) mod, ( ) C \ D (, ) Then the um of g ( q ) can be dvded two art, that, normal and ngular art, e one

wth ( x, y) ( ), and the other one not It not dffcult to demontrate that the ntegral n the ngular art econdary, for the mlcty, we ave the nvetgaton, and n the followng acquece n the normal art It clear that for equaton ( x) ( y) n mod there are at mot O( ) oluton wth that ( x, y) ( ), hence we can dvde ( ) nto ( ) O, ayl clae, F ( ) l, uch that n each cla F ( ) the equaton ha at mot two oluton mod And denote by ( x) card y ( x, y) F ( ) It clear that j j j ( x) P Hence, t ha jl ( ) (4) ( ) 4 (, ) (, ) (, ) (, ) C h C ( ) f (, ) e(( ( x) ( y)) q ) d h C jl ( x, y) Fj( ) ( ) l f (, ) e(( ( x) ( y)) q ) d h C jl ( x, y) F j ( ) f F q d f g q d l f (, ) ( x) e( ( ( x), h; ) q ) l h ( ) Fj j C jl h x e( ( ( x), h; ) ( ( y), h ; )) q ) d ( x, y) F j h, h ( ) l f (, ) Fj( ) d h C jl l f (, ) e( ( ( x), h; ) ( ( y), h ; )) q ) d l f (, ) ( ) f (, ) j( x) e( ( ( x), h; )) q ) d h C jl h x ( ) h C jl ( x, y) Fj h, h ( ) lp Z f ( ) d h ( ) C h x ( ) h C h x lp Z Z H S( P ) ( ) jl h C h x P e( ( ( x), h; )) q ) d l f ( ) e( ( ( x), h; ) q ) d P f ( ) e( ( ( x), h; )) q ) d lh h ( ) f (, ) e( ( ( x), h; ) q ) d h C h x

lp Z ZHS( P ) Pl P From the roof above, we can now that, ( ) 4 T ( q) f(, ) f(, q) d Z P ZS( P) Z P ( P) P (9) Bede, / / ( ) ( ) ( ) f( ) F(, q) d f( ) d f( ) F(, q) d S P H Z / / / ( ) ( ) () where H H, Z Z j j j j In general, we have Lemma 3 U V W () U S ( P) Z ( Z H ) ( lp Z Z H S ( P )), / (5)/ / / V S ( P) / (5)/ / / Z ZH Pl ( ) ( ), W S ( P) Z ( Z H ) ( P ) / (5)/ / / Proof / / ( ) () ( ) ( ) () f ( ) (, ) ( ) ( ) ( (, )) F q d f d f F q d ( ) / () S ( P) f (, ) ( F (, q)) d P / 5 ( ) () S( P) Z f (, ) ( F (, q)) d P / ( 5)/ ( ) (4) S( P) Z Z H f (, ) F (, q) d P / (5)/ / S ( P) Z ( Z H ) ( lp Z Z H S( P )) ( Pl ) ( P ) U V W / / / /

Let U V H W H () /4 /, wll be decded later Hence, t ha ( Z ) P Z Z H S ( P) P( Z ) S ( P) ( H Z ) ( H ) ( P ) ( H ) / / / / / /4 / / And t follow / / / / ( Z) P ZZ H ( ) ( ) S P P H /4 P ( H ) That, / / ( Z ) ZZ H S ( P) P( H) (3) On the other hand, U V W U ( H ) / S ( P) Z ( Z H ) ( lp Z Z H S ( P )) ( H ) / (5)/ / / / Combne the two equalte, ( Z ) Z Z H S ( P) P( H ) S ( P) Z ( Z H ) ( lp Z Z H S ( P )) ( H ) It follow / (5)/ / / / / (4)/ / / ( ) ( ) ( ) ( ) ( ) ( H ) S P Z H l H / S ( P ) Z e S ( P) Z ( H ) ( Z ) ( H ) (5) S P Z H (4) ( ) ( ) ( ) (4) Let ( ) S X X, (5) become P ( P/ Z ) ( P/ Z ) ( Z ) P (4) Z ( Z) e ( ) Z Z P Z Z And ( 4) ( ) (4 ) (4) ( ) (4 ) Denote by a (4) ( ), b, t ha (4 )

j j a a j b a, and a ab a Bede, by (), t ha / / / ( Z ) P Z Z H S ( P ) P ( H ) It eay to now that Z HPS ( ) P, o t ha ( Z ) P Z Z H S ( P ) PZ H P S ( P )( H ) And ( ) / H H Defne (), there a ( ) ( ) ab a a ( ) ( ) ( ) ( ) Eecally, ( ) ( ) a ( ) ( ) ( ) ( ) On the other hand, by Lemma wth, t ha S ( P ) Z ( P) Z U H Z Z P ZS ( P) H and / / / ( / ) ( ) ( ) Or, (6) ( ) () ( /) (7) ( ) ( ) When greater, t may ha ( ) (8) ( ) ( ) And let ( ) ( ), (9) 3 Subttutng (8) and (9) n (7), t follow 3 () ( ) ( ( ) ) ( ( ) ) And then

3 3 () ( ) ( ( ) ) 3 ( ( ) ) o 3 ( d ) ( d) 3 ( ( ) ) 3 () d, or, or other It nown that,, e (), () Hence, 3 ( ),, or 3 ( ( ) ) 3 Let 3 ( ) log log 3 ( ) ( ( ) ) () From (), we can now that ( ) wll aroach zero a tend to ( ) Hence t ha Lemma 4 For uffcent large, and arbtrary mall, there ( ( ) ) uch that () We now (ee [3], or []), ( u) G ( ) 3u ˆ where log( / ) log log ˆ, log log log O 4( ) log Tae u ( ( ) ), and let /3, (/ 3) (8log(3/ ) / 3 o()), when great And note that3log(3/ ) / 3 435 4, o the cae that a ower of alo hold, and Theorem roved 3 The roof of Theorem For the maller, there are two way to obtan and (), the frt one that through the recuron (6) and (7) from the ntal d, d,, or any nown better d by choong otmal value n turn The econd one that, by (7) and (9), t follow

( ) 3 ( ) ( ) ( d) ( d) (3) 3 ( ) ( ( ) ) 3 ( ) where wth tae d, or, or other nown better reult, and then choong otmally Wth the two way, by comuter we have obtaned followng reult a n Lt 3 I/II d / () 5 I 93 6 I 8436 7 6 I 8693 4 8 4 I 9447 9 9 I 96 8 I 93834 5 4 I 93394 3 I 93579 3 8 I 95 5 4 5 II 35734 5 5 3 II 473 6 3 I 93558 7 36 I 97484 5 8 34 I 9488 9 4 I 94594 38 I 9487 Lt 3 Where mar I or II ndcate calculaton by the way I or II For, let ( ) 4f a ower of, or3 /ele From the nown reult (ee [], [3]), we now that for two otve nteger tv,, f atfyng ) tv ( ), ) v ( t), then Wth Lt 3, we tae v a n the followng lt G ( ) t v (3)

5 6 7 8 9 3 4 5 6 7 8 9 v( ) 4 4 Lt 3 And Theorem roved The reult n Lt 3 wll be better f tae the harer ntal value 3 or 4

Reference AP L, A note on Warng Problem, arxv: 8377 RC Vaughan, The Hardy-Lttlewood method, Cambrdge Unverty Pre, 98 3 RC Vaughan, A new teratve method n Warng roblem, Acta Math 6(989), -7 4 RC Vaughan and TD Wooley, Warng roblem: A urvey, Number Theory for the Mllennum III, A K Peter,, 3 34 5 TD Wooley, Large mrovement n Warng roblem, Ann of Math 35(99), 3-64