This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
«^ /
\«
C^ /
we have
^
f(n)
^
f(n)
^
2-1 f(n)
v
y ± y \tW\+0(}2££\
+( E, ^ j H \
pp'^^
i ^ log'£ + O(log{loglog$). /
By (4) and Lemma 3. Take f = x 1 / 2 c /log 5 a; and d = 2c. Then we have by Theorem A and (3) that (5) holds also for 4 < d < 6, where A(d) = 2c 27 f
^5
|,
V(d-i) 2 -2(f) 2 iogf + 5(i);'
4 < d < 6,
- -
(7) u
and
5c
( ) = 4 E i l o g 2 £ / l o s 2 ^ c^2-
(8)
pp'
Similarly we have A(d) = 2e 27 (
5-^
],
6 < d < 8,
(9)
10 where K(C)=8
— ^ log2 ~
V]
pp,f^c W
«
10 be a given number. Then there exist two non-negative and non-decreasing functions x (z) a n d A (2) {® < z ^ C.) with the properties that each has at most finite discontinuities, such that the following inequality holds uniformly in A > x log *
Vl Q g -x J
log*
V lQg 2 x )
(7)
where 7 is Euler's constant and the constants implied by the symbol 0 are absolute constants. The lemma can be followed immediately by Brun's method. By means of the methods of Brim, ByxmTa6 and Selberg (Cf. [4], [5]), we have the following tables: ...j 6.5
a A (a) | X(a)
... 5
... 4
5.197 . . . 4.42
... 3
... 0
...j 3.848
...j 3.564.
... 6.4524 ... 4.8396 ...j 3.6432 . . . 2.1371 ...
(8)
0
Remark: If we use EyxuiTaS's method and by more complicated numerical calculations, then the values in the above table can be improved further. Fundamental lemma. Let A. (a) and /[ (a) (0 < a <; C) be two functions with the properties as stated in lemma 3. Let w be an integer and /3 > a > 1 be two positive numbers. If
^-iirD(^)T" and if tn is the least integer satisfying the inequality -rr -\
+]
<9> ^ v,
then for sufficiently large x, there is always an integer n between xv—x and xv such that n has at most k — w + m prime factors.
32 4
Proof.
By lemma 1, 2 and 3, for sufficiently large x, the number of' i
j_
elements in HJi with at mostwprime divisors in the interval x *C p ^ x not less than
a
is
1<;-s
-pixxVxT\__
+
y
I
v(—
—
1
, D(Y ~~P~\ A.
rT\
O(/, > (X «,, - ^ j ^ ^ ) ^
+0(l ^^)
>,
This means that for sufficiently large x, there exists in the interval xv — x <. n ^ x v an integer n having not prime divisor less than or equal i
i
i
to x ** and having at most w prime divisors in the interval x^ -cp^jxaThat is, n is a product of at most k = w + m primes. Thus we have the lemma. (i) Let v be a positive integer. Let /3 = 5 and a = ~^r~ the least integer satisfying (2). I f
Then we have
4
^
, where w is
/ 5z \ dz 5 v—w
by table (8). Hence Theorem 1 follows from the fundamental lemma, (ii) By table (8), we have If
4
/ oz \ dz
.
._,
1r4
/ bz \ dz
119
"* ~
and
If*
/ 5z \ dz
Hence by the fundamental lemma, we have Theorem 2. The method used here has also many other applications. For examples, we have Theorem 3. Let F (x) be an irreducible integral valued polynomial of degree k without any fixed prime divisor. Let tk + \, if 1 < £ < 5 , n — \ I k + w, if k > 5, where w is the least integer satisfying w
+
1
^
5.64527 3.65 , __-__ 4.8396 + 4.8396 l o § w + 5 * •
33 5
Then there are infinitely many integers x such that F (x) is a product of at most n primes. For examples: there are infinitely many integers x, such that x3 + 2 has at most 4 prime factors. REFERENCES [1] Brun, V., 1920, Le crible d'Eratosthene et le theoreme de Goldbach, Vid.-Selsk. Skr. 1. M. N. KL. 3, 1-36. [2] Kuhn, P., 1942, Zur Viggo Brun'schen Siebmethode, I Norske Vid. Selsk. Fork. Trondhjem, 39, 145-148. [3] Kuhn, P., 1953, Neue Abschatzungen auf Grund der Viggo Brunschen Siebmethode, Tolfte Skandinaviska Matematikerkongressen, Lund, 160-168. [4] Wang, Y., 1956, On the Representation of Large Even Integer as a Sum of a Product of at Most 3 Primes and a Product of at Most 4 Primes, A eta Mathemalica Simca, 6:3, 500-513. [5] Wang, Y., 1956, On the Representation of Large Even Integer as a Sum of a Prime and a Product of at Most 4 Primes, Ada Malhematica Sinica, 6:4, 565-5S2. [6] Wang, Y., 1957, On Sieve Methods and Some of the Related Problems, Science Record, Academia Sinica, New Series, 1:1, 9-12.
34
SCIENCE RECORD New Ser. Vol. I. No. 5, 1957
MATHEMATICS ON THE REPRESENTATION OF LARGE EVEN NUMBER AS A SUM OF TWO ALMOST-PRIMES* f WANG YUAN
(3£
y_)
Institute of Mathematics, Academia Sinica {Communicated by Prof. Hua, L. K., Member of Academia Sinica)
For the sake of briefness, we write the following proposition by {a, b).
Every sufficiently large even integer can be represented as a sum of two integers > 1, of which one contains at most a and other at most b prime factors. The aim of the present note is to prove (3, 3) and [a, b) [a + b ^ 5) by the method used in previous papers 11 ' 21 . These results improve the (3, 4)[31 of the auther in 1955. Moreover, using Eyxurra6's ui method with more complicated numerical calculations, we have (2,3). Recently, we have found some mistakes in numerical calculations in the proof of (3, 3) of A. H. BHHorpaAOBt5]. We shall state it at the end of this note. In this paper, p denotes prime number and p{ denotes i-th odd prime. Let x be an even integer and £ be a real number. Let (w) a; a{, bt (1 u > 1 be two given positive numbers. Let 5{ denote the set. of integers n (x - n) satisfying the following conditions: (3)
1 < w < * , n (x - n) # 0 (mod 2), n (x - n) =£ 0 (mod^) (1 < i < s ) ,
where ps^x~r
Let 2Ji denote the set of integers n(x — n)
0, there exists a positive integer n such that THEOREM
(33)
I ?(n+l\
-ai;<£
(1 < • < * ) .
X% + * —1) : There exist positive constants c = c(a,t) and X& = Xa(a,s) such that in any interval 1 < n < X the number of n satisfying (33) is greater than eX/logh+1X whenever X > Xo.
49
Functions
ip (•»•)• ( T ( » ) and >8(n)
211
Proof. To begin with, by similar arguments as in the proofs of lemma 3a and of theorem 1 [4], we can choose Ao, At, ..., Ah, depending on a'ts and e only and satisfying the same conditions as in theorem .1, such that .....
{3i)
9»(4i)Mi
^)jA~l-
ai{<
t:
,
,
Wld
2
cpjiA^jiAj
e
^(.--D^^-DA;:;-**' ( 2 < i < ft).
For those J.^s we assume that (x0, ....,#&) is a solution of (1) satisfying (2) with Z = Xc>. If we take Aoxo = w, then £ 4 ^ = n+i (1 < i < h). Since (a?,-, A,-) — 1 (0 < i < 7i), we have rp{n)
fp(Aoxo)
(35)
•) and 0(n)
cp(n) and a(n), Bull. Acart. Polon. Sci.. Cl. I l l , 3 (1955),
[5] Shao P i n - T s u n g , On the distribution of lltu values of a class r>i arithmetical functions, Bull. Aoad. Polon. Sci., Cl. ITT, 4 (1956), p. 569-572. Keou par la Redaction le, 7. 3. 195G
Note added in t h e proof by A. Schinzel. Theorem 1 easily results from the following theorem of G. Rieei (see G. Ricc.i, Su la congetiura di Goldbach e la iionstante di Schnirehnnn. Annali ilella R. Souol.i Nnrinalo Superiore. rli Pisa •> (2) 1937, p. 83): Let, a-jK + frj,
diffe-
(«xa;H- 6a) (tt2w +ft g )... {a,fx + bf)
and put fljtt + frj = d1l\, «2w-(-i, = d2P2,... .a/.v-^-b/ = d/Pf, -wkererf1f/!>...rf;— D. The number of natural numbers x «C f such thai all integers P X ,P 2 Pf have no prime factors < J1/(1+2T(/» is of the same order of magnitude as f/log'f. In fact, in virtue of lemma 2 [4] thorn twists .1 natural number m such that. Ai\'»i + i.
(Ai. {m + i)iAi)
--• I
( ( ) < ; ; < I'-)
;uid in v i r t u e of t h u f o r m u l a s i l ) - ( 3 ) of [ 4 ] UlA\...A%,m)=Aa.
{AlA\...Al:l,+i)
= iAi
(1 ^ i ^ h).
Pin 6, -
ar-AaA\...A\, ,H - A\A\...
w /,t B ,
A*/(i ~i)A{_t
hi •---. (-w-fi-
( I -- ; < > . . + ! ) .
i)j(i-\)Ai_l
We therefore get (a%, bi) = 1 {l^.i^.h+1) aud (Ao, 616a ... 6A+I) == 1 whence also ((ft+1)!, 6j6» ... ?>A+I) = 1. From the last equality it follows that the polynomial (u^e + bj) (aax + b2)... (ak+ix + bh+i) lias no fixed divisor > 1, since such divisor I> divides (7t+l)!. Putting in the above mentionod theorem of Ricci dt=l, a^x+bi -• Xi_ 1 (1 ==J i ^ h) we find that the number of natural numbers x =g; $ such that all the numbers xi ( O ^ i ^ / t ) have no prime factors ^ f1/(1+J*(*+1)) i* of the same order of magnitude as f/loeA+1f. Put I = -
A
0X-m
A A
l \--Ah
, ^ |1/(1+2»{A+1))
As the number xt satisfy the system of equations (1) and for x ^ $ the conditions (2), we get the inequality
wJiere e2 > 0 and X1 are constants depending only on Ai and «( i* an arbitrary constant <
, depending therefore only on h. 1 + 2 T ( » + 1)
52 ANNALES POLONICI MATHEMATICI XIX (1967)
Corrigendum to "A note on some properties of the functions
oo (p(rij + v)
i ^ ^ i. 1 < v < k.
The aim of the present paper is to treat this problem by Linnik-Renyi's method, and to improve the above result: under the same assumption, we shall prove that there exists a sequence of prime numbers {pj} such that ^ ^ + "
+ 1)
l
The proof of the above result depends on the following: Fundamental lemma. Let k be a positive integer and m
0
= (fc + l ) ! 2 < 7 o i - - - ( ? o t o ,
" i t = fti • • •
fcti.
l < i < k
(1)
be integers which are coprime from one another, where q^ (0 k + 1. When x > Z > (motni • • • nik)2, let Nz{x) denote the *Acta Mathematica Sinica, 8:1, 1958, 1-11
54
number of integral solutions (p, XQ,XI,...,
Xk) of the system of equations
(p+l=moxo, | p + v + 1 = vmvxVi
(2)
1< v
satisfying the conditions 1 < p < x,
and iip'\xv, then p' > Z 0 < v < k,
(3)
where p and p' denote prime numbers.* Then there exist two positive constants c\ and Xi, and a positive constant a depending only on m^s such that Nx°(x) >
k 2
log
Cl3;
x log log x
,
x>X1.
2. The Proof of Fundamental Lemma Let M = (mo,mi,... ,mfe)2 and A be an integer such that 1 < A < M and (A, M) = 1. Let p\ < P2 < • • • < pr < Z be all primes not exceeding Z and not dividing M and a^ (1 < i < r, 1 < j < k + 1) be positive integers satisfying the conditions: 1 < a^- < pi and aij1 ^ a^ for j \ ¥" h- When x > Z > M, we use Mz(x) to denote the number of prime numbers satisfying 1 < p < x,
L e m m a 1.
p = X (mod M),
p^
l
l<j
+ l.
(4)
There exist A and aij 's such that Nz(x)
Proof.
aij (mod pi),
>
Mz(x).
It follows by Sun-Zi theorem that the system of congruences y + v + 1 = mv (modml),
0< v
(5)
has a unique solution A in the interval 1 < y < M. Since mv\(\ + v + 1), we have (mv, A) = 1 by the definition of mv. Hence (A,M) = 1,
(mv,X
+
" + 1) = 1 ,
0 < ^ < A:.
(6)
+1.
(7)
Let aij=Pi-j, a
Hereafter we use p,p',p\,P2,
l
l<j
• • • ,Pi,P2< • • • t o denote prime numbers.
55 Take p satisfying (4) for the A and a^ 's. Then
jp+1 = moxo \p + v + 1 = m o x o + v ~ vrrivXv, 1 < v < k by (5), and
. fp+1 \ /A + l \ ,m0 = m ,m0 = 1, (xo,mo) =
V m0
/
V o
J
(xo,mi) — (moxo,mi) = (p+ l,m») = (p + i + 1 - i,mj) = (-z,mj) = 1, 1 < i < fc, (xi, mj) = (irriiXi, m3) = (p + i + 1, m^) = (p + j + 1 + i - j , rrij) = ( i - j,mj) = 1, i / 0 , i ^ j , j ^ O , / /. v finiiXi \ fp + i + l \ N (ixj, m 0 ) = [irriiXi, m 0 ) = (p + i + 1, m 0 ) = (i, m 0 ) = i,
i ^ 0;
by (6). Since i 2 |mo, we have (xj,mo) = 1 (i ^ 0). Therefore (x o a;i • • • Xfe, m o m i • • • mjt) = 1
(8)
((P + 1)(P + 2) • • " (P + k + 1), P! • • -Pr) = 1
(9)
and
by (7). It follows by (8) and (9) that for such p, we have a solution (p, xo, x\,..., Xk) satisfying the requirement in Fundamental lemma. The distinct primes correspond evidently to distinct solutions. The lemma is proved. Lemma 2. There exist a positive constant f3 depending on k and two positive constants C2 and X? depending on k and M only such that MXP(X) >
C2
log
T
*
x log log x
,
x>X2.
Fundamental lemma is clearly a consequence of Lemmas 1 and 2. For the proof of Lemma 2 the reader may refer to Renyi [6] for k = 0. There is no essential difficulty to extend his proof to the case k > 0, and we still give a sketch of the proof for completeness.
56 3. Brun's Sieve Method We suppose that M,\ and Oy's are integers satisfying the conditions stated in Sec. 2. Set
P(x,Q)=
g
a, = - _ £ _ + * , ( * ) ,
(1,0) = i,
p = I(mod Q)
Mz(x) =
5Z
V
p = A(mod M) p£ay(modp 4 ) (l
L e m m a 3.
Let r = r0 > r\ > • • • > rn > 1 be any given set of integers. Then
Mz(x)>
xE ——
(pg) • • • (p(pv)' a cgn/log n. ) = 2v 2, (r)< S ( q, i.e., it is equal to w'2s = zp,
R=\RM(X)\
+ (k + l) Y, \RMPa(x)\
V\fv )
+ (fc + 1 ) 2 ^ Y l \RMPaPB(x)\
+ •••
a>0 2n+l
+(*+irEEEE-Ei«^*(4 or
a>/3>--->!/
''^'•n
The estimation of E: Take /i = (1.25) ^F1 andfto= -^e. Then there exists a constant 5Q> M such that for 5 > So, we have
)
^^
—7-7 < log /l0 = T, V(P)
I
1
V
T-T-
/
< /l 0 .
_^______
57
Let pTj (0 < j < t) be the largest primes
Take n = t + rt and rs = rt(t < s
ptM
where C3 is a positive constant depending on k and M only (see Wang Yuan [7]).
4. Several Lemmas We use XD to denote the character modulo D. Let D = p"1 • • -pf be the standard decomposition of D. Then XD =Xpa^ • • • Xpa' • If XPQ* is primitive, then we say that XD is primitive with respect to p^. XD is primitive in the usual sense if it is primitive with respect to all p"* (1 < i < I). Lemma A. Let q,A be two integers such that A > C4, where C4 is an absolute constant, and p be a prime number satisfying A < p < 2A and (p, q) = 1. / / 2 and fci
logf
log .4
then except O(p 3 / 4 ) primes in the interval A
the
holds for any x(n) modpg which is primitive with respect to p, where c$ is an absolute constant and 62 = (4 x 104 ks)~1 in which k% is defined in Linnik [8]. We refer Linnik [8]. Renyi [6] and Littlewood [9] for the proof. Lemma B.
Suppose that (I, Q) = 1 and Q < e^logx,
then
where e is any pre-assigned positive number, CQ and the constant in " 0 " are absolute constants, and Qi is the modulus of "exceptional" character x-
58 See Titchmarsh [10], Page [11] and Siegel [12]. Since ap < logo;, we have
Lemma C.
The estimation P(r O) <
2xl gX
°
holds uniformly for 1 < Q < ^fx. We denote by E the set of positive integers Q = p[ • • -p'uM satisfying Pi > • • • > p'mPi + M,p^ < zM
If Q £ qi,...,qu belong to Set K
l < i < 2t + 1,
V'i
i>2t
+ l.
E, we write Q =p' 1 ?i, q\ =p'2Q2, • • •, Qu-i =p'uQu, qu = M and call integers the diagonal factors of Q. It is evident that all diagonal factors of Q E if Q £ E. — n ^ p ^ t P- We omit the proofs of the following lemmas, since they can pfM
be easily derived from the definition of E. And we use cr, c%,... to denote positive constants depending only on k and M if there is no special explanation. Lemma 4.
Let v(Q) denote the number of prime divisors of Q. Then v{Q) <
10(fc + l)loglogx Lemma 5.
ifx>c7.
The number of elements of E is < KZ?, where f — 1 + T~Y'
Lemma 6. Suppose that Q £ E, Q = p[qi, p[ < q± and p[ > MK. Then the number of such Q is not exceeding Zgvlh" , where g is a positive constant depending on k only. Lemma 7. Let {p*} be a set of integers with the property. For any given number A, there are at most A3/4 elements of the set which are contained in the interval A
V —
E ~T^ = IT (1 + -T^—^) log* + 0(1). Lemma 9.
Ifn> 2, then
59 5. T h e P r o o f of L e m m a 2 Set K
XQ(X)
= Xl x< 3^ a Pp<x
Then for (I, Q) = 1, we have
( 10 )
P X
( >® = JQ)T,XQWK™W^
W )
(XQ)
It follows from Lemma 4 and the definition of E that
R<(k
+ 1) 2 " + 1 ^
< e ( 2 n + 1 ) l o g ( f c + 3 ) J2
\RQ(X)\
QEE
\RQ(X)\
QGB
< e10(fc+l)log(fc+3)loglogx J - |i? Q (a;)|.
(11)
Q€i5
If Q = pi 9 i € £7 and Q > e ( lo « x ' 2/5 , then p[ >Q^ by Lemma 4. Since 71 < pi
>2e ( l o g l ) 1 / 3 ,
x>c9
, we have
Jbi = ^ + l = | ^ ( r i + o f r i T ) ) < l l ( f c + l)lQgIagx, log^ log Pi V \l°gPi/7
x > c 1 0 . (12)
Take B = 2e (logx)1/3 and A = 2 n B(n = 1,2,...). For a given qlt we use Lemma A to the interval A < p < 2A and introduce the following two conditions: (i) If Q > e('°sx) 5, then we say that condition I is satisfied. (ii) If Q € E, Q = p[qi and p[ is not the exception with respect to q\ in the sense of Lemma A, then condition II is said to be satisfied. If the above two conditions are all satisfied, then it follows from Lemma A and (10) that P(x,Q) = — ^ 7 - P ( X , 9 I ) + O ( X 1 - ^ T i o g : E ). If <7i still satisfies these two conditions, then the process may be continued and so on until one of the conditions I or II is not satisfied. Suppose that such processes are performed 5 times. Then
p
' =*i^) p
where q0 = Q and ki = logq\jlog §• + 1.
60 If condition I is not satisfied, i.e. qs < e^°sx^2
5
, then we have by Lemma B that
If condition II is not satisfied, then
P(x, qs) =
+O tp(q.)]ogx
. , \V(««)/
by Lemma C. In conclusion we have the following four types of error terms:
^ W '
(")
/QN
'
(m)
^ ^
.
(IV) ^
^
logs.
We denote by Ri,Rn,Rni and i?iv for those terms in YIQZE \RQ{X)\ that belong to types I, II, III and IV respectively. (i) By Lemmas 4, 7 and 8, we have Ri < cnxlog^x/e1/4^^1'3,
x > c12.
(ii) By Lemma 8, we obtain Ru < cis xlogx (iii) Take e =
18/fc+1^og(-fc+3->
• e 0°g^) 2/5 -'=6Vl5^ ;
%>
Cu
- Then it follows from Lemmas 8 and 9 that
Rill < CIS Z l o g 3 * • e-18(fc+l)log(fc+3)1oglogx]
x >
Cie
(iv) We use R^ to denote the part in R\y with ki < 2. Take Z = x1/JV
and A ^ > ^ ,
where iV will be determined later. Then by Lemma 5, we have -Riv < cirzf
' xl~^ ^°ZX = cnxl~™ log a;, a; > cig.
61 (v) Let R$ be the part in Rw with ki > 2. Then kt satisfies 1v < ki < 2v + 2, u(fc+1) loslogx ] by (12). Since p\ < q\'v and p\ > 2e(loe*)1/3 > 2 v = l, 2 , . . . , [ MK (x > cig), we have [J£(fc+1) log logs] R
C
IV < 20
log2X,
Xl~^iZ^
J2
X > C21
by Lemma 6. Take
(13) We have R\v
< C22 a; log- 5 1 • e "(fc+iSiogiogz-s ^
a; > c 2 3 .
By the combination of (i), (ii), (iii), (iv), (v) and (11), we have R < c 24 3;e-8(fc+1)lQs(fc+3) '°s'°g' log3 a; < c 24
^ log *•
, ' a;
x>c25.
(14)
Hence it follows from Lemma 3: Lemma 10.
There exist c26 and X3 depending on k and M such that ^
{ X ) >
^ ~
X
'
X>X
"
where N depends only on k. The Proof of Lemma 2.
Set (3 = jj. Then
MxB(x) < log^ • e-2^MxJ(k
+
*)*lo*]o8*) +logx.e-^W>s*n(x) \ log a; J s^ ( x \
and /(fc + 3)xloglogo;\
c27x
M — ^ — ) - ^ ^ ' x>C2s b Since h = (1.25) "k+r > 1, we have limy_oo V^V depends on k only.
— 0- Hence the existence of d is proved and it
62 by Lemma 10. Let
y>X2.
The lemma follows.
6. Applications of Fundamental Lemma Lemma 1 1 . Let GQ = 1 and av = v (1 < v < k). For any given k non-negative real numbers ai,..., a^ and e > 0, there exist positive integers mo,..., m/t depending only on ai's and e such that
^::?Z^-^
(15)
Proof. Let pu = ^ (l 0 (1 < v < k) such that h
^-a/-^ dv
pu
< | . ^ i , 3 pv
\
i.e. 6i---^_i^^+i'--rffc _a bi • • • bv^idvdv+i
pv-\
• • • dk
pu
e /?„_! 3
p^
<
~
<
~
Let &i • • -bv-idvdu+i
• • -du
—
= ^_i,
. , ^ ; , i
l
bx • • • Ofcdi • • • d f c
Then
For any given e' > 0, we may choose positive integers m'0,mi,... , m t which are coprime from one another such that their prime divisors are all >k + 1 and
63 since 0 < r\v < 1 (0 < v < k) and f ] p (l — | ) = 0. Hence we may take e' = e'(di's,e,p) sufficiently small such that ~^~
„ Pv-i
<
£
P^± 2
a,P0
~^~
<-.?°.
Set mo = (A; + l)!2mQ. Then we have the lemma. Lemma 12. Lemma 11.
This lemma is obtained by changing the function
Theorem 1. For any given k non-negative real numbers a\,...,ak there exists a prime number p such that
and e > 0,
y(p + v + 1) _ ^
(16)
Moreover, there are two positive constants C29 and X4 depending on a{ 's and e only such that the number of primes satisfying (16) in any interval 1 < p < x is not less than C291—k+2 x,—; whenever x > X4. Proof. First we choose using Lemma 11 the positive integers mo, m i , . . . ,m,k depending on a^s and e only and satisfying the requirement of Fundamental lemma such that (15) hold. Then let (p, xo,... ,Xk) be a solution of (2) satisfying (3) and Z = xa. Since (xi, m o , . . . , mfc) = 1, we have ifip + v + l)
=
~ ip(crv-imv-ixv-i)
_
- avmv
~~ y(^-im,-!) O"y— \TTLu — 1
_ ~^r ip(a^-i)
_ p + v+ l p + i/
'
^
'
Xv—\
Since the prime divisors of Xj, are all >a; a and £„ < 2;, the number of prime divisors of xv is at most [^]. Hence
(18) and consequently, it derives from (15), (17) and (18) that there exists C30 such that (16) holds whenever x > p > C3o(a,e). This proves that we may obtain a prime p satisfying (16) from a solution (p,xo,...,Xk) of (2) satisfying (3), Z = xa and p > C30. Since the number of solutions of (2) with p < c 30 is at most c 30 , Theorem 1 follows immediately from Fundamental lemma. Theorem 2 is obtained by replacing the function tp(n) by
64 Theorem 3. Let k be a positive integer. Then there exists a constant 7 depending on k only such that for any given k + 1 positive integers ao,a\,... ,Ofc, there is a prime number p satisfying av
+ i/ + l)<jav,
(19)
0
Moreover, there are two constants C32 and XQ depending on av 's only such that the number of primes satisfying (19) in any interval 1 < p < x is not less than log*+^toglogs
Proof.
WfleneVer
X>XG-
Assume that a o , . . . , a^ satisfy 2 a "
Q
We take tv — av + 1 in (1). For a set of m^'s, let (p,XQ, ... ,x^) be a solution of (2) satisfying (3) and Z = xa. Since the prime divisors of xv are all >xa, xv is a product of at most [^] primes. Set 7 = 2- +1 (fc + l)! 2 .
(20)
Then d(p + v+l)
= d{avmvxv)
d(p + v + 1) = d(aI/ml/xu)
> d{mv)d(xv) <
<(k + l)\22tl'2li}
> 2%" > av
d(ao)d(mll)d(xv) <-yav,
0
The theorem follows. From Theorem 3, we derive the following Theorem 4. For any given a\,...,a,k, where ai equals to 0 or +00 (1 < i < k), there exists a sequence of prime numbers {pj} such that d{pj+U + l)
lim -^77 r-^- = av, j-HX> d{Pj + V)
l
Finally the author would like to ask a question: Is Theorem 1 still true if cp(n) is replaced by the divisor function d(n)7
References [1] B. S. K. R. Somayajulu, The Euler's totient function
65 [4] A. Schinzel and Y. Wang, On some properties of the functions, Polon. Akad. Nauk 3 (1956) 201; A note on some properties of the functions
66
SCIENTIA SINICA Vol. Vin, No. 4, 1959
MATHEMATICS ON SIEVE METHODS AND SOME OF THEIR APPLICATIONS* WANG YUAN (3L
5C)
(Institute of Mathematics, Academia Sinica)
§ 1. INTRODUCTION
For the sake of brevity, we denote the following proposition by («, b). Every sufficiently large even integer can be represented as a sum of two integers > 1, of which one contains at most a and the other at most b prime factors. In 1919, v. Brun ll] first gave an essential improvement of Eratosthenes' sieve method and proved (9, 9). Brun's method and his results were improved and extended by several mathematicians, for examples: (7,7) (6,6) (5,7), (5,5) (4,4) (a,b),
(H. Rademacher12'), (T. Estermann131), (4,9), (3,15), (2,366) (G. Ricci1'1), (A. A. EyxuiTa6t5]), (A. A. ByxuiTafiW)", where a + b<6 (P. Kuhn)19"1".
In 1947, A. Selberg112"141 published his new improvements of Eratosthenes' sieve method. By the combination of the methods of Brun, EyxurraS and Selberg, we have (3, 4)[15J. By the use of Selberg's method and some results in the theory of the Riemann C~ function, A. H. BnHorpa,noBt16'171 obtained (3, 3). The aim of the present paper is to prove (3, 3) and* (a, b) (a + b*^5). Moreover, using EyxurraS's method with more complicated numerical calculations, we have (2, 3)118"201, that is: *First published in Chinese in Ada Uatheniatica Sinica, Vol. 8, No. 3, pp. 413—429, 19581) C£. also B. A. TapTaKOBCKHft'7-81.
a 358
Theorem 1. Every sufficiently large even integer can be written as a sum of two positive numbers > 1, of which one contains at most 2 and the other at most 3 prime factors. We have also the corresponding results for the problem of twinprimes and the problem of representation of large odd number as a sum of two almost-primes15. Namely, we have the following Theorem 2. For any given even number ^, there are infinitely many integers n, such that each of n and n + k. has at most 3 prime factors and n{n + ^) is a product of not more than 5 primes. Theorem 3. Every sufficiently large odd integer can be represented as 2N + 1 = IP + Q (P > 1, Q > 1), where the number of prime factors of P and also of Q is not more than 3 and PQ is a product of at most 5 primes. In this paper, p, p', p", • • •, pi} p2, • • • denote primes. § 2. COMPUTATIONS
Lemma 1. Let J2(«) be the number of different prime factors of n, that is Q(n) = 2 1. If x > 1 and z > 1, then
? j £fe ii^, i n_^n(.-|)
1
(1 + f ) - ^
+ O(log22-loglog3w) + O((loglog3*)2) , where /*(«) denotes the Mobius function'21'.
Lemma 2. If 21 x and z> 1, then *<*
»
'«V
P-2/
8 P>2 P(P~2)
(».i)=l
"x
P
P>1
+ O(log ^ log log 3 xz). Proof. Let (P(r) = Tl (/> — 2). sp
1K»)]2 OW n / , ,
r<*
x
'
2
=
V
Then by Lemma 1, we have |K«)l2° ( r t
V
_2^
s<x/r
1) An integer is called almost-prime, if the number of its prime factors does not exceed a fixed constant.
68 359 __
|Kr)l2^
f_l_
(p - iy (p + 2)
p
z
+ O(log #.v log log 3 2#)> =
_ l n Q, - I ) 2 (p + 2) n _ ? _ . , „ . y l/x(r)l4^) 3 2 V ? ',, P + 2 " r ^ , | J (p2 _ 4 ) + O ( log #:*: log log 3 #x)
= ~ TT Cf " ^
8 p>i p(p — 2)
TT —~ PU
p
log2^ + O(log ** log log 3 «e) .
Thus we have the lemma. Lemma 3. For any given 7 > 0, there exists a positive constant *o — ^0(7) s u c n t n a t ^ e inequality log x
holds for x > x0, where d(x) denotes the number of divisors of x[Z2] Iog3x
Lemma 4. Let A ( * ) = e ^'««»*> where x > 1. Then there exists Cj > 0 such that
1
4
log 3J
i z^OCe""'1108'0891) .
Proof. Let /?,- be the ;th prime number. theorem we have
Then by Mertens
ir(i-|)--o(n(>-^r)-o( n (i-if) = O( log log 3*) .
Hence, it follows by Lemma 3 that
a(«-ir-{-^(.-ir+s>(»-in.^r p^fp*
69 360
A(*)
=
p
V
PI
V
f\x
J
pp'\x p*pf
TT (i - i.)
AGO
P\x\
pj
log3x
-c 1
= 0(e
U
'""«••) .
Thus we have Lemma 5. Let q—O(l) be a given integer and y be an integer. Let «(D = 1, « ( ? ) = — ( * I y), * G 0 = —(? + y), «G0 = TT g(p)and/(«) = p
P
Pi"
- f v - TT (1 - g(?)). If z > 1, then »
/C«)
4 p|,
V
?
P > 2 />(/> — 2 ) p|, y P — 1
pl?y P — 1
log log 3 yz/
p>i
Proof, (i) If z ~> A(y) > log 2^, then log log 3^ = O(log 2y) and log log 3y = O(loglog3x). By Lemmas 2 and 4, we have 2
»
WJOJ _ s J K ^ U ^ fk")
n
«•£*
(i - ±y
n
Pl» V
P'
+ 2M'--)-2>^=-n(i-ir P'+9
(»,«y)=l
+ 2 ^( 1 _4r( l _^.)- s >•
p'pf'ly P P
P'
^
P
/
i£«&Ln(i-|r+-
n
n
p\n
\
P/
>{i +y iz4:(i-4r+ s ^ ( , - Pi 'r ( i - -P v^ r + -3} y P P^ p' "ly P P 1
V
fSAW p'+«
IK«)|2^
2
K
f IP'P''.9>=1 P'=iy"
n
(1
+
(».«y)=l
+ O (log 2 2y log log 3 ^y) J
_2_)
V
70 361
4
p\q P P>2 pip - 2 ) p\*,p—l
x
Ioglog3y
\p\qyp~l
P>2
P>1
/
(loglog 3 y ) 2 /
pl«y ? — 1 P>2
+ O(log2 0y • (loglog 3 zyY) = JL 7 | £Z^ yj C P - 1 ) ; U £^2 l o g ^ + Q / ^ £ - 2 4
Pl9 ^ p>2 Pip ~ 2) f-«y ?— 1
Iog22gy \ ^
^pl«y?~l
P>2
Ioglog30y/"
P>^
On the other hand, we have n
I
ply \
?/
PJ V8 p>7p(.p-2)
P+q
=
p'\y p V
p]qy P>2
P
I
T ^ g 7 i T T ^ p ^ n ^ f i o g ^ + o(TT£nfSky?"1
4 pi, P p>2 /?(/> — 2 ; (,|,y/>— 1
lo 2 y
f : ).
Ioglog3^y/
p>i
P>J
This proves the Lemma. (ii) If A( y )
2^>{i + 24(i-4)"' + 2 ^(1-^(1-^)"
<•
p'ly P
-1 »
V
P'
»'«»|y P P ^
Pin X
"
P'
\
/» '
r '
(»,«y)=l
= J ^ n tzl\\ (* ~ iy TT 2=iw# + ofTT£=^ 4 i,, ? "»;(p-2)iU-i P>J
and •<- / ( » )
J »
l».9y)=l
^
O'lyP V
»
P'
p | » ^ P/
log22gy
"j
Vpi'y/'-l log log 3 «y/ P>2
Jff\, P P \
P> V
P ^
71 362
4 t u P P>IP(P — 2) piqyp—l
^piqyp — i
Ioglog3sry/
Thus the Lemma follows. (iii) If A(y) > z, then by Lemma 2, we have S J^2i = o ( 2 l£Wl^ n ( 1 -i)-)
V(log log 3y) 2 /
V ;,' y p - 1
log log 3 zy )
and 4 pi,
P
P> 2 ? ( ? — 2)
p]n
P— 1
= O(TT -^IA . _wii2_y ^pi«y P — 1 P>2
Hence, »<, / ( « )
4 •;,
p
+ 0(n^zA.
^ Play P — 1
log log 3 zy )
;;2
P{P
- 2) ;,, y p - 1
W2zy \ log log 3 z y /
Thus the Lemma follows by (i) (ii) and (iii). Lemma 6. Let jB > a > 1 be two real numbers. Then for * > 2, we have p § 3.
THEOREM A
Let 2 < y < * be two integers. Let a,q;
a;,bj (1 < i < r)
(w)
be a sequence of integers satisfying the following conditions: 2\q, <7 = O(l); if Pi\y, then«/ = *i (mod/>,), otherwise a,-^ £,• (mod/>,) ( l ^ « < r ) ,
(1)
where 2 < px < — <pr < f are all the primes not dividing q and not exceeding $ and where $ is a real number and $ > q.
72
363 Let Pul(x, q, £) be the number of integers « satisfying the following conditions: 1 <^ » < ar, » == a (mod q) , n ijfe a; (mod pi) , n Ej£ b; (mod £>,•) (K.•<>-). (2) It follows by the Chinese Remainder Theorem that each of the systems of congruences y = a; (mod pi)
(1 < i < r)
y = 6; (mod pi)
(1 < « < r)
and has a unique solution in the interval 1 < y < pyp2 • • • pr. Denote these solutions by a* and b* respectively. It is evident that the conditions (2) are equivalent to the following conditions: 1 <«<
«,
n = a (mod q) ,
(ji — a*) (» — &*) ^
0 (mod p;)
(\
Theorem A.
(3)
r
Let c > 0 and P = 11 /?,- = TI p.
Then the esti-
?+«
mation p;(*, ? , f) <
^——- + O^2-" log6 $) y |/*(w)
holds uniformly in (w), where ^(D = 1, «(p) = — (phi, P gin) = ]T g(?)
s(p) = — (P + y), P and /(») = ^ — TT (1 ~ g(?)).
Proof. If ^ IP, then (^, ^) = 1. It follows by the Chinese Remainder Theorem that the number of solutions of the following system of congruences (» - «*) (» ~ **) = 0 (mod 10 1 n = a (mod
73
364
£
l = 2««-«(*.,))
[JL]+
*R»-«'X»-i')
O ( 2 *«)
^- k.1 '
= *(*) — + O(2O(«) . Let
A *
IK")I / v M£i
v
tip
*(*> /CO x ^ / *
'<«>
X
« ^
^
'
where ^ | P . Since hx = 0 and Arf = 0 for «/ > $c, therefore
n^a (mod qi
< X <S0 < r
fl=d (.mod ij)
=•2
2 M<,
I*5
^)/2
2
(
VrfKCfi-a"1) (*-»•), p)
2*€
2
i
n=« Imod «>
= f - 2 2 ^sCG/i,*,})
where {^i, 2) denotes the least common multiple of dx and d2. If « is a square-free number, then
-TT = 2 -fr Z ^)= 2 ^ £W
r|«
gU;
rf|r|»
ix\n gKX)
=
= 2 —r n a-gw)-z/(*). Hence, y
~
^
^
^ d'7r7J~7yT
S 2 ^
K\n d\k
g(jL)
74 365
= 2
2 KKgiddgUZ 2 /GO
= 2 /G0( 2 **«(*))'. Let
5=
V IK"»)1
Then, we have for \\P
m|/
m|/
and
2 !•«(*) = 4- 2 2 ^ - ^ 5
'1*1*
' 1 * 1 ' «m<«'/*
*<•"**•>
= LK£L
s fid) •
Hence,
By the Mertens theorem, we have
-((2WJW(S5^"J) *l?
vv
«*
*l/
TT (1 - A V
= O(£fclog«£). Thus we have the theorem.
y
vv
t<^
*}
75 366 §4.
APPLICATIONS OF THEOREM A
Let / be a positive integer and / < c ^ / + 1. Then by Eratosthenes' sieve method we have V
IK")! _
i
f(»)
\Kn)\ _
y
/(«)
1
y
y
\Kn)\
1
(
/(*)
fin
*
2
2
/C»)
K.<««
+
l^i-+-•••+(-!)'
f
pjp^? 17
+
A
^
(4)
1M(")1 _ +.. /(-)
(».pip»«)=i
(-1)'
!
2
If
1 ^ c < 2, then
\ftM\
^
«
1°.
s
^B>
^ « f W ,
S ! y ,
2
^r.p; (».p1-p/«)=i
1 < B <
for sufficiently
/(»)
large
*, we take
i
x2*
f = -—^— ( > q) and write 2c = d. Since
o +o o £^-,£}= (,£i) (|i)= (T) s P+y
V X V" ) ' thus by (4) and Lemma 5, we have y
_IK^)i = y
^
K») i
\Km)\ _
/(»)
y
_2_ v
(<%<
1A*(«)1 •i.^flogM
P £„ Km)
+o
\-^r)
xnf=|iog^ + o(TTf4--^-).
76 367
Therefore, it follows by Theorem A that P-(*. q, ^V") < P»(*, q, j ^ 5 - ) \ log x J
< ^ ) ^ Tfog4* - + °p\qy ( nP ^ - I^-) — I T log log * / 3 2
(5)
X
P>2
A{d) = 2e» \ £—1 (2 < d < 4) , [G*-l)>-2(|)log|J
1
p>2 V
(6)
(/»— 1) ^ P I , P — 1 pl,y? —2
(7)
P>2
where the constant implied by the symbol "O" is an absolute constant, and y denotes Euler's constant. 1
2°.
x2c If 2 < c < 3, then we take also f = -—r— and write 2c — t/. log 5 a:
Since V
1
y
1^(")| _ y
1
y
1^(»)1
and V ^ pp'<Se
1 _ y J_ = V (_?_ 2 _ 2 2 \ 'W /(?') , ^ , » ' f <^, V-2 ' t-2 P-2 p J pp'
pp'
therefore by (4) and Lemma 5, we have
2 !/*(»)! = y I/*C»)I _ y 2. v !/*(")! «<«« '(»>
«ci. / ( » )
«
p
»„ K » )
77 358
l
+ 2 — 2
4 wK?-2)
pi,
f
pi,y?—1 p>/
V
pi«>?-1 P>J
-^+o(^)
log log «/
Hence it follows by Theorem A that for any given e > 0, there exists a positive constant *0 = xo(e) such that (5) holds for x > x0 and AW=2t»(
f
-—
\ ( 4 < i < 6 ) , (8)
where 5(«)
=
Hm
^ _
2
- ^ r Iog2-il- (« > 2) .
(9)
PP'<€"
Eq. (5) also holds for x > x1(e)> 6 < d < 8 and
(6<J<8),
(10)
where K(a)=jto
8. 2
-^>Iog'-|l; (a>3).
(11)
«
In the same way we have the expressions of A(d) for d > 8. Let us put A(d) = A(2) for 0 < J < 2, then it is evident that (5) holds for 0 < d < 2. We may estimate 5(a) and X(a) by Mertens' theorem. For example,
Hm 2 i->Hm( 2 ^ I
-i+
78 369
+ Z | +
2
-V+--- + 2 \
2 A-
2 - ^ 2 -V)
_—, log 1.01 ! n1 ,log 1^19 4-log, . 1.02. , ,log 1.09. 1.11 log1.18, 4---- + log 1.1 1.01 1.09 1.08 1.09 +, .log 1.095.log1.105.> nnnCiC1 0.00561 1.09 1.095 We have also the estimations of 2 «f
pp
T and
2
T (2 < i
t
PP'-X
&
(2-'
< 9). It follows that *(3)>4 1im(o.81 2 - V -f- 0.64 2 - V + • - •
+ 0-01
2
—^-r) > 0.087202 .
f
§5.
THEOREM B
Theorem B,. Let 1 < a. < /3 < 15 be two given numbers. If there exists a non-negative and non-decreasing function A(d) (0 < d < 14) with the property that A(d) has at most a finite number of discontinuities, such that the following inequality holds uniformly in (w) and d: P-(*W,s 1 ") < / i ( * ) - ^ - +o(TT - ^ ^ •, 2
log AT
V f,;, p — 2
2 2
,y ,
),
log x log log */
then xi/^,1/-
^
/
VJ—«
V« + i /
P+y
+ o V( ^ _ _2 £ ? y ^ _ _ _ ) log * Jog log x ' holds uniformly in (vf).
«»
/ log2*
79 370
Proof.
L e t n = [ V l o g x ] a n d u, = « + A l l l / - 1 ( 0 < / < « ) .
Then, by L e m m a 6
P+ y
p+ y
I <
I I
/ p log2 *//»
log A:
A ( - ^ ± L \ SSZJL (i O g ifi±L \ » ; + 1 + 1/ log2* \ W;
^2
+ 0(
V log2 */p log log */)
+ "<-« - »') + o (^S3^L) Ul+lUl
'
\ log* X /
(iog^±L+ »m-«A\
^log x log log a; V
«/
«;+i «; / /
Since -—•— is an increasing function of x for x > 1, hence* 1 +x ° '
"f ^(_fti^i_){los^±L + »/ + i-^}-r i y l (_PA__)^±i i 2
< l (" C-^TI) - H ^ T ) ) .JIS. Sr ^ <• It follows that
P+ y
+ o(
c 2
s3±
).
Mog *loglog*/
Thus we have the theorem. Theorem B2. Let 2 < « < ) 3 < 15 be two given numbers. If there exist two non-negative and non-decreasing functions A(z) and
80 371
A(z) (0 < z < 15) with the property that each has at most a finite number of discontinuities, such that Pu(x, q, XW) >*(«) - ^
e
+o(
log x
) (0< *
*>*
(12)
Mog x log log */
and P-(*, q, xVz)< AGO £«£- + O ( log x
/«»*
) (0< * <15), (13)
''log a: log log x/
where the constants implied by the symbol " O " are absolute constants, then [0, = \
AI(«)
if 2 < « < r ; f8 -i
z
J a—l
. , 2
(14)
Z
and ^li(«) = A{&) -2 f8"' A(») iL±J-rf«, J«-i
2<«<j3<15
^r*
(15)
have the properties of the functions A(z) and A(z) respectively. Proof. Let n = [v/log^r ] and u, = « + ^ ~ " / (0
The
w
difference of P»(x, q, ps) and P^x, q, pr+J) is the number of integers satisfying the following conditions l^ra^tf,
Let
TJE=0 (mod q),
(1 < « < r) ,
nE£= a; (mod pi),
n ^ ^/ (mod pi)
» = cr+i (mod f r+1 ) (c r+1 = ar+1 or ^>r+1) .
(16)
and 3«, ^; W, %Y> (KKr),
(Sr)
where a(r), 2*r), a,(r), ^,-M, S/M and £/ r) denote the solutions of the congruences mpr+i + ar+1 = a (mod q) , wp r + l + * f+1 = o (mod ) , mpr+i + ar+i = a,- (mod />,•) , »j/>f+1 + a r+1 = */ (mod />,•), mpr+i + i>r+: = <*/ (mod />,),
and wp r + 1 + *r+i = ^« (mod pi)
81_ 372 respectively.
Hence {P«-r(~ , q, Pr) + P= r (— , q,Pr), if Pr+l+yl
P«(x,q>Pr) — P«(x,q,Pr+D<\
. \P<*A-JL—, q,pr\ , V J I Pr+l _I_
1
If the primes in the interval x " Pl
< xv-,+% <
/+1
if pr+1\y .
< p < x"'
are
< . . . < ^ < ,4/-, <
fl+1
?/+i ?
then PM(*, , x«/-,+i)_pM(x, ^ x"-/) > 2
+ o (*
1-J_
P u , (-iL , ^ , ;,,._,)
»)
>2A(«,-1)*
£i
^
2 l
+ pf
2
j _ p log x/p
c x
2
"
Vlog log .v _ i _
-
)
j ^ _ p log2 *//>/
, 14
> 2A(«, - 1) ^ ^ (log t^±^-1 lOg^X \
«,_!
+ of^a) + o ( — £ ^ Mog3x/
+ _i
-J:—)
M; — 1
«, + 1 — 1 /
(log*'*' ~
Vlog 2 xloglog* V
x
+ _J
«/— 1
«;—1
JL_^ « J+1 — 1 / / '
Hence
p-c*,«?, * v o - p-(*, , ^ ) = "i! (p.(«, ?, * ^ ) - p.c*, <7, x^)> \J«-i
sr2
/ log2x
Vlog"x/ +
O(
So* ) Mog 2 xloglog*/
82 373 This proves (15).
In the same way we have (14). § 6.
THEOREM C
Let 2 =SJ y < x be two given integers. a,
q;
(» =
a;, b;
Let
1,2,---)
(a>)
be a sequence of integers satisfying the following conditions: 2I<7J
<7=,O(l);
otherwise
a,- ^
^
Pi\y>
then
£,- (mod />,)
a; = (; =
b{ (mod />,-),
1, 2 , • • • ) >
(17)
where 2 < px < p2 < • • • are all the primes not dividing q. Let 15 > ? > « > 1 be two given numbers. set of integers n satisfying the following: 1 ^
X,
» ^
n == a (mod ^ ) ,
n ^ a; (mod £>,-) ,
n^ a1+j (mod pl+j) ,
n^. bi (mod p,-)
(1 < « < f ) ,
(1 < ; < / — s) ,
n ^ b,-fj (mod pl+j)
where p , < xu" < p , + 1 and />» < xu" < p , + 1 . of SO? is denoted by M(x, xl/% xVu).
Let 93? denote the
(18)
The number of • elements
The purpose of this section is to prove the following Theorem C. The number of elements n of 9H satisfying most m of the following congruences n =. c,+j (mod />,+,-)
(1 < ; < / — s , c J + i = a,+i or b,+i)
at (19)
is not less than '^'
lm+1 J«-i
\g + lJ
z2
/log 2 *
Vlog'xloglog*/
The proof of the Theorem depends on the following two Lemmas.
Lemma 7. M(x, x1", x1'") = Pa(x, q, xv') + O (x1") + O (xl~v') .
Proof. P u (*,? ) * 1 ")-M(*,* 1 ",* 1 / ") y « - / (. «<* "="/+/ ( m o d » J + / )
»<* J »^» / + ,('»oJ * J + f - )
83 374
Thus, the lemma follows. Lemma 8. There exist two sequences of integers (&>;) and (5,) (1 < / ' < / — s) such that the number of elements of SDI satisfying at least / congruences of (19) is at most
-f { 2 P - ( — > , ^ + r s /(—, , *1")} + o&-*"). Proof. For l^j^ts, satisfy the congruence
let Tj be the subset of 3Dt whose elements
n = c,+i (mod £,+/)
(^+; = «,+/ or i>s+j) .
(i) If />,+/1 y, then aJ+i^bJ+i (mod p,+i). the solutions of the congruences at+j + mp,+j = a (mod ) , < a,+> + ?»?,+/ = a; (mod p,) , aJ+j •+• mps+j = 3; (mod />,-),
(20)
For 1 < / < s, we denote
(1 < i < (7) , (1 < m <
?/)
,
(1 < m < /?,) ,
by a(i), aiU), biQ) respectively. It is evident that a^ = b\n (mod pi) for /7,-|y, otherwise a^^b? (mod />,•). Let
, q, x1/v) . Then the number of elements of Tj is at most Z3.,, ( ' \ P
bJ+j + mpj+f = a (mod
( 1 < » » < ^ ) J
^ / + / + nipj+j = a,- (mod pi)
( 1 < w < /»,•) ,
. ^ + / + mp,+l = *,- (mod />,-)
(1 < m < />,•)
by 2 0 ) , 5, (/) , ?,-(n respectively. Let 2 ( ' \ q; ~aP; IP. Then the number of elements of F,- is not more than
(«,)
84 375
P"i ( — , <7, *"') + P*, (—
, q, **") .
Since pJ+i > xv", therefore
If the element' of SDt satisfies at least / congruences of (20), then it belongs to at least / different sets T,-. Hence the number of elements of 3K satisfying at least / congruences of (20) does not exceed
| { 2 (P., (— > i, *») + P3| (—,«, *»)] + | 2 r~,(—.i,*") x
t i
/>/+/
'
= 4 " 2 (P-, ( - ^ - > > * v ') + P*, ( — > > ^1/K)) + o &-1"). Thus, we have the Lemma. The proof of Theorem C. It follows by Lemmas 7 and 8 and Theorem Bj that the number of elements of 9H satisfying at most m congruences of (19) is not less than
Ps+i+y
' V Ps+i
//
= p. (—, -?, ^") - -4rr 2 (P., (-^-, ^ ^ ) + p S/ f_£_ , ^, «i/")) + o (*1~1/0 + O (a"")
+ 0(
So*
).
MOg 2 * log log AT/
_ ^ _ _ _
85
376
Thus, we have the Theorem. § 7.
THE PROOF OF THE MAIN RESULTS
Let A(«) and A(a) (0 < « < 10) be two non-negative and nondecreasing functions with the property that each has at most finite discontinuities such that A(«) ^f
+O(
log x
-) < PB(*, q, *"')
/*>*
Mog x log log xJ
e < A(a) ^f+O ( »* ) (20) log' x Mog * log log x/ holds uniformly in («) and a. Denote these functions by Ao(«), Aa(a); Aj(«), A^a); — . Let x, = 3.5 + 0.01 i (0 < / < 210) and *210+I- = 5.6 + 0.1 / (1 < i < 34). For sufficiently small e, we have A(Xi) (0 < / < 232) by (6), (8) and (10). By the use of ByxuiTaS's methods and his estimations of A(10) = 100.02073 and A(10) = 99.98181[5>6), we have A(x,) (233 < ;' < 244) and A (A:,) (0 < / < 244). Define
f A0(x)
— A(xi+1),
if
x; < x <
I ^(*)
= A(*,),
if
Xi < AT < «:,•+!.
xi+l;
Now we list the values of Ao(*) and A0(x) for integers: a Ao(a)
10
9
99.98181 | 79.78469
ylo(a) 100.02073
82.7207
8
7
I
6
5
60.88817 j 43.51554 j 26.70925 68.52511 I 54.39352 43.0082
4
9.18109 34.89666
0
(21)
29.39023
Divide the interval («— 1) < x < (jB—1) into « sub-intervals «,•< x <«,-+]. Since A(a) and A(a) are increasing functions, hence 1
A(z)
\
A(z)
-—
— dz,
and
J'-i
Take aI+, — «,• = 0.01.
T~
— dz<. 2L Mtts+O sr
,=t
J"t
dz
-
s
It follows by Theorem B2 that
c r | l O 9 8 7 J 6 ••• j 0 < a < 5 . 5 3 Au(a) 99.98181 80.892035 63.59931 47.471252 31.004145 ••• j — Aa(d) 100.02073 j 81.11841 j 64.4031491 50.529826 41.01897. ••• j / l u ( J ! ) = / I « ( a )
(22)
86
377
I.
Let x = y be an even integer. Let <*=1>
9 = 2;
a; = 0, bi = x (« = 1, 2 , • • • ) .
(w.)
Let /»,- be the zth odd prime, (i)
By (21), we have
P^*, 2, «") - (i- P A, M M ^ - <**) - ^ V2Ji
\« + l/
/ log2*:
^
+ o(—~^—) Mog x log log */
> (60.88817 - A- U ( 7 ) P iL±_lrf«+ yio(6.4) P - ^ ± 1 - ^ z
+ ^co r ^ * + M5.4> p *±i A +4,(4.5) r *±i j , r ^ ^ J2 2T2
+
0(
Jl.21 2T2
Jl
z1
i
log 2 ^
^ ) ^log AT log log * '
> 0.56125 - ^ - + o(—-^^ ) >3 log a: Mog x log log x/
for x > x0. Hence, It follows by Theorem C that for x > x0, there exists an integer n such that 1 < n < (x — 1) and n(x — n) have no prime divisors < xus and have at most 3 prime divisors in the interval xm < p < xu\ Hence, «(*—•») is a product of not more than 5 primes. Since x = n + (# — «), thus we obtain (a, £), where a + b < 5. (ii) By (21), we have
> {26.70925 - -?- U(5) P f<
+ 4,(4.8)
^
*4-1
J 4.6/1.4
£ + 1 ^ + 4,(4.6) JJ2
^ + A.(4.9) p " ' 1 £ ± i ^ f4.6/1.4 ' 4 . 1
J 4.4/1.6
f4.4A.6- 1 1
i±i*r + ilo(4.4) Jf2
•
J 4.2/1.4
iiirf. ^
1) Here, we use the following simple fact: If g(x) is a non-negative function and / ( * ) is a .non-negative and non-decreasing function in the interval a ^ * *S i , then
PtfCO/OV* < /CO P ,«(*) <** + /Cof^C*)'* holds for any a < (c - <J) and e < *.
87
378
for x > xQ. Hence, we have (3.3). (iii)
By (22), we have
1
\ 3 hn
) log2 x
z2
\z+V
Mog2 x log log.tr/
4.5+o.ttty+o.m
> (1 (8) - 128 y >iu(4.5 + 0.02y) r^-o-^-o^ ^ W s» V" 3 y = 0 (4.5 + 0.02y)2 J"4,5+o^y ^+l/log2^ 3.5-0.!Cy
+ of
£^—)
Mog * log log AT/
> o.43 - ^ ^ - + O ( log *
^^
) >3
Mog x log log */
for x > x0. Hence, we have Theorem 1. II.
Let x be an integer and y = ^ be a fixed even number. Let a=l,
q = 2;
ai = 0,
Let /?,• be the /th odd prime.
b,- = - £
(* = 1, 2 , • • • ) .
(«»2)
By (22) we have
\3 J9/7 \z + l/
J log2*
z2
+ o( * ) > 0.43 -&tfL + O ( _ _ ? ) Mog2 a; log log x/ log * Mog A; log log xJ > 0 . 4 - ^ ^2 log * for x > xa.
Hence, it follows by Theorem C that for x > #0> there 2
\ - integers n in the interval 1 < n < x such log2* that «(« + ^) has jio prime divisors < x1/a and has at most 2 primes in the interval xm < p < / / w . Thus we have Theorem 2. exist not less than 0.4
III.
Take x = y be an odd integer. a = x — 2,
q = 4;
a; = 0,
Take
£,• = *
0"=l,2,---).
(.^3)
1) It follows by ByxiHTa6's"J result that ——~— is a decreasing function in 5.53 ^ z ^ 10.
Since ^ O ) = A W for 0 < 2 < 5.53, henc. Jbj&L < ^ - | ^ ° 4.5 + 0.02j; < 2 < 4.5 + 0.02y + 0.02.
o
f f
for 0
88
379 Let pi be the ;th odd prime.
By (22), we have .
\3J9/7
+ o(
/«*
\2 + l /
22
/log2*
)>3
Mog x log log #/
for x > x0. Hence, it follows by Theorem C that for x > x0, there exists an integer n such that 1 < n < x — 1, 2\n(x — n), and has no prime factors < x1/s and has at most 2 prime factors in the interval xm < p < x1/u. Thus, we have Theorem 3. § 8.
OTHER APPLICATIONS
I. First of all, let us state the grand Riemann hypothesis as follows: The real parts of all zeros of all Dirichlet's L-functions L ( J , x) are «SS —. (Ji) 2 1241 From (R) we may derive the following : Let (\, I) = 1. Then
0=/ Imod *)
where li x = I
J* log/
and the constant implied by the symbol " O "
is an absolute constant. Assuming the truth of (/?*), we have118'251 the following: 1°. Every large even integer can be represented as a sum of a prime and a product of at most 3 primes. 2°. There are infinitely many primes p such that p + 2 is a product of not more than 3 primes. 3°. Every sufficiently large odd integer can be represented as 22V + 1 = p + 2Q, where p is a prime number and the number of prime factors of Q is at most 3. 4°. Let Z2(N) be the number of twin primes (p, p + 2) not exceeding N. Then
z 2 (N)<8n 2 ( 1 -(T3i)i) 1 -^ + o ( l o g J i V 1 ^ l o g i v)-
89 380
II. If F(x) denotes an irreducible-integral valued polynomial of degree ^ without any fixed prime divisor, then we have126'271 the following: 5°. Let n(N; F(x)) be the number of primes represented by F(x) as * = 1, 2, — , N. Then *(2V; F W ) < 2S to - ^ - +o(-2-) log TV
VlogZV/
,
w h e r e the constant fiP and the constant i m p l i e d by the symbol " O " depend on F(x) only and y denotes E u l e r ' s constant. 6°.
Let B
_I*
*
+ 1
if
»
l * + «/,
K*<5;
if
k>5,
where w is the least integer satisfying ,
1
-^ 5.64527 ,
U> + 1 ^
3.65 , 1-
5\ — w log
i
• .
4.8396 4.8396 w+5 Then there are infinitely many integers A: such that F(x) is a product of at most n primes. III. For the problem of the distribution of consecutive almost, primes, we have1271 7°. For sufficiently large x, there exists always a number (i) in the interval x — x10/u < n < x with at most 2 prime factors; (ii) in the interval x — *20/49 < n < x with at most 3 prime factors and (iii) in the interval x — xv$ < n ^ x with at most 6 prime factors. 8°. Let v be a positive integer. Let w be the least integer satisfying the inequality 4.8396
4.8396
w+ 5
Then for sufficiently large x, there is always an integer between x — xl/' and x which has at most \ = w + v prime factors. REFERENCES
[ 1 ] Bran, V. Vid.-Selsk. S\r. 1. M. N. KL. 3, 1—36. [ 2 J Rademacher, H. 1924 Abh. Math. Hamb. Univ. 3, 12—30.
90 381 [ 3] [ 4] [5] [ 6] [7] [ 8] [ 9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27]
Estermann, T. 1932 / . reine Angew. Math. 168, 106—116. Ricci, G. 1937 Annali della R. Scuola Normale Superiore di Pisa (2) 6, 70—115. ByxniTaS, A. A. 1938 MameM. c6 , 4(46), 375—387. . 1940 fiAS GGGP, 29, 544—548. TapTaKoBCKHH, B. A. 1939 RAH GGGP, 23, 122—126. . 1939 RAH GGGP, 23, 127—130. Kuhn, P. 1942 Norsfc Vid. Sels^. Fork. Trondhjem 39, 145—148. . 1953 Tolfte Skandinaviska Matematikerkongressen, Li:.nd. 160— 168. . 1954 (Sept.) Abstract from the Proc. Inter. Math. Congress, Amsterdam. Selberg, A. 1947 Norsfc Vid. Sels^. ForAdi. 19(18), 64—67. . 1950 Proc. Inter. Congress Math. 1, 286—292. . 1952 Den 11-te Skandinaviska Matematikerkongress, 13—22. Wang, Y. 1956 Ada Math. Sinica, 3, 500—513. BHHorpa,uoB, A. H. 1957 MameM. co. 41(1), 49—80. . 1957 MameM. c6. 41(3), 415—416. Wang, Y. 1957 Science Record (New Ser.), 1, ( 1 ) , 9—12. . 1957 Science Record (New Ser.), 1, (5), 15—20. . 1958 Acta Math. Sinica, (3), 413—429. Shapiro, H. N . & Warga, J. 1950 Comm. Pure Appl. Math; (3) 153— 176. Hua, L. K. 1955 An introduction to the theory of numbers (in Chinese). ByxuiTaS, A. A. 1937 MameM. c6. (2), 1239—1245. HyaaKOB, H. T. 1948 RAH GGGP, cepun MameM. (12), 31—46. Wang, Y. 1956 Acta Math. Sinica, (4), 565—582. . 1957 Prog. Math. Academia, (3) 416—426. . 1957 Science Record (New Ser.), 1 ( 3 ) , 1—6.
91
SC1ENTIA SINICA Vol. XI, No. 12, 1962
MATHEMATICS
ON SIEVE METHODS AND SOME OF THEIR APPLICATIONS* WANG YUAN (3£
56)
(Institute of Mathematics, Academia Sinica) 1.
STATEMENT OF RESULTS
In this paper, we shall give the detailed proofs of the following three theorems (cf. [ 1 ] ) . Theorem 1. Let F(x) be an irreducible integer valued nomial of degree ^ without any fixed prime divisor. Let j k + l , if »= i •• \ + w, if where w is the least integer
poly-
1<*<5; k>5,
(1)
satisfying
, . ^ 5.64527 , 3.65 , 5\ — u> /-,\ w + 1^ + log —i (2) 4.8396 4.8396 w+ 5 Then there are infinitely many integers x such that F(x) will be a product of at most n primes. Theorem 2 . Let \ be a positive integer. Let n be an integer satisfying (2) and (2). Then for sufficiently large x, there is always an integer between x and x + xVK which has at most n prime factors. ber
Theorem 3 .
For sufficiently
large x, there exists always a num10
( i )
in interval x < m < x + x" with at most 2 prime
factors;
20
(ii)
in interval x < m < x + xA9 with at most 3 prime factors; and i
(iii)
m+
in interval x < m < x + x *
with at most 103 prime
factors.
* First published in Chinese in Ada Mathematics. Sinica, Vol. IX, No. 2, pp. 87—100, 1959.
92 1608 No complicated numerical computations are needed in the present paper. As to the history of the above problems, we refer to Brun [2 \ Rademacher t3 \ Ricci[4] {5\ Kuhnf6:i t7] and /IHHHHKCS). In this paper, p, p', p", • • •; pi, p2, • • • denote primes. 2.
SEVERAL LEMMAS
Let F(x) be an irreducible integer valued polynomial of degree £ without any fixed prime divisor. Let ">(/>) denote the number of solutions of the congruence FW=0(mod?), where p>\-
(1 < * < p ) ,
Let a>(«) = JJ ^(p), where n is a square free number tin
and its prime divisor is always greater than \. Lemma 1. According to Nagellw RGO = 2
*
SM-
2
K
^^^-logf = log^ + Oil), P
^-~logJog* + p, + o(.J^), Mogx/
P
*
P /
loga;
Mog2*/
where pF, f*-F and the constants implied by the symbol "O" depend only on F(x). Lemma 2 . / / n is a square jree number and its prime divisor is always greater than ^ and if &>(«)#0 and / ( « ) = J J /(/>)> where
2 P\»^t>k
^
= «flog* + o(log*),
93
1609
where «* = H
IJ 7
1
(
«#
V TV
symbol "O" depends only on
F(x\
Proof. Since «*(/>) ^ ^ and n is a square free number, therefore OJ(«) <^CCn)==O(«e)j where £ ( « ) denotes the number of prime divisors of ft, e is any given positive number and the constant implied by the symbol " O " depends only on e and F(x). Since the series V1,
—, A / is absolutely convergent for s>0, hence we have
PI" ^ p>k
fl--^ v
p ;
On the other hand, let a(s) =
^J p\n
for j>0.
"^TT"'
^ p>*
Hence « ( » = a F log ar(l + 0(1)).
(Cf. [10]).
(I-A) 1) It follows by Mertens' Theorem that =
p
Ttlcn
TI
-.
n (»-})
7-^rr = lim -~
pr • Hence af = (_er ^ F ) ~ l , where T denotes Euler's constant.
jr-^-
=
94 1610
Lemma 3. Let l < a < | 3 be two given numbers.
Then
where the constant implied by the symbol UO" depends only on F(x). Proof. It follows from Lemma 1 that R(») = log* + ?•„,
rn =
O(l).
Hence ^ l
*
^
=
2!=
>p
u>{p) _
l
^
logn-log(«-l)+
E
r
^
- ~ r - ; = Z i + Z»;
—-+o(*^) =
= f^
^
+ O (x'hllog * = J2S*-) = V
J ^logdog^ =
R(n) — R(n - 1) _
I logArJ a -i
Vlogx
h O (,*• P J = 2
inlog 2 /!/
*
+ i ;
log-1log* «— 1
Vlog2^/
hO(i:
p
;,
Vlog2*/
Thus we have the Lemma. 3.
Let Si= 2
\-i"\ {l^i^m), m
exceeding \.
THEOREM A
w h e r e q1} ••-,<]*
Let X = I I <#+1 and
are a l l primes not
95
1611 K a , - , •••Jaf«{f.)
a, K;
(« = 1, 2, • • • ) ,
(a))
be a sequence of integers satisfying aih is= aiJ2 (mod p,-) (ji^j2), where pi
(1 < i < r)
has an unique solution in the interval K n < p ! ••• pr. Denote this solution by «,-. Hence P»(x,g) is equal to the number of integers satisfying the following conditions 1 = ^ « = ^ * , « = a(mod K) , (n — ai) • • • (n — o^) ^ 0 (mod pi)
(4)
(K^
Theorem A.
Let c>0, P~±i
p-(*, e) <
holds uniformly
y
pi. 2/
N
g\rt)
Pi"
square free number
«(») = 11 <*(p)*0p\n
+ o(^iog6*f)
in (<«>), where g ( l ) = l ; g(p) = —~—for «>(p)*eO and
p>\; and £(«) = II i(p)> fW^-rr
Proof.
Then the estimation
and its prime
II (l~g(p)) f°r
n
being a
P\«
divisor all greater than \,
Let
(or, » ) = 1
with
96 1612 w h e r e n\P
and S =*J "^. ~77~T~ • ~, 1\.n)
Then
n\P
p-(*,o = =
where {dud2}
E
K
"<*
JLJ
2_i
<
<<2|P
^h2
I
E
*
rfi(n-ai)—(ii-a.)
I
1 =
2_j Wi, <s)|(»—«i)—(»— o^)
— * V
V
— T7
ZJ
ZJ
E f
n<*
1 3 A
'IA',
U)({^i, ^2}) , r ,
7T
H
denotes the least common multiple of dx and d2.
=
E d|P
Since
for »IP, hence
*
r\T
/wi l
E <(|n|P
^00 r. '
97 1613
Then
ll«r
; y vl«r n (i - })J j
= o (log2* e • ( S ^ T ) = o (log2** • ( £ < * « ^ )2) =
where ^(n) denotes the number of divisors of n. Thus we have the Theorem. 4.
THE ESTIMATION OF THE UPPER BOUND OF P»(X, f )
Let £>K. Let / < c < / + l, where / is a positive integer.
+ c- D'
i
y
f<,.rU/oo---/(p<'>)
v
M2(^)
^., ( / ) /(»)•
J_
1°.
Take € = T~1T log* x
v «(P)#0
ior
-L- - y »(P)#0
M
K^<2-
Denote 2c = d.
Since
^> = v
">2(^)
(±\
»(P)#0
therefore from Lemma 2, we have
"•I*1
t».K)=l
"(P)#0
(m,K)=I
=< (2^ — 1 — clog<:)«Flogf + o(logf).
= o
Then
98 1614 Hence it follows from Theorem A that P-Gr, **) < P u (x, -^—) < 6
+ aFK [d — 1 — — log — logS V 2 2/
+ c (-?-) = A(d) -&*- + o UL.Y \ log xJ
K log x
(5)
V log x'
where the constants implied by the symbol uo" depend only on F(x)> and A{d) =
d-i-AiogA
2
er (2 < d < 4).
(6)
2
I
2°.
x*
Take f = -—rrfor 2<£-<3. Denote 2c — d. It follows from 5 log **
Theorem A that for any given e > 0, there exists a positive constant .r0 depending only on s and F(x) such that (5) holds for x>xe and ^
A(d)= J
1
* 1
d
d — 1 — — log 2 2
,T ( 4 < K 6 ) ,
-— .
s
( d
(7>
\
h8I— — e \ 2 /
where *(0 = Km
E
^ ^ 4 ^ log ^1/log?
( c >2).
(8>
"Cpp')#O
By the same way, we have the expressions of A(d) for d>6. 5.
THE ESTIMATION OF THE LOWER BOUND OF Pa(x,
?)
For simplicity, we denote PM;pi,
• ••,Ps)=
S
l
l
> ?"(^) = ff=
2
!»
1<*<«aimod d)
where aijx^aiu (modp;) (/i^/z), k
99 1615
Theorem B. The estimation ?FX + o (
—
6 5
x
\
Mog2*/
P«{x, x - ) > 6.4524 Kiozx
holds uniformly in («), where the constant implied by the symbol "O" depends only on F(x). Before the proof, let us state the well-known lemma. Lemma 4 . Let r > rx > • • • > rn > 1 be a given set of integers. Then PM(*, f) >^E - R, where ^
1
y
;
"
-+-
P"
y> ,
/
" • " ~r
i
<-
• •
P°Pp
2 »+ 1
2-j 2-j 2-i 2-i'''
«< r ^
2-i
"<,•„
papB-'-pu.
12 = (l + ^r)(l + ^ r 1 ) 2 - - - ( l + ^ r j 2 . The proof of Theorem B. Let e > 0 be a given sufficiently small number.
Let h = —~ + e. Then there exists 0(>^) depending only
on e and F(#) such that 2
»&- < log (A + e) < 0.452 = r ,
TT ( l - JUizlY1
<
1.572 = jl,
for 5>5 0 . Let pr—pr^ be the greatest prime not exceeding x65. If 2 < / M ^ i
. * + l, then -p,m denotes the greatest prime not exceeding **-5 *m~l, where pr,+l
has the property that P*l+1<8o
Let n be an integer such
100 1616
that 2n>2t + rt+1. {11])
Let pTm = pTf^t
+ 1 ^ m <«).
Then we have (cf.
PM, g) > (i - i : A "T* + H T] -) - n (i - ^) + V
^
(2» + 4) !
35
+ O (*
+
o
p.
/
M>
> (1-0.0073193)— > 6-4524^ ^riogx
/ X ,'J, V
IT
fl - J ^ " N ) + O f-^-^ >
/_*_\ \io g 2 x/'
Thus we have the theorem. 6.
Two THEOREMS
Let A(a) and ^1(«) (0 < « < 6.5) be two non-negative and nondecreasing functions such that
A(«) -BE*- + o (_L_) < p . (,, J ) < A(«) - f £ - + o (_iL_) (9) K log *
\ log x/
K log ar
\ log xf
holds uniformly in (w) and a, where the constants implied by the symbol cto" depend only on F(x). For the existence of A (a) and A (a), see §§4—5. Theorem Cx. Let A(a) and A(a) (0
f A(/3) - f"1 AGO — ,
r
and Aj(a) = A(JB) - ( ^ A(«) — , ^flftf /^tf ^»« properties respectively.
a O < 6.5
as those of the functions
A(a) and A(a)
101 1617 I
65
Proof. Take x such that x ' >\.
Now, we estimate the lower
ia
i
i
bound of P»(x, x ). Arrange the primes between x" and x" as follows: I i P, < X5 < p,+i < " " • < pr < x" < p,+l.
Then Pa(x, xJ) =Pu,(x, p,) and Pu(x, x~°)=P»(x, pr). i
i
If ;*r >, + i<* a , then the difference between Pa(x, pf) and P u (*, /7J+i) is equal to the number of integers n satisfying one of the following conditions: 1 < n ^ x, n = a(mod K), n ^ a,-;(mod p,) (1 ^ i ^ s, 1 ^ ; ^ w(p,)), » — «/+i; (mod p i+1 )
( 1 < / ^ w(p J+ i)) .
For l ^ i ^ j , \^K
K7<w(p / + i), each of the following
™ps+i + a,+\j = a (mod K) rap^+i + as+li = a,7(mod p,)
has an unique solution. spectively. Let
(10)
(1 ^ m <J K) ( 1 ^ m ^ f>,)
Denote these solutions by asi and aljit re-
asj, K; asjil{i. < i < j 3 1 < ; < o>Gvn), 1 < / < £<>(?,•)), a,+i;(l < / < <»(p,+l)).
(a>f/)
Then it is evident that the conditions (10) are equivalent to the following conditions: 1 < m < * ~ a'+li ,
m
= asi(mod K) , m H S,,;/(mod pi)
Ps+i
( K * < r , l < ) < « ( ? r t i ) , 1 <«(?/)). Hence P-(x, ?,+i) = P.(i, ?,) -
2
"^y I" x
/=i
=•/»-(*, p,) - 2 P-(x, Xs) = PB(», x?) - 2
P
2
P
^ S P*) = P,+i
-,/(-^-»P0
'
+ o(i),
P - . , ( — , p.) + O (xs).
(11)
102 1618 Let n = \-\/log x ], u, = a H Lemma 3 that
TI=
— / (0 < / < « ) .
Then
it follows by
n
S
2>-.,(—^ '°g n+t
<
S'-,(T--(T L -)
s I
<
+
<*'"'^
1
£ -i-
+O
-L
A(«m - i) *^£^- + o (x K^log—
I
S -L-
^^-\< -L ?log —i
< 4(«1+1 - 1) - ^ l o g ' i - ^ i + o (_L_log!Ji±Llli) + O ( - ^ - ) . Klog.v Mogx «/ — 1 / Mog^x/ J(/ — 1 Since
«/ — 1
TTa
Ja
~1
w
= g f"'+1"1 (A(»m - 1) - AGO) ^ < < 2{A(«,+1 - 1) - A(«, - l)}log^±i^i < /=o
<
max
«/ ~ 1
log "'+1 ~ 1 g U K . - 1) - A(«, - 1)) =
-°(-r=)« Vlog* y therefore
P.(*, O > P-(*a xh - S 7/ + OO") ^ > A O ) r ^ _ + O(_L_) _ g A(«/+1- l)log?^±^ •
103
1619
. _i!£fi_ + o (_fl_ V i^imziS] Wog* , = 0
Klogx
\
J «-l
+ o (-?!-) ^ Mog 2 */
«/ — 1 /
i< / log X
V log XV
Define AQS) - f " A(«) -^-, if AO) - T 1 A(«) - ^ > 0; J"—1
«
o, if AO) - r
i
Jo—I
tl
A ( « ) — < o.
J o—1
U
Hence Aj(a) satisfies the left hand of the inequality (9). The other hand of the inequality (9) may be proved similarly. Theorem C2. Let l < a < | 3 ^ 6 . 5 be two given numbers. the inequality
i i i ^
p
'VpJ
/
VJ—i
V* + 1/ * /Klogx
Then
VlogJ
/^o/«/y uniformly in (api), where A(z) satisfies (9) and the constant implied by the symbol "o" depends only on F(x). Proof. Let « = [ v V T * ] , «, = a + ^ i : : £ L / - l ( 0 < / ^ » ) .
tog*
,"'+I+1
\« / + 1 + 1/K log a:
u,
Mog2*-/
\log*
M/ /
Then
104 1620 Hence
i
i /- t
;_0
KlogX
<([
H
\J.-i
A
'
/
^P
\z< ;+1 + 1 /
1=0
MOg2*/
«;
(Mii)j-_
\« + 1/ z/Klogx
+ o
MogX , = 0
K,/
fM
\logxJ
Thus we have the Theorem. 7.
THE SET 3Jt AND SOME OF ITS PROPERTIES
Let 1 < a < ^ ^ 6.5 be two given numbers. of integers satisfying the following conditions 1 ^ n ^ x, n = a(mod K),
Let 3DT denote the set
n ^ a, ; (mod /»,-) (1 ^ «! ^ s, 1 ^ / ^ o>(p,)),
« ^ a J+lV (mod ?J+I-,-) (1 < i < r — j , 1 < / < w(pt+i)) i
where pt^x"
i A
p,<=x"
(12)
The number of elements of 3Jt is
denoted by M(x, x", x"). The aim of the present section is to prove the following Theorem D. Let A(«) and A(a) ( 0 < a < 6 . 5) be two functions satisfying (9). Then the number of elements of 9JI satisfying at most m of the following congruences n =flj+.vCmodpJ+i)
( K ; < w(^ + ,))
(13),-
w not less than V ^
OT+1
J«-l
\«+l/
2T / X log*
\l0gxZ
where the constant implied by the symbol uo" depends only on F(x). The proof of the Theorem depends on the following two Lemmas.
Lemma 5. P u ( * , * ' ) = M ( * , * ' , * " ) + O(xl~") + OCx'X
105
1621
Proof. P^x,x')
-M{x,x",x")<
2
Yi
TJ l
= o ( 2 -2) + o (s
I) = o (x -h
1==
+ o (A
u
«>x"
n^x
Lemma 6. There exist sequences of integers (w,-;) such that the number of elements of 3JI satisfying at least m congruences of {13) is at most , _ , »u>, +1 o
-! V m
<• = 1
**^
V p f— i = 1
V
Pi+r'
'
Proof. For l < i < « - i , let T; be the subset of 3K whose elements satisfy the congruences (13),-. Denote the solutions of the congruences ps+;m + as+n = a (mod K)
( l ^ m ^ K)
and pi+,m + as+il = aw(mod pa)
(1 < m < pa)
by 5,;(1 < i < / - s, 1 < / < <»(ps+!)) and 5,^(1 < / < ^ - s, l^y<w(/7 B )) respectively. Suppose we have 2,7, K; a,-^,
(l<«
w(pB)).
l^u<sr (w,/)
Evidently aimji H S,-Wl,(mod f>a)
for aap^aUVt
(1 < M < r)
(mod/7B). Hence the number of elements of V{ is at most
If the element of SOt satisfies at least m congruences of (13),-, then it belongs to at least m different sets T}. Hence the number of elements of 2R satisfying at least m congruences of (13),- does not exceed
The proof of Theorem D. It follows by Lemmas 5 and 6 and Theorem C2 that the number of elements of 3ER satisfying at most m congruences of (13),- is not less than
106 1622 1 1
1
U< " ^
x" *"") —
Mix
V
; >
V
/
P
x
r
I—
\
x" 1 =
= (AW - - J — f""1 A {-*!-) **-) -1&L- + o (-iL.). V
OT+
1 JK-1
\ « + 1/ z / j ^ l o g X
Vlogx/
Thus we have the Theorem. 8.
THE PROOF OF THE MAIN THEOREMS
Let A(a) and A (a.) (0
^£££_ + o (^LJ) ^ P^Xy J) ^ Klog.r
\\o%x)
_EI^ +
A(a)
K log A:
o
(_f_) Vlogar/
holds uniformly in (u») and «, where the constants implied by the symbol "o" depend only on F(ar). For the existence of A(a) and vl(«) see §§3—5. By the method given in § 3, we have the following table: d
5.5
5.2
/100
5.65
5.372
d
4
A(jT)
4.42
3.8
5
3.6
5.197 3.4
3.2
4.8
4.4
4.2
5.036
4.7085
4.56
3
2.8
2.6
2.5
4.288 4.161 4.049 3.941 3.848 3.76 3.6834 3.65
0<<^<2
. (H)
3.564
Then it follows from Theorem B and Theorem Q that A(5) > 6.4524 - f"il(*) — > > 6.4524 - A(5.5) ["-^L J5.2
2
A(4.2) T' 2 — > 4.8396. J4
0
(i) For ^ > 5 , let flj,', •••,«„(,.),- denote the solutions of the congruences F (y) s= 0(mod pf) (0 < y < pj)° 1) For the sake of convenience, suppose the congruences F(x) = 0 (mod p) and F^x") = 0 •(mod p) have no common solution.
107 1623
respectively, where k. < Pi < P2 < *' ' are all the primes greater than \. Let bP be the integer satisfying (0 < y <
F (y) ^ 0 (mod ,•) , °° r k i where S;=2u
anc
—T
^ ^ ^ ' * ' <«7»>^^ a r e a ^ t n e primes not exceed-
ing ^ . Denote the solution of the system of congruences y = bi (mod s#+1) ,
( 1 < *<»»)
by #. Let «, X; «„• (« = 1, 2, • • •; 1 < j < o)( ? ,)).
(5)
Then 9Jt is the set of integers satisfying the following conditions K n < x, Fin) ^ 0(mod qi) ( K i < m) , Fin) ^ 0(mod pi) (1 < * < s) , F(n) ^ 0(mod p\) (s < i < *). (15) If «/ is the least integer satisfying (2), then from the table (14), we have
S.4.S3P6
\-V A(-*1_\*Lw+ 1 J | \« + 1/ «
- yi(2) P
^ > 4.8396 - — L - (A(4) f - ^ +
5K-W
+ A(3.8) f3'16-^ + A(3.6) ( " *L + A(3.4) f " ^ + J2.57 i(
J2.12 «
Jl.77 Z
5
+ A(3.2) P *L + A(3) P- i l + A(2.8) f* *L 4Jl.5
«
Jl.27 if
Jl.08 J2
+ A(2.6) fU08 * . + A(2.5) f ^ - 1 - ^ 1 _ f^ Ji > 4.8396 -
«
J2 « J
5 64527
' 3.65 ^ 5 ^ - ^ ">+ 1 w+ 1 w+5
For x sufficiently large, | ^ - + o ( - ^ ) > ^ K log *
\ log x'
*. >
w+ 1 j5«±U_i z = 2)5
L
.
>
0
Then it follows
log *
from Theorem D that for AT sufficiently large, there are not less than integers y in the interval K J I < J ; such that F(y) has no prime
lo
1)
The existence of b; is duetothe fact that -F(j>) has no fixed prime divisor.
108
1624 X
X
divisor < xr and has at most w prime divisors in the interval x*< y < #5(*+l). Hence F(y) is a product of at most n — \-Yw primes. Thus we have Theorem 1 for the case \ > 5. In particular, take F(y)=xk + y (Ky<x). We obtain Theorem 2. (ii) From the table (14), we have
«5)-iK-fi)^>°' ««-T4<-TI)^>° and 5 JJS
\z + V z
Hence it follows from Theorem D that we have Theorem 3 and also Theorems 1 and 2 for the case ^ < 5 . Remar\. Making use of Theorem 2, but with more complicated numerical calculations (cf. [12]), we may refine table (14). REFERENCES [ 1]
Wang Yuan, 1957 On sieve methods and some of their applications, Science Record, 1:3, 1—5. [ 2 ] Brun, V. 1920 Le crible d'Eratosthene et le theoreme de Goldbach, Vid.Selsk,. Sly. 1. M.N.KL., 3, 1—36. [ 3 ] Rademacher, H. 1924 Beitrage zur Viggo Brunschen Methode in der Zahlen-theorie, Abh. Math. Hamb. Univ., 3, 12—30. [ 4 ] Ricci, G. 1933 Ricerche aritmetiche sui polinomi, Rend. Circ. Mat. Palermo, 57, 433—475. [ 5 ] Ricci, G. 1937 Su la congettura di Goldbach e la constante di Schnirelmann, Annali della R. Scuola Normale Superiore di Pisa, (2) 6, 70—115. [ 6 ] Kuhn, P. 1942 Zur Viggo Brunschen Siebmethode I, Nors\e Vid. Sels^. Fork. Trondheim, 39, 145—148. [ 7 ] Kuhn, P. 1953 Neue Abschatzungen auf Grund der Viggo Brunschen Siebmethode, Tolfte s\andinavisl(a M.atemati\er-}{pngressen, 160—168. [ 8 ] JIHHHHK, KD. B. 1950 3aMeqaHHe o npoH3Be,neHHH Tpex npocTbix «mceji, RAH CCGP, 72, 9—10. [ 9 ] Nagell, T. 1921 Generalisation d'un theoreme de Tchbycheff, Journ. de Math. ( 8 ) 4, 343—356. [10] Widder, D. V. The Laplace Transform, Princeton Press. [11] Wang Yuan, 1956 On the representation of large even integer as a sum of a prime and a product of at most 4 primes, Acta Math. Sinica, 6:4, 565—582. [12] Wang Yuan, 1959 On sieve method and some of their applications ( I ) , Acta Math. Sinica, 8:3, 413—429.
109
SCIENTIA SINICA Vol. X, No. 1, 1961
MATHEMATICS
ON THE LEAST PRIMITIVE ROOT OF A PRIME* WANG YUAN (3E
%)
(Institute of Mathematics, Academia Sinica") I.
INTRODUCTION
Let p be a prime number15 and g(p) denote the least positive primitive root of p. Let «(«) denote the number of different prime factors of n. BHHorpa^OB111 first proved that g(p) <2'V y 2 log ? ,
(1)
where m — <»(p — 1). The historical records of the estimations of g(p) £re as follows: g{p) < 2mp1/2 log log p of BuHorpaAOB121; g(p) < 2a+W~po£ Hua[31; g{p) = O(pU2 log17p) of Erdos1^ and g(p) =0(m'pm) 151 of Erdos and Shapiro , where c is an absolute constant. On the assumption of the grand Riemann hypothesis, Ankeny[yI proved that gCp) = O (2- log2 p log2 (2'" log2?)). (2) As to the lower estimation of g(p), Turan161 has proved that *O0 =Q(losp).
(3)
In this paper, we give in detail the proofs of the following two results (cf. [8]). Theorem 1. For any given positive number e, we have * t o = O (*."""),
(4)
where the constant implied by the symbol " 0 " depends on e only. Here the main order 1/2 is now replaced by 1/4+ s. Theorem 2. On the assumption of the grand TZiemann hypothesis, we have g(p) = oCm6 log2 p). (5) * First published in Chinese in Ada Mathematica Sinica, Vol. IX, No. 4, 1959. 1) In this paper, p, q, pi, pi, ••• denote primes.
no 2
Hence, the upper bound on (5) cannot be improved beyond O(m6 log p). I am indebted to Professor Hua Loo-keng for his valuable suggestions and assistance. II.
CHARACTER SUM
(I)
The aim of this section is to prove the following Theorem A. Let 8 < — be a positive number. exists a positive constant P(8), such that
Then there
2 zoo <-, holds for all p> P(S),
(6)
H> p1M+* and any integer
and X is a nonprincipal character modulo
N, where rj = — 6
p.
The proof of Theorem A depends on the following three Lemmas. Lemma l. [iU01 Let [p] denote the finite field of p elements. Let fi(x), ••-, fn{x) be different normalized^ polynomials, each irreducible over [p]. Let f^1} — , \n denote the degrees of these polynomials, and let K = \i + • • • + \n. Let X1} • • • ,Xn be nonprincipal characters of [pi with the convention #(0) = 0. Then
£ ZxC/iGO) • • • Z.O.GO) < ik - D A / 7 , x
where the summation is over a complete set of residues (mod p). Lemma 2. Let r be a positive integer, and h be a positive integer satisfying \
S&*) = 2 *o + «). m=l
Then 2 |SAO)|2' < O-ry-ph' + 2r
where X is a nonprincipal character modulo
p.
1) A normalized polynomial is one in which the leading coefficient is 1.
m 3
Proof. If X is a character of order d{> 1), then
si5Awi2'= 2 ••• 2 2 - i 2 « ( » + ».)--(* + %)) *
(7^=1
mr=l
» =1
»r=l
*
*((* + « > • • ( * + «r)). Divide the set of integers {m : , • • •, mr, «1} • • • , « , ) ( 1 ^ ? M , - < A , 1=S tij^h, K ; ^ r ) into two classes <7X and
each of {«iJ+1, — ? «;,)
^ ^w/^+i> — ? ^/V^ consists of at most ——•—
distinct integers, each occurring dl times ( / > 1 ) , where (i1} ••-,;',.) and (/i> —> fr) are permutations of ( 1 , 2 , • • • , ? • ) . The other sets are in <s"2- Thus 2
\SA(.X-)\2r= 2
2
+ 2 2
Z ( ( x + « 1 ) - - - ( * + « r ) ) ^ ( ( * + »l)---(*+»r)) +
x
-1
^((* + «!)•••(* + ™r))*((* + »i) •••(* + »r)) =
Since the number of elements of ^ does not exceed 2
r-inC.A'
'-«
l
"
J
2
l)
/it-H-r^]
<
;
\
»= i
/
= 4r6' 2 A'A l [ l 7 i ] <(2r) 7 'A', therefore
2j<(2r)V.
i = i
\
h —
^-) < 1
/
m 4
Also, we have
where Kl,
< h2'(2r — l ) \ / y < 2rA2rVT. Thus we have the Lemma. For any of the integers H > 0, q > 0, t and N, we define the interval l(q, t) as consisting of all integers z satisfying N+tp ?
<x
+ H+,p
(7)
1
Lemma 3. t n l Let q run through a set of distinct positive integers, Q in number, all satisfying qx
and all being relatively prime in pairs. Suppose that 2Hqt < p. Then (for given p, N, H) it is possible to associate with each q a set T(q) of integers t, with 0 ^ t < q, their number being q - Q, in such a way that the intervals l(q, t), for all q and all t in T(q), are disjoint. Proof of Theorem A. It follows by Polya's Theorem1121 that we may assume pyW
Suppose that
<
H
< pm+a^
(8)
113 5 for some N and H satisfying (8); we deduce a contradiction if p > For q < p, we have N+H
4-1
2 *(») = 2
»=AT+ I
r=0
N+H
1-1
2 zoo = 2 2 zoo.
n=N+ 1
t ~ 0 r^f(, O
Hence
2
2 z« >^.
C9)
Now we apply Lemma 3, taking the set of q to consist of all the primes in the interval (10)
pv<-£l
It follows by Ingham's Theorem"31 that the number of q is Q
= ^ 4 ) - JP™ - -4*) = i £ ^ l (i + oil)). \
Hence
2
2
p7 /
(ii)
log p
2 ZGr) >^-Ji2HQq-l>
where the summation is over all primes in the interval of (10). We rewrite the result as
2
2*0) >mz.
Since the number of I(q, t) is at most pwQ and
2 2 Z(* + ») = A 2 Z(») + 2 c^OT,
» 6 l m=l
r£f
BI=1
where |^ m ] <2m, therefore
2 2lS*(»)|>^-2P"W. Let
L 8p' J
C12)
114 6
Then
Since the number of integers in l{q,t) it follows by Holder's inequality that
is at most 3 p~u*H, therefore
Since the intervals / are disjoint, then
Combining this with the result of Lemma 2, we obtain (——YHQA 21 - < p(2ryrhr + 2rKj~Phlr.
Take r = [y] + l. Then
and
(i^r H Q k i r < 3r^h2r
(i3)
for p>P2{S) > Pt. v^n the other hand, it follows by (8), (11) and (14) that (13) is impossible for p>P3(S) > P2, in virtue of (l 4 ) S - 2rV - 2q = 8 - 2 (T—1 + 2 ^ > < 5 - i - < S - < S 2 > A VL5J/6 6 6 Thus we get a contradiction and this proves the theorem. III.
CHARACTER SUM (II)
The purpose of this section is to prove the following Theorem B. Let X be a nonprincipal character modulo p. Then, on the assumption of the grand Riemann hypothesis, we have 2 AGOZGO/^ = O(*" log p),
(15)
U5
7
where A-iri) denotes the von Mangoldt function. Proof. We need to mention the following well-known facts: (i) There exists Tm such that m < Tm < m + 1
and
y-(tr + iTm,X) = O ( l o g 2 ? ( | r J +1)) (l/3<
If l/3<<7<2 and \t\>\,
then
r « = o(*"»'" |r|- w ). (iii) have
On the assumption of the grand Riemann hypothesis, we y- (1/3 •+ it, X) = O(log p(|*| + 1)).
Hence, we have
r + '"rto*'— (*,*)* = o(x»f" ^ % 2 ^ ) = o(l) (asm->oo),
J
2+.T m
V
I.
J
rra
/
r
2 A(«)z(«)tf - = - -I__
p
1
= 2 * ro) + -^
f 1/3+ i oo
r w * ^ (,, z) ^ = 7
j
*rw ^ a, z) & =
= 2 * T < » +O(rv3log?), p
where p runs over all the nontrivial zeros of L(s, X). Since the
H6 8
number of zeros of L(s, X) satisfying n ^ y = J?(p) ^ n -t- 1 is O ( l o g p ( | « | + 1 ) ) , hence
2 xT(p) = O ( ^ 2
2
ITC1/2 + ,y) l) =
e^" Iog ? (n + 1)) = O(* w logp).
= o(xV2'Z Thus we have the theorem. IV.
SIEVE METHOD OF BRUN
If Q is a positive integer and (Q, px • • • />,) = 1 , then let us denote by P(Q> Pi> ' ' ' > Pt) t n e s u m °£ nonnegative numbers an, where n satisfies the following conditions: n > 1, ind n ^ 0 (mod p.)
(1 < * < s) , ind n = 0 (mod £))°.
(16)
Especially P ( T ) denotes the sum of ao, where n satisfies « > 1 , ind» = 0(mod T ) .
(17)
It is evident that P(Q'y pi, • • •, p,+i) is equal to the difference between P(Q> Pi> " ' > P') a n < i t n e s u m °f an, where n satisfies n ^ 1, ind n qfc 0 (mod fO (1 < * < s) , ind n = 0 (mod ^>) , ind » = 0 (modf>,+i).
(18)
Since the conditions ind n EEE 0 (mod ^ ) and ind n = 0 (mod pt+i) are equivalent to the condition ind n = 0 (mod Qps+i) j therefore we have P ( 0 ; ? i , • • • , px+i) = P(.Q;
pi,
••,
pi) — P(.Qp,+i;pi,
• • •,
pi).
1) If jr is a primitive root of p, then for any integer n in the interval 1 ^ n < p there exists a positive number a such that g« = B(mod p ) . We write a = indf n or briefly a = ind n.
117 9
Using this formula successively for r times, we get r
•••» pr) = P ( e ) - 2
P(Q;pi,
P(QP«;PU
•••,-?.-!).
(19)
Let r = r0 ^ rx ^ • • • > r, be any given sequence of t positive integers. that
Then we have by (19)
r(0; ft,•••,*) > P ( 0 ) - 2 P(ep-) + + 2
2 PiQp'p',;
pi, •••, p-x-i).
(20)
Using (20) successively for t times and observing that pCQp.p^,
• • •, p . , p p , ; p i , • • • , pt>,-D
< PCQp.,
•••,pfs,'),
we get PC.Q; pi, • • • > pr) > P(Q) - 2 P(ep-) + 2 2
- +
2 2
P(.QP«P^
2 + 2 - - - 2 PtQp.p.x, ••-, Pl>x
«<<• «l
-
(21)
If there exist M and N such that p(r)=^+oGv),
(22)
where the constant implied by the symbol "O" is an absolute constant, then we have by (21) and (22) that PCQ;Pi, ••-,Pr') >~--KR\N\
(K>0),
where
* =i-2|+22?V- + -"o>«!
- 2o
«>a!>...>p.
r r<
a
H8 10
and R
«<' °l
2
2-2K
"*ir a 1
0f
< r IT (1 + rd\ i=l
By the suitable choice of r, ru • • •, rt[W, we have
Lemma ^4. / / (22) holds, then there exists a positive constant & such that (SM
P(Q,;PI,
r
.
••-,Pr')>~Q"[\ U-—)+o(rf-*|2v|). ,=l \
V.
Let x=[p1M+t}.
p;/
PROOF OF THEOREM 1
Then we have by Theorem A that
!, z w -°(7) (f = 7>
(23
>
where X is a nonprincipal character (mod p). If q\p — \, then let us denote by Xq the character of order q for modulo p. We have by (23) that
2
l=72 2W=7+o(4
(24)
q
i»d n=0(mod 9)
Let q\P-\
q\P-l
Next, let N(x) denote the number of primitive roots not exceeding x. Then
*(«)=
2 1> 2 «<*
U<JT
(,i«d n,rt=l
(ind ». P j ) = l
I" 2 4lP—1
2 »<*
4 > l o g , ^ i»d ISO (mod 4)
1 = 2,-2,.
119 11
Hence, by (24) we have V
«IP-I
«>Iog2p
4'
X
«|p-i P ' «>log2p
Mogp/
Let fl, i £ « < x ; lO, if w > * . Then, it follows by Lemma 4 and (24) that
£,>** |T (i-i-)+o(iog^-4)> > , °* ( « > 0 , p>P 1 (e)). log log p Hence iV0O>£-^ log log p
O>0,p>P2(e)>PJ).
This proves Theorem 1. VI.
PROOF OF THEOREM 2
If d 1 p — 1, then let us denote by nd the residue modulo £, which satisfies «2 = 1 (mod />). Then
where 2 ' denotes the omission of the principal character.
Hence,
we have by Theorem B that
G-GO = 4 2 ^ ) ^ + ° OWl°g P).
(25)
120
12
By partial summations and MefibiiueB's Theorem", we have n
2
AMe~
< c*-»(e3 + l)x
Cc3 > 1) ,
2
A GO*"* < ffjcar, (c3 > 1) ,
(26)
n
(27)
and *Z A(fl)e~ > e-lcxx ( c 3 > l ) .
(28)
Let P=
IT
J] q,Px=
«IP-I
?(^4>2);
q\P-l q^Cttn log 4nj
and n n
where the summation is over all the positive primitive roots modulo p. Hence, it follows by Theorem B that N(*)=
2
= M GO -
2
A(n)e~>
(ind «» P)=l
il(*)^-
(ind»»Pi)=l
2
9IP-1 q>c.m lop 4m
2
G,(*) =
q>ctm log 4m
— HGO + O U
w
^
log p),
(29)
where MGO =
E
n=l
A(n)e~t HQO = 2 A(»)ff~. »=1
(30)
Let =\A{n)e~,
a
"
I 0,
if
+ B/; iip\n.
?
1) There exist two positive constants a and e» such that e\.x ^ S A(n) = ^(x) ^
121 13
Then, we have by (25) and Lemma 4 that Mix) > a |T ( l ~ —) Hix) + O{.{c<my-mxw log p) > f1^
log ajn
+ O (Urn)" 91 * 1 " log p)
i* > 0)
(« > 0),
(31)
where « (and j3 and y used in the sequel) is an absolute constant. On taking c3 sufficiently large, we have by (26), (27), and (28) that n
n
H W < 2 Ain)e~ + 2 A{n)e~ <2c2c3x and n
Hix)> 2 Air$e~ > e-lax. »
Take c4 = ct(c3). N
(» >
Then we have by (29) and (31) that
«*~ lg i* _ _?£_£3fL. + 0(( C 4 ^) J - 9 9 1 x ) / 2 log ? ) > log
^ + Oiianz^x^hg > ~ log c4 • log 4m
p)
OS > 0).
(32)
Write
2V(*)=
2 n »
A(«)e~^+
2 n
^ 0 0 ^ = 2 , + Z3.
" > < r s : r lo K 4<»
Then, by (26) we have 2
, < ffa*-"1"'*- (ffs log 4m + l ) * .
Take c5 = c5(c4). Then it follows by (32) that 2
>.
T£
+
oCCc^m)""**' log p) (y > 0).
log c4 • log 4/»
Take ct = c6ics) and x =c 6 m'-"log 3 ? .
(33)
122
14
Then we have
5\>o. That is, g(.P) < ^5 * log 4m.
Hence, we have Theorem 2. REFERENCES [ 1 ] [ 2 ]
Landau, E. 1927 Vorlesungen ilber Zahlentkeorie 2, 178 Leipzig. BuHorpa^OB, H. M. 1930 ZLA.H CCCP, 7—11.
[ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [10] [11] [12] [13] [14]
Hua, L. K. 1942 Bull. Amer. Math. Soc, 48, 726—730. Erdos, P. 1945 Bull. Amer. Math. Soc, 51, 131—132. Erdos, P. and Shapiro, H. N. 1957 Pacific Jour. Math., 7, 861—865. Tiiran, P. 1950 Math. Lapo\, 243—266. Ankeny, N. C. 1952 Ann. Math., 55, 65—72. Wang Yuan 1959 Sci. Record, New Ser. Ill, 5, 174—179. Weil, A. 1948 Pub. Inst. Math. Strasbourg (N. S; Nr. 2), 1—85. Davenport, H. 1939 Acta Math., 71, 99—122. Burgess, D. A. 1957 Mathematica, London, 4, 106—112. Polya, G. 1918 Nachr. Wiss. Gott., 21—29. Ingham, A. E. 1937 Quart. Jour. Math. Oxford, 8, 255—266. Ricci, G. 1937 Ann. del. R. Scu. Nor. Sup. di Pisa, 6, 70—115.
_ _ _
123
SCIENTIA SINICA Vol. XI, No. 8, 1962
MATHEMATICS
ON THE REPRESENTATION OF LARGE INTEGER AS A SUM OF A PRIME AND AN ALMOST PRIME* WANG YUAN {Z
%)
(.Institute of Mathematics, Academia Sinica)
§1 In this paper, we shall give the detailed proofs of certain results obtained upon assuming the truth of the grand Riemann hypothesis. (Cf. [1], [2]). First of all, let us state the grand Riemann hypothesis as follows: (R) The real parts of all zeros of all Dirichlet's L — functions L(s,X) are < 1/2. From (R) we derive the following131 (R*) Let (/,O = 1- Then «(*;*, 0 = 1
V
{'
where h x = \
X
i = - ^ + o(*l/2log*),
dt
J 2 log*
.
Now we state the results as follows: Theorem 1. Under the truth of (R*), every sufficiently large even integer is a sum of a prime and a product of at most 3 primes. Theorem 2. Under the truth of (R*), there exist infinitely many primes p such that p +2^ is a product of at most 3 primes, where \ is a given positive integer. Theorem 3. Under the truth of (R*), every sufficiently large odd integer N can be represented as N — p + 2P, where p is a prime number and P is an almost prime of not more than 3 prime divisors. * This paper has been published previously in Chinese in 'Acta Math. Sinica, Vol. X, No. 2, pp. 168—181, 1960, but the Appendix is added during translation.
124 1034
Theorem 4. Let Zk(x) be the number of prime pairs of the fbrm (p, p + 2/() not exceeding x. Then
z*G0 < s TT ^ 4 TT (i - T-^-TV 2 )T4- + ° ( T ^ — h* 1O* A p]2kp
— 2P>2\
P>2
(p — iyJ\og2x
\ log3 x
J
Theorems 1,2,3 improve the results which were obtained independently and simultaneously by the author1-"11 and A. H. BnHorpa,a.OBt5]. Our original results were obtained by replacing 3 by 4 in these Theorems. It is well known that if K(X; \, I) is represented by
PEE/(mod (•)
then Theorems 1, 2, 3 may be derived from the following weaker hypothesis (#**) (R**) Let X be the character mod D. Then L(s,X) has no zeros in the domain 2 In this paper, p, p', p", • • •; pu pz, • • • denote primes. §2 Lemma 1. If x>l and z > l , then
2
i ^ = ^£)log2 +
o(loglog3,).
(»,x)= 1
(Cf. [4]).
Lemma 2. Let f(k) =
P~ 1
Ky<x, then
i S r = TTT & J = 1 Tn(i + T - 1 - ^ ) log * + odogiog 3,).
2 (*,2y)=l
p>2
?roo/. Let ^ ) = IT L=1^. Then
v
i£<£± = y j^i) n (i + -±-\ *± V -&& T - i - =
,^<. /U)
W.2y)=l
. i s . 9(0
«,2y)=l
PI! ^
p - 2/
, ^ . POO ^
«,2y)=l
125 1035
"V ^C?) y » /"2CO = 7l>(q) t
=
(«. 2y)=l
(', 2«y)=l
««* =
JE (2 2 O
^
J
q
^Ilog*+O(loglog3*) =
(«.2y)=i
= J^y) 2y
yy A P +2y^
= V TT ^ 2
1_^Vog2
+
+ 0 (l0gl0g3^)
=
pCp — 2 ) /
^ TT(l+
fly P — 1 p>2\
,
!
J l o g g + O(loglog3x).
P{p- 2)/
f>2
Thus we have the Lemma. §3 Let 2 < y < x be two given integers. Let ((/>)
a, q; «,•
(1 < * < r)
be a sequence of integers satisfying the following conditions: (1)
1 ^S x, ( a , q) = 1; if p , | y , then a,- ^ 0(mod pi), otherwise «/^0(mod pi)
(,Ki
where 2 < px < • • • < p, ^ f are all primes not exceeding £ and not dividing #. Let Pm(x, q, f ) be the number of primes p satisfying the following conditions: (2)
K * J ?
S
aCmod q), p =£ a,(mod p,) ( K « < r ) .
It follows from the Chinese Remainder Theorem that the system of congruences y = a,-(mod pi) ( l ^ i ^ r ) has a unique solution in the interval 1 < y < pi • • • pr. Denote this solution by a*. Hence Pa(x, q, £) is equal to the number of primes satisfying the following conditions: C3)
P < * , P = a(mod q), p ^ «*(mod pi)
(lKKr~).
126 1036 r
Theorem A. Let c > 0; P—\]p;. (R*), the estimation H
p_(x, q, e) <
Then under the truth of
+ o(xmiogx
*
•
$*we)
Ao/^i uniformly in (w), where f(\) =
.
PI* P — 1
Proo/. Denote g(4) lows from (R*) that 2
I£
=
(^y) = l
and
^ 1 ^ then it fol-
1 = , ! ! % „ + O(^logx).
p<x
p=a(mod ^) p=a*C°»od ^)
Let
/i*1
c*.
*l? (*>y)=i
».y)=i
where d\P. Then P
P<*
(>=o(mod q) (<>-<•-, f ) = l
"V
p=a(mod 9)
V* 3 3
Wl.»)=l (i,.»)=l
VICp-o*. f) (i(, y ) = l
"V
'
1 —
(>=a»(mod / * )
"jjp 4,IP (<*i.y)=i (<*i.y)=i
+
»(^.(Siw))-^» + ». 4|f
Let
«. y)=i
127
1037
Then 3 efh^ —
1
V
A»2("») -
f^Al
1
V
f(.mlQfi(.m)
(OT, y ) = l
For (^/, y) = l, we have
•lit If
^
•'I*IJI
m<^/i
T\f»KJ
= .1 V ff^) y 1 u ^ = JL . f^H r|P C»-,y)=l
Hence ^
rf^f
i2lp
"Hi"*!.*,)
«!.y)=l W2,y)=l
(
(t,y)=i
By Merten's Theorem, we have
for |P and d<$c.
Hence
§4
;? = o(* i/2 io g * -e^iog 2 ?). Thus we have the Theorem. §4 Let £ > 2 . (»• y)=l
Let / < < : < / + 1, where / is a positive integer. p|»
(»• ««yl=I
Then
128 1038
+
...+r-iv
V P'-V"«'
(n, 2«y)=i
(p.«y)=l
V Mill.p'V'u
(n, 2pyg)=i
(4) (»,2p'—p V^)* 1
(p'—p" . «y)=i
If 3 ^ « < 6 and *1/"<«7
1°. <: =
< 1 . It follows from Lemma 2 and (4) that
^ Too" ~ .t1. Too" ^ Ji p~^ i'A BIP (B,y)=i
P > 2
(n, 29y1=I
K^=^)^
g
+ O(loglog3x) =
=^
8«
n^
n (i + - r ^ — r W * + ooogiogsx).
#|,y?— lp>2^
P>2
pip — 2)/
Hence by Theorem A we have \
(5)
< A(«)
log" x)
^^^ + O ( c°yX - l o g l o g y V
9(^)log2A;
\
log3 * /
where , ^ ~. A(«) =
8«
r
er,
u — 2 (6)
_ x / s x c 4y = (? - r | T | T ( 1 — —. r r ) , f denotes Euler's constant. tUyp — 2 p > 2 \ (/.— I ) 2 / f>2
2°. c=
If 6 < « < 1 3 and ar1/B
< 3.
Since
\g^^o(£>o(gjH(j),
129
1039 l
"v
(.n, 2<7y)=l
p-tqy
1
v if!W _ v C + «y
_of y
(»i 2p«y) = l
/(») ^
V ^ /W ^ p-f-«y
^2(») =
v
(». 29y)=i
fin
i
-y ?(»))_ O(iogx\
P+«y
(». 2«y)=l
therefore
.-S- ? i i ' w ^ ^(?) »SP Kra) ( B , 2
vs J
'
(»> 2p9y)=i
p-tqy
From Lemma 2 and (4) we have
(n, 2«y)=l
n\F (». y)=i
(», 2«y)=l
(
/'""1).2iogg + o(iogiog^).
=±(2^-i-ciogo n £ ^ n 2
Pky P
P>2
l f > ! ?VP — 2)
Hence it follows from Theorem A that (5) holds for (7)
er
A(«) = 4
2
(6<«<13).
4
Let £/ denote the root of the equation 4
2
4
Then <M(») _ yru){ >0> if 1 3 > « > U ; l < 0 , if U>u>3. du Hence A(u) is decreasing in the interval (3, U) and increasing in the interval ([/, 13). By numerical calculations, we have 7.35 < L7<7.4.
130 1040
§5 Let z/>4. 1°. I £ ? = a: 1/ 'and2<«<
*
t
2 l =
^
f
SinCC
l ^ -
"If C», y ) = l
, then we take * = f ( j - ^ ) ^ 1
2
P > 2
(», 2<jy)=l
+ O (log log*),
therefore from Theorem A we have
< (8)
n
8M
« —2
pXq3
P>2
P~
log 3 *
/
)
^
( ? — I ) 2 / 9 ( ? ) log2 x
p — 2 P>2 V
+ O f*^loglog*_\ ^
1
* yy (i -
= A (K)
£ii£
yC^iog2*
+ Q
+
/^ ggy loglog^\ V ^c^iog3^
where A1(«)=-^^^.
(9)
« — 2
2°.
If # = *
1/B
and
• J__A 2
<«<
2
J_-± oo
" * 1/ "
f / 1
then we take $ = -—T— and c = — I log3* 2 W
»!'
(". 2«y)=l
2£/L
\2
X TT ^
1 \
• — I. uJ
Since
(n, 2«y)=l
«/
2 \2
«/
2 \2
TT ^ " ^ l o g x + OOoglog*),
pl«y P "~ 1 P>2 P.KP ~~
P>2
(*<8),
l
)
»/J
r
131
1041
therefore it follows from Theorem A that (8) also holds with
(10) \ 2
«/
2\ 2
«/
2\2
«/
Since
4(«) = —>ii(«) = <*«
- —(1 - log*) (2c - 1 — clogc)2
< 0 (if
1 < c < 2)
for given 4 < v < 8, hence Aj(«) is a decreasing function for 1
u^
-1 — i_ ' 2
f
§6 Theorem B.
Under the truth of (R*), the estimation
P B (x, g, x1/13) > 25.8096e-r fj ^ ^ 1
n ri -
^i
p>i P — 2 )p\iy
y
'
+ o (XCqy \
^o/^ uniformly in (w), where q is a given integer. Lemma 3. Let r > rj > • • • > rB > 1 ^f a given set of integers. Then under the truth of (R*), the estimation FXx,q,Pr)>^--\R\
(P a .y)=l .
(Pa*p, y)=l 2B+]
s
_yyyy... v___i «
ji
••
R = O((l + r)(l + r:)2- • •(! + r.)V«logjr).
132 1042
Proof. Let P^iq; pu • • •, pr) = Pu(x, q, pr). Especially, we have P»(q) = n(x, q, a). The difference between P»(q; pu • • •, pr-\) and P»(q;pi, ~'',pr) is equal to the number of primes p satisfying the following conditions: p ^ x, p = a(mod q), p ^ a,(modp,)(l < i < r — l ) , p = a,(mod ^ r )_ It follows from the Chinese Remainder Theorem that the system of congruences (y = ar(mod pr), ly ^ a\mod q) has a unique solution a* in the interval 1 ^ a* ^ qpr- If pr\y, then (a*, qpr) —1; otherwise (a*,qpr) > 1. For the sake of brevity, we write all the (>,) as (w). Hence P»(q;
p\, •••, pr-0 — P»(X; f = P^qPr',
\<1,
Pi,
py, • • •, pr) =
•• , Pr-l),
Upr^fy',
if pr\y, r
P»(.q',
Pi, • • , Pr) = P»(q)
P
— 2
-(.4P°>
PIK * * *
5
P°-i) — ^ J
O<0< 1. Using this formula r times and with the restriction j3 < rx, we have r
P«(q;
2
pi, •••, pr) > P«(q) -
+ X
E
«= 1
P«(qp°)
+
PP-I) - Kr + rn), o < 6 < l .
P»(qp°pp; pi,---,
(taPp< y ) = 1
Let r > rx > • • • > rn > 1 be a given sequence of integers. P»(qp°-
• -fv; ?i5 • • • 5 PM-I) ^
Since
Pu>(qp*---p,>),
therefore we have PXr, pi, •'•, Pr) > P«(q) -
X (i- a . y)=l
2 S^-S »>P>->)»
P
P
^IP«)
+ 2 2
F
»(.
«>P (.PaPfi' y ) = 1
"<^- • •P,)-(1 + '-)(1 + '-I)2- • -(1 + r,,)2.
133 1043
Since we assume the truth of (R*), hence r-(*;?i, • • • , P r ) > ^ -
\R\.
Thus we have the Lemma. The proof of Theorem B. Let e be a given sufficiently small positive number. Let A = — + s. Then there exists So such that 2
—7"T< log(* + s ) < 0.452 = r,
TT (1 — -4"T) ' <
h
+ s < 1.572 = A
p-f«y
for 8>80. Let pr = pri be the greatest prime not exceeding xvn.
If 2 < ^ ^ 1M X
^ +1, then we denote the greatest prime not exceeding x *~ by pr , where p,i+i is the least prime with the property that p1/^ < 80 < />f|+1 • Let « be an integer such that 2n>2t +r, +1 . Let r4 = r, + 1 (/+ K ^ < « ) . Then we have (cf. [4]) g H
P Ca; a xuus) >
* — I 7?
P(?)
where £ > (1 — 0.0073193)
> 25.8096*"' TT ^ ^
]7
(1 — — — ) >
TT (1 - •
)—
+ O (-**-),
P>2
R = O(*; 7 + l l + n * + "* 7+ "'log a :) = O(* T + l l + 1 3 ^- 1 > log AT) =
o(-^-\ Mog3*/*
Thus we have the Theorem. §7 Theorem C1# Let a} j3 be two positive numbers satisfying 8>JB>4 and J3>a>2. Then
134 1044
£
PX., P,, *>") < (-ff-i'M^l *,) * + o teiog log,),
p-tqy
where q is a given positive integer. Proof. Let
«=[log*], «,==« + ~ T ? /(0<»). Then i »-l
p (v f,CT v1^) = "v
"v
p (x x^pq
y
( =o j _
zup
log I
"-1
xuii~) = V 1 T, ;=o
j_
I
1
1 p+«y
<
2
Y
A/-1^)
+ O l^f log log, log^).
*"'+1
p+«y
Since ^ ( « + o ( ) ) = /li(«) + O () and Ax{u) is a decreasing V Mogx// Mog,/ function, therefore T, < /ii(«,)
/'f, l o g ^ + O ( - ^ 5f log log, log^±i). (pC^)log2, «/ Mog , «; /
Since y . A1{UI) log ^
- ( ' ^ ^ ^« < s
\»/
(>ii(«/+i) - M « / ) ) ^ ^ i o g ^ =
Vlog,/
hence
i=i
^?>(^)- )a
This proves the Theorem.
"
/log 2 *
Mog3*
/
135 1045
Theorem C2. Let 3=^«<|3<13 be two given numbers. Then
P-(*, q, r1") > PX*, 9, ^ ) ~ - T ^ f r - T — < * «
+
"
O (£s£loglogxY
+
Mog *
/
where q is a given positive integer. Proof. It is evident that we may assume a < U < j3. We estimate the differences />„(*, q, xm) - />„(*, ^, .r1/y) and Pu(x, q, x1/u) /»„(*, q, xl"). The difference between Pa(x, q, pm) and P^(x, q, pm+1) is equal to the number of primes satisfying the following conditions: p < x, p = a(mod q), p ^= a,(mod p,)(i ^ m), p s a m+1 (mod p r o + i).
If pm+1-|'y) then by the definition we know that it is "equal to Pu,{x,qpm+Upm); otherwise it is equal to 0 or 1. Hence P » U , ^ , f m ) — P - ( « , ? , Pm+l)] . , .,
,
Arrange the primes between x1/t; and A:1/a as follows: pt < x1/u < pl+1 < • • • < p, < xya < ps+l.
Then PXx, q, xvu) = PXx, q, xl") +
P
^
»(*. P/+i» ?» ?/) + ° ( D .
7-7
Let»=[log*].
«m = a +
And put
miO^m^n). o-l m=0
«<
Since p;
and .!(«) is decreasing in the interval (a, £/), log p ;
Tra=
2
P-(*. «P/+i,
i
< ^(«m)
ft)=
l
y 9w)l°8T*
2 l
log%ii «m
+o ^
_i_
P.(^r, ??,+i, ^r 1 "^) <
I o g Iogrlog^)i Mog3x «m /
136 1046 Since
2 A(«m) log-?** - T ^ f l du = O (-J-Y therefore r
\ q>(q)Ja
'-du\—-+ol-^-log "
log x).
\\og3x
Ao^x
1
Hence P^x, q, *^) < P^x, q, x"°) + (-^["MHld,,)* \
ti
/log 2 ^
it
/log 2 x
+
+ O (-^LloglogA Mog x
I
Similarly, we have V cp(q))u
+ o(^f
\log
A;
log log x). /
Thus we have the Theorem. §8
Let 4 O < 8 , Ku^v be two given numbers. Let 9H denote the set of primes satisfying the following conditions: (11)
p < x, p = a(mod q),p^
a,(mod pi)(i < y ) ,
where pt<^xv"
p = «, + ,(modp, + ,)(l<* — s)
is at most
i- 2
*S<>, *fc+/» *V').
137 1047
Proof. Let F ; be the subset of SDT whose elements satisfy the congruence P = a!+i(mod
p!+i).
Now, we estimate the number of elements of F,-. If ps+i\y, number elements of F,- is equal to 0 or 1. Assume ps+!^y. the solution of the system of congruences
then the Denote
(n = af+,-(mod ps+j) , <•» = a(mod q)
by as+j.
Let
Pa.(x,qps+hxv°).
Then the number of elements of F, is not more than
If the element of 301 satisfies at least / congruences of (12), then it belongs to at least / different sets F,-. Hence the number of elements of 3H satisfying at least / congruences of (12) does not exceed
«
}
Thus we have the Lemma. Theorem D . The number of elements m congruences of (12) is not less than
p,(x, q, *-) - -LJVAM**^
+ o Us*.bg log,).
/"* Jf /(J3(,^)log i x
m + 1 \J«
Proof.
of 9H satisfying at most
Mog**
/
Since
i^u^», 9}
X
)
Mw^X,
X
, X
) —
/
i
/
i
1
==a
»<«-* p=o,+y(modpj+/.)
< E (4- +1) = o(*1/a) + o U~h,
therefore it follows from Lemma 4 and Theorem Cx that the number of elements of 9K satisfying at most m congruences of (12) is not less than M-(*, xl", * 1/8 )
i—• X ) P»y(*5 *PH./, x1") + 0 ( 1 ) > "> + 1 ; « _,
138 1048
> p.ix, q,*-) - -!-(['AM**-)
y
m + 1 \J«
# /
+ o (£*£ log iog,). Mog3x
/
Thus we have the Theorem. §9 It follows from Theorem B and Theorem C2 that P B (*, g, x1'6) > (25.8096 - f" 4L«L i«) V
J6
+ O ( ^ 3f log log,) > 8.4 Mog *
(i)
g
«>*
9 ( 4 ) log 2 *
/
^
/
M
+
+ O ( ^ f3l o g log*). Mog *
/
Let x = y be an even integer. Let
(a)!)
a = 1 , j = 2 ; a,- = x ( » = 1 , 2 , - • • ) .
From (9) we know that there exists a positive constant x% such that
P^x, 2, x") - l ( f AW ^ W2 + o (^£3 l o g log,) > 3 Vb
«
/log *
Vlog x
/
> (8.4 - 6.588) ^--2 + O f - ^ - l o g log*) > ^ 2^ > 1 log * Mog * / log * for x>xx. Hence it follows from Theorem D that for x>xx there exists a prime p such that \
Let x = y be an odd integer. Let
(wz)
a = x — 2 , q = 4 ; ai = * ( « = 1 , 2 , • • • ) .
From (9) we know that there exists a positive constant x2 such that
P^x, 4, *"') - iff'ilW A\_£**_ + 0 (^f_ kg,) > ^1£5_ >2 2 5 5 3 log 2 3VJ3 u
for ar>^2-
/Hotfx
Vlog *
21O8 *
Hence it follows from Theorem D that for x>x2
exists a prime number p such that p<x — 3 and 1/<s
divisors <# p'<,xVi.
/
there
has no prime
and has at most 2 prime divisors in the intervals x1/s<
Hence —-— is a product of at most 3 primes.
have Theorem 3.
Thus we
139 1049
(iii)
Let \ be a given integer. Let
(
a = l , g = 2 ; a, = - 2 *
(* = 1 , 2 , • • • ) .
It follows from (9) that there exists a positive constant x3 such that
P^s, 2, *-) - \(l±M.*»)^+ 3 VJ3
«
/ log x
O (^-log log,) > f&Mog x
/
log x
for x>x3. Hence from (9) we know that for x>x3 there exist not less than ——?— prime numbers p in the interval 1< p < x such that log2*
r
r
p + 2\ is a product of at most 3 primes. Thus we have Theorem 2. From Lemma 2 and Theorem A with c = \, we have V
log**/
pi2* p — 2 f > 2 \
P>2
(p — l ) v l o g 2 *
Mog3*
/
Since
Iog8T p+2k=p'
<s n ^
log 3 ! p+2l{=p'
Io n (i - -7-h^rr2 + o (rr ^ ^)' 3
*.!» ? - 2 f > A
(p — l)Vlog *
P>2
Vlog *
/
we have Theorem 4. REFERENCES [ 1]
Wang Yuan 1957 On Sieve Methods and Some of the Related Problems, Science Record, Vol. I, No. 1, 9—11.
[ 2 ]
Wang Yuan
1959 On Sieve Methods and Some of Their Applications,
Scientia Sinica, 8, 375—381. [ 3 ]
MyflaKOB, H . T. 1948 O KOHeraofi pa3HOCra RJIH 4>VHKUHH
[ 4 ]
Wang Yuan 1956 On the representation of large integer as a sum of a
HAH OOCP, cepufi MameM., 12, 31—46. prime and a product of at most 4 primes, Acta Mathematica Sinica, 6 ( 4 ) , 565—582. [ 5]
BifflorpaflOB, A. W. 1957 npHMeHeirae Q ( j ) Mam.
C6; 4 1 , 49—80.
K pemeTy
SpaToafceHa,
140 1050
APPENDIX 1°.
We state the generalized weak Riemann hypothesis as follows:
(R>) The real parts of all zeros of all Dirichlet's L-functions L(s, X) are ^d" 1 , where 1<<2. Especially, (R2) is the well-known grand Riemann hypothesis. For the sake of brevity, we denote the following proposition by (1, A): Every sufficiently large even integer is a sum of a prime and an almost prime of at most A prime divisors. Here, we state the refined result: Theorem I.
(1,3) may be derived from (RsJ, where S{^-
( 1 , 4 ) is the consequence
and
of (Rs2),
3.237 2 > 2 2 3 7 "
where
All the following results are obtained under the truth of 2°. tant.
Let 7 =
.
(1) holds uniformly in («>), where A(u) = -&-er
(if
U— 7]
7
<«<37)
and (3)
A(«) =
3°.
(4)
tlog
'2rj
2V
Let v>2rj be a given number and q = x1/u.
P.(,, q, J") < Mu) --^f—
holds uniformly in («>), where AM--&-S u — rj
Then
+ O (X'"]"k*X)
(5)
3 7 <«<7^).
(if
^ '- — 1 V
(Rs).
Let xVa < q < c ^ ' " , where c0 is a given cons-
d —1 Then the estimation
(2)
2.475
V
cpiqnotfx I
141
1051 for 7 < u < -
—, and
V
v
(6) \ij
2\7
uJ
«/
2\V
tt J
for
1 V
4°.
i
(if
*>4?);
oo
(if
j.^4^)^
1 . — _1 v
Let q be a given integer.
Then
PXx, q, *1/6-5') > X(6.5rj) - r ^ - r - + O (^f), (p(^)log2 x WogxJ
(7) where (8)
\(6.5r)) >2rjX 6.453306.
The proof is similar to that of Theorem B with the essential difference that here we put r = 0.452 and I = 1.5715 so as to obtain the more exact estimation V *<-"[(*+ 1 ) T ] * " < >hA*-H[U + l)r]tt +4 £i (2^ + 4)! ^0 (2/^ + 4)! +
i!(8ry! | j ( ^ f ? X « « ) * < 0.007183682. 18! f?i V 4 6080/
5°. Let 9<«3<6.5? be two given numbers. given positive integer. Then
p.(*,ff,*"-) ^ pM(*, q, x»n (9)
+
fy
Let q denote a
, T ^ - *« +
9(^)10^* J« «
+0f^.l0gl08rA Mogf*
/
6°.
Let u, v ht two given numbers satisfying 2rj < v < IO7 and Let 9H denote the set of primes p satisfying the following conditions:
T}
p < x, p = <*(mod ? ) , p ^ a,(mod ?,)(» < f ) , (10)
p^as+i(modp*,+iXi
— s),
142 1052
where ps^xu"
fS^modc+iXKf^t-j)
is not less than (12)
PB(x, q, *"') - — M T M s ) -^-) y + O (-£*£. log log*). m + 1 VJ" 2 /(p(#)losr# Vlog3* /
7°.
Computation of integrals.
(l)
v
At = 1
• ^« = 2eT \
Jii
u
J5i
J r
5.5
J . . .
™L w
4
» — n
' —1
= w
M/_1__log_
, 7 1
« — n,
("5.5
2ve
r
h
i log
« — 77
i
j(w)du,
2
.
< 2^ (Xl /(4 + 0.02O + XI /(5.46 + 0.02;)) < 27
(ii) A
2
Let v = 5rj in 3°. Then
_ f57 yii(«) d
k *
=
u
f
Z^f^
du_
%,(±-i-)-i-4±-j-W4i---L) -
\i} uI 2\y u I 2 \V = 207?^ (2 ^~ = 2077
uI
<20?,? r (XU(l + 0.02O + 2 ^ 1 . 1 8 + 0.02;)) < 2077
8°. (to)
The proof of Theorem I. Let x = y be an even integer. Let a — 1 , q = 2 ; «,- = x
(« = 1 , 2 , • • • ) .
(i) Let 7 = 2.475. Then from 2°—7°, we know that there exists a constant xx such that
P.(«, 2, *^) - Iff11 ^ i « ) ^ - + O ( ^ f log logx) >
143
1053
> P_ (x, 2, ,-,,) _ ( p AGO du + JL(* AGO , \ ___£.2 + 2 VJs,
«
^5^r "
'log *
+ o ( - ^ -2l o g log*) > 2q[6A53306 — l o g AT
MOg X
/
> 0.05 - ^2 + O (^flog log*) > 1, 3 log *
Mog *
/
for x > *!• Hence it follows from 6° that for x > xx there exists a prime p such that p < x — 1 and x — p has n o prime divisors < x 1 / 5 ' and has at most one prime divisor in the interval x 1/5 ' < p ' < x 15' . Hence i ^ - p is a product of at most 3 primes. Thus we have ( 1 , 3 ) . (ii) Let ^ = 3.237. Then from 2 ° — 7 ° , we k n o w that there exists a constant x 2 such that
p.(*, 2, *1/5') - -Iff5' A^> <*«)-£*! + o ( - ^ l o g log*) > 2\J^_
> o.Ol ^f+O 2 log *
«
/log2*:
Vlog3*
/
f-^-log log*) > 1 3 Mog *
/
for x>x2. Hence it follows from 6° that for x>x2 there exists a prime number p such that p < x — 1 and x — p has no prime divisor <x1/5» and has at most one prime divisor in the interval x1/5' < p' <= ii-i
x ^ . Hence x — p is a product of at most 4 primes. Thus we have (1, 4). 9°. It is well known that in the proof of Theorem I, the hypothesis (Rs) may be replaced by
where ,4 is any given positive constant and the constant implied by the symbol "O" depends only on 8 and A. Similarly, (/?«) may also be replaced by (8.)
2 D^T/,
A W Max /(rnodD)
P(*, D, /) - _ _ £ «p(D) l o g *
= O (—^-), \log^*/
144
^ ^ ^
1054
where P(x,D,l)=
2
logp-e * (cf. [1], [2]).
P = I (mod D)
3 41
^ BapoW ' first proved (JRi.2). Later, Pan Chin Tongt21 obtained (R\s) independently, from which he deduced (1,5). From Theorem I, it can be easily seen that (#1.5) implies (1,4). In other words, we have proved Theorem II. "Every sufficiently large even integer is a sum of a prime and a product of at most 4 primes. Remar\. (1, 4) has also been proved by Pan and BapfiaH independently, but their proofs are more complicated than that given here, in fact, their proofs are based on (2?i.6) and (JR 16 ) respectively (cf. [5]). I am grateful to Messrs. Pan and BapdaH for their kindly informing me of their results. REFERENCES [ 1] [ 2 ]
[ 3 ] [ 4 ]
[ 5 ]
PeHbH, A. 1948 O npe,ucTaBjieHHH ^eimix qnceji B BHfle cyMMH npoeroro H IIOITH npocToro racjia, EAR CGGP, 2, 57—78. Pan Chin Tong, 1962 On the representation of large even integer as a sum of a prime and an almost prime, Acta Math. Sinica, Vol. 12, No. 1, 95—106. BapfiaH, M . B. 1961 ApHtpMeTHHecKne $YHKUHH Ha pe^Knx MHOJKecTBax, flOKjiadu AnadeMuu HayK Y3CGP, 8, 9—11. BapCaH, M. B. 1961 HoBbie npHMeHeHHH Sojibiuoro peuieTa IO. B. JInHHHKa, Tpydu Hucmumyma MameMamum, UM. B. H. PoMaH08CK010, Bbin. 22JIHHHHK, KD. B. I960 AcHMnTOTHqeCKaa cpopMyjia B aflflHTHBHOH npo6jieMe FapflH JlnTTJibByAa, HAH CGGP, TOM 24, N? 5. 629—706.
145
ON THE ESTIMATION OF CHARACTER SUM AND ITS APPLICATIONS*
WANG YUAN Institute of Mathematics, Academia Sinica Received 25 September 1962
1. Introduction By the use of Weil's [1] famous result on analogue of Riemann hypothesis for algebraic function fields over a finite field, Burgess [1] first proposed a method for the estimation of character sum which gave an improvement of the well-known Polya's inequality [3] for the case of real primitive character modulo p (prime number). Later, the author [4] and Burgess [5, 6] himself gave some further generalisations, modifications and applications on Burgess's estimation. His method may be stated as follows: Theorem A. [6] Let x be a primitive character modulo k. Let rj be a given positive number and r be an integer > 1. If k is a square free number or r = 2, then the estimation N+H
J2 X(n)
n=N+l
holds for any pair of integers N and H (H > 0). We have the following two consequences: Corollary 1. [6] Suppose that \{n) = (£) is the real primitive character modulo f, where (£) denotes the Kronecker symbol. Then rj
Y,(i)
*Shuxue Jinzhan 1 (1964) 78-83.
'
146
Corollary 2. [4] number). Then
Suppose that x is a non-principal character modulo p (prime "
H
5>(n)
71=1
*
holds for H > p*+r>.
The aim of present paper is to apply these estimations to the problems for estimations of the least solutions of Pell's equations and the nth non-residue modulo p. The latter problem will also be treated under the assumption of generalised Riemann hypothesis (GRH). Let d be a positive integer not a perfect square, d = 0 or 1 (mod 4). If the integer point (a;o,2/o) (xo > 0,yo > 0) is a solution of the Pell's equation x2 - dy2 = 4, such that XQ + \/dyo attains its minimum, then it is called to be a least solution. Let 6
Theorem 1.
_ x0 + Vdyp ~ 2 '
For any 5 > 0, there exists C4(5) such that \ne<
(j+5\Vdlnd,
holds for d> C4 (S). This gives an improvement of a result due to Hua Loo-keng [7]. Let n > 2 and n\(p — 1). If the congruence xn = c (mod p),
1< x
has no solution, then c is called an nth non-residue modulo p. Otherwise it is called an nth residue modulo p. Denote by N(p, n) the least positive nth non-residue modulo p. Theorem 2. Let S be a given positive number. Then for a sufficiently large prime p, we have (i) N{p,n)
,
(ii) N(p,n)
n>2, n > 21
and
(iii) N(p,n)
4hm ,
n >e .
147 (i), (ii) and (iii) are the respective improvements of results due to Vinogradov [8] and Buchstab [9]. 2. Proof of Theorem 1 Write a{a)
Lemma 1.
= y2(-)
and K(d) =
T(-)-.
Let r be an integer > 4 and r = £. Then W(a)\ < c5{T)ad-T2/6
holds for a > di+T. Proof.
Let d = fm2, where / is the fundamental discriminate. Then
-s»G)s:(9 V
k\m
/
X
n
'
and
K«)I<E
E(Q-
k\m n
'
Therefore by Corollary 1 we obtain k(a)| < y " c 6 ( r ) ( ^ ) k\m
N
r+
/*+47I7+TT
<
05^)0}-^d^+^+^
7
< c5(T)ad~*t^rV~7FTT>+£:
+ 2r
<-r+v = c5(r)ad~4r^+1>
< c 5 (r)arf~ T2/6 .
The lemma is proved. Lemma 2.
For any given 6 with 0 < 5 < | , there exists CT{5) such that
K(d)< Q+jVnd, hofa!s for d > CT(6).
148 Proof.
Let r = £ < | < 2T, where r is an integer. Then
1 1!
-
^
l
n(n + l) -
^
n+1
l
By Lemma 1 we derive
Finally it follows from Polya's theorem that |cr(a)| < ^
v
/
7
l n
/ < V^lnd
k\m
and therefore
The lemma follows. Theorem 1 is the consequence of Lemma 2 (see [10]).
3. Proof of Theorem 2 Lemma 3. [9] Let ty(x,y) be the number of integers in the interval 1 < n < x such that the prime divisors of n are all < y. Then l
/
X
\
V(x,x«) = p{a)x + O[ -== ) , Vvlnx/
149 where the constant in " 0 " depends only on a, and 1,
ifO
i_ r ^ i + r r i-1 ^ ^ +(_1)M
r/•-.../*-""'5I^M,
lta>1.
Therefore p(a) is a continuous and non-increasing function of a such that p(a)>e-a(lna+lnlna+aJ^). L e m m a 4. Let R be the number of nth residue modulo p in the interval 1 < c < H. Ifn\(pl),n>2 and H > p*+n(r) > 0), then R=-
+ S, n
where \S\ < Proof.
c9(V)Hp-^2/Q.
Let x{x) = e 2 7 r i I n d x / n . Then by Corollary 2, it yields that H
1
"
IT
1 "-
1 H
V
where \S\ <
c9(V)Hp-o2/e.
The lemma is proved. Lemma 5. Suppose that n > 2, n\(p — 1) and p(a) > ^ + S(5 > 0). Then there exists cio(a,S) such that N(p,n) < p*s, whenever p > Cio(a, 5). Proof. Take H = [pi+r>] + 1 (77 > 0). If N{p,n) > p&, then the integer in 1 < n < H such that it contains only the prime divisors < p ^ is an nth residue modulo p. If rj = 77(5) is sufficiently small, we have R > *(H,p£) > p((l + 5V)a)H +
>(1-4)H+O(4=)
o(-^=)
150 and v
n
'
\n
2)
\yflnpj
by Lemma 4, where the constant in "O" depends only on a and 5. This is impossible if p is large and therefore the lemma follows. Now we proceed to prove Theorem 2 as follows: (i) Take a = e^~T{\
> r > 0). Then p{a) > 1 - I n a = - + T . n
Hence there exists cn(n, r) such that N{p,n)
,
whenever p > cii(n,r) and n > 2. Here 5 > 0 and lim T ^ 0 5 = 0. (ii) Take a = 3. Then
p(3) = l - l n 3 + / 3 r " 1 ^ ^ > 0.4804 > 1 . Hence there exists C12 such that iV(p, n) < pA holds for p > c12 and n > 21. (iii) Take a = lnln°T[t+2- Then we can choose 5 = 8{n) > 0 for n > e33 such that p{a) > - + S.
n
Hence there is a Ci3(n) such that In In n + 2
N(p,n)
41n
"
holds for p > Ci3(n) and n > e33. 4. Conditional Result Lemma 6. [4,11] v"*' ^
-it W A W
Under the assumption of GRH, we have f x + O(x2 lnp), if x = Xo ?s principal character modulo p, I O(xi ln P), otherwise.
Hereafter the constant in "O" is an absolute constant.
151 Theorem 3.
Under the assumption of GRH, we have N(p,n) = O(ln2 p),
Proof.
n>2.
Since there is a cu such that *(a;) = E
A n
( ) ^ ci*x>
x>2.
We derive from summation by parts that E
A(n)e-*
71>C15X
holds for a constant c 15 . Consider now E
R(x)=
Xo(rn)A(rn)e-^,
r n
where X^rn
-
rn>l
^
A(m)e^
m>cl5x
> TXo(m)A(m)e-^(l--Te27riaIndm/n) m=l ,
V
-. >.
= (1 - V
n
/
a = 1
oo
n - 1 oo
E Xo(m)A(m)e-^ --TJ2
" / m=l
-ci4e-Cl5(ci5 + l)z
n
~ cue~^ {cl5 + l)x
A(m)xo(m)e 2 - oIndm /" e -v
a=lm=l
> ( 1 - - - Ci 4 e" Cl5 (ci5 + 1) )x + O(x? lnp). Take x = c\& log2 p. Then R{x) > 0, whenever ci 5 and ci6 are sufficiently large, i.e. N(p,n)
152 [3] P. Polya, Uber die Verteilung der Quadratischen Reste und Nichtreste, Nachr. Ges. Wiss. Gottingen (1918) 21-29. [4] Wang Yuan, On the least primitive root of a prime, Acta. Math. Sin. 4 (1959) 432-441. [5] D. A. Burgess, On character sums and primitive roots, Proc. Lond. Math. Soc. XII (1962) 179-192. [6] D. A. Burgess, On character sums and L-series, Proc. Lond. Math. Soc. XII (1962) 193-206. [7] Hua Loo-keng, On the least solution of Pell's equation, Bull. Amer. Math. Soc. 48 (1942) 731-735. [8] I. M. Vinogradov, On the bound of least n-th non-residue, Dokl. Akad. Nauk 20 (1926) 47-58. [9] A. A. Buchstab, On estimations of the numbers in an arithmetic progression whose prime divisors being less than a given order, Dokl. Akad. Nauk SSSR 67 (1947) 5-8. [10] Hua Loo-keng, Introduction to Number Theory (Science Press, 1957). [11] N. C. Ankeny, The least quadratic non-residue, Ann. Math. 55 (1952) 65-72.
153
ON THE MAXIMAL NUMBER OF PAIRWISE ORTHOGONAL LATIN SQUARE OF ORDER s (APPLICATION OF SIEVE METHOD)* WANG YUAN Institute of Mathematics, Academia Sinica Received 25 September 1964
1. Introduction In this paper, we shall give in detail the proofs of results announced in [1] with a slight modifications. Let a set of s distinct symbols, for example, 1,2,..., s be arranged in an s x s square in such a way that every symbol occurs exactly once in every row and once in every column. Such a square is called a Latin square of order s. Two Latin squares are called orthogonal if, when one of the squares is superposed on the other, every symbol of the first square occurs with every symbol of the second square once and only once. We denote by N(s) the maximal number of mutually orthogonal Latin squares of order s. Euler proposed a famous conjecture on N(s): N(s) = 0, whenever s > 10 and s = 2 (mod 4). Bose, Shrikhande and Parker [2] made a great contribution on Euler's conjecture. They proved that N(s) > 2 (s > 6). By the combination of their method and Brun's sieve method, Chowla, Erdo's and Straus [3] established that there exists a constant s0 such that N(s) > -ssr
*Acta Mathematica Sinica, 16:3 (1966) 400-410.
( 5 > S o ).
154 The author improved |s5T to s^s in [1]. In this paper we give the following
Theorem 1.
There exists a constant si such that N(s)>s^,
s>si.
In Sec. 2, we shall generalise the method of Chowla, Erdos and Straus, and give the relation between N(s) and sieve method. Theorem 2 shows that the estimation oiN(s) depends on the estimations of Pu(x, q; £,??) (£ < rf) a.ndPu(x,q;£) (see Sec. 2 for the definitions). The upper and lower estimations of Pu,(x, q; £) may be obtained directly by the use of sieve method, and then the upper and lower estimations of Pu{x,q;£,,r)) are derived by the simple inequalities
PM,Q\v)
(1)
In this paper, we obtain a more precise estimation for Pu(x,q;£) by the combination of the sieve methods of Brun, Buchstab and Selberg instead of the simple application of Brun's method (see Theorem 4). The combination of these methods first appeared in author's works [4-7] on Goldbach conjecture. In this way, we can establish that if s is sufficiently large, then N(s) > s&. To obtain more precise result, we need to give a more accurate estimation on Pul(x,q;^,T]) (£
a,q;a,i,bi,
i = l,2,...
be a set of integers satisfying 2\q,
q = O(xCl) ai^h
(modPi)
(0
qi---qt=O(l),
(i = 1 , 2 , . . . ) ,
where 2 = q\ < q? < • • • < qt are all prime divisors of q and pi < P2 < • • • the prime numbers not dividing q. Let Pu{x, q; f, 77) (f < 77) be the number of integers n
155 satisfying the following conditions n^bi (modft)
(pt < 7?).
(2)
In particular (3)
PM,Q;Z>Z) = PM,Q;O, i
(4)
PM,*,t> n) = PM;Z,v)Theorem 2.
Suppose that „ / \^
f2x\°\ \q J J
c(q)x gliT I
f
x \ \q\n'xj
(5)
and ^
i
i
i\
c(2)x
(
x
\
. .
6
PUJ(x-Xo,xT)>c3-^-+o[-^-) In x \ln xj hold uniformly in (u>), where q = O(x°+ T ), a,b,c are constants b>2,(a + l)b>c>b, and
satisfying
a > 2,
*> = «•-* n^nO-srhpHt). <7> p>2
in which 7 denotes Euler constant. Then for any positive number e there exists a constant SQ = So(e) such that N(s) > s<-a+»nb+v~£. whenever s > soTo prove Theorem 2, we need the following two theorems:
Theorem A. [2] If 1 < k < N(m) + 1 and 1 < u < m, then N{km + u)> min{A^(fc), N(k + 1), 1 + N(m), 1 + N(u)} - 1. Theorem B. [8] (i) N{uv) > (ii)N(pr)=Pr-l.
min{N(u),N(v)},
(8)
156 Proof of Theorem 2.
(1) Suppose 2/s. Take k such that
(
s \ *+^
-J
/
r
i
i
IN
k = - 1 fm0d2Ua + D(6+2) lo82 2] \
,
fc^O, -l(modp)(3
f
j .
(9)
Then it follows from (5) that the number of k satisfying (9) is not less than C4
a —2
> 1,
In s if s is sufficiently large, and therefore from Theorem B, we have N(k + 1) > 2[<»+1>V2)log2 *1 - 1 > s(-.+i)1(i.+2)-£ + i ; ^ ) "+ 1 J
+
- 1 >S(a+lKi,+2)-£+l)
(10) (11)
if s is large. Set s = si + s^k, 0 < s\ < k and u = s\ + u\k, where u\ satisfies the following conditions:
l<«i<(^J
,
(12)
ui = s i + 1 (mod 2),
(13)
3
+2
ul^s2(modp)U
j ,
(14)
(15)
in whichfcpdenotes the solution of ky = 1 (modp). The existence and uniqueness of kp (modp) for 3 < p < (|)^+rfe+5T a r efollowedby (9). Suppose 3 < p < (|)
/ S \ ( a + l)%+2)
/S\3Tl\
It is clearly f/s\W2
/s\-^m
fs\^\
157 whenever b < c < (a+l)b. Hence we derive by (6) that the number of ui satisfying (12)—(15) is not less than c*:-2- > 1, In s if s is sufficiently large. We know 2 / u by (13) and vt« yields by Theorem B that N(u) >
by (14) if 3 < p < (|)c+i>V'>. Therefore it
- 1 > s(a+D(i.+2)-£
- I
(16)
holds if s is large. Let m = ^ ^ = s 2 — u. Then m>sE
+ 5 _ ^ _ j + i > ^_j
^_j + i >u>i,
(17)
if s is large. Since 2/w, 2/A; and 2|«, we have 2 / m . It follows from (15) that the prime divisors of m are all > k, and therefore by Theorem B, we obtain N(m) >k>
(18)
N(k).
Prom (10), (11), (16)-(18) and Theorem A, we derive that there exists a constant so = so(e) such that N(S)
>
S (a
+ lK6 + 2 ) - e )
s
>
So
.
2) Suppose 2jfs. Take k satisfying ( 9 H 1 1 ) - Let s = s1+s2(k and u = si + ui(fc + 1), where ui satisfies the following: 1 < «i < [_)
+ l),0 < Si < (k + l)s
,
(19)
ui = s 2 + I(mod2),
(20)
Ul
£ -Sl (k + l) p (modp) (3 < p < ^£y o + 1 K b + 2 ) j ^
ui # s2 (modp) f 3 < p < (l V + j .
(21)
(22)
Since 2|(fc + 1) and 2 / s, we have 2 / s and so 2 / u. We know also that the prime divisors of u are all > ( | ) (»+DW2) b y (21). Let m = f^f = s 2 - u x . Then by (20)
158 and (22), we know that the prime divisors of m are all > k. On the other hand, m >u> 1 if s is sufficiently large. The theorem follows from Theorem A.
3. A Recurrent Formula The aim of this section is to prove the following Theorem 3. Let a,P be two numbers satisfying 2 < a < /3 < 15. If there exist two non-negative functions X(u, v) and A(u, v) (0 < v < u < 15) with the properties that if one of the two variables u or v is fixed, these functions are increasing with only finite number of discontinuities in another variable such that 1
l
Cl"
l
T
\
P u (s;s* ) *=)>A(/?,a)- 5 - + o ( r 2 5 In z \ln xj
(23)
and
Pu(x;xt,xi) < A(/?,a)-^- +o(-^-) In i
\\n
(24) xj
hold, where
(25) in which 7 is Euler constant, then the functions
Xttf, a) = max U, X((3,6) - j ' ^ A ( ^ j ^ ) ^
d z
)
(26)
and
A^,a)
= A(P,6) - J' * X ( ^ Y ^ ) ^dz
have the same properties as A(/3, a ) and A(/3,a), a<6 <(3.
(27)
where 5 is a number with
To prove Theorem 3, we need the following two lemmas.
159 Lemma 1. such that
Suppose £, < ( < rj. There exists a sequence of sets of integers (ujni)'s
P«frt,V)=Pufrt,OProof.
E PunJ^^lZ'Pni-l)v Pni J c< Pni <^
(28)
By Eratosthenes sieve we obtain
C
+ E
E
«Pn1
«Pn2
- E
^p»1p»a(^^.o
E
E
C
where PQPn
Vn
p^^^u)
+ ---, (29)
(
(x; ^, C) denotes the number of integers satisfying
0 < n < x,n = a (mod 2),
n ^ O j (modpj),
n = bni (mod pni),...,
n =
bnt(modpnt),
n^bj(modpi) (p» < 0-
(30)
We may assume that 0 < ai, bi < pt. Let a n i ,Oj n i and fojni be the respective solutions of congruences mPm +bni =a (mod 2), mpni + bni = ^ (mod p ^ and mpni + bni = bi (modpi) whenever pi =/= pni. Let K,) and Pu>niPn
Pn
(x',£,0
ani; aini, bini
i =/= ni
be the number of integers satisfying
0 < n < x,n = ani (mod2),
n = bn2m ( m o d p n 2 ) , . . . , n = bntni (modp n t ),
n ^ aini (modp^ (p<e),
n ^ bini (modpi) (p» < ().
(31)
160 Then
= p^,vn2...Fnt ( ^ ^ . c )
p^..,nM^0
(32)
and consequently
+ E
C
E ^ i r . j P B ,(^«-c)--
C
_
(x-bni.<.
4-
V^
V-
\
c
V
P
p.
(x-bni V
C
(x-bni.r
f
c
\
\ 7
= PWB1f^^;^Pn1-i). \
(33)
/
Pni
Substituting (33) into (29), we have the lemma. Lemma 2.
[9] Let a, f3 be two numbers such that f3 > a > 1. Then
^ ^ p l n
2
!
\7a_i
^2
/In2*
Vln3a;y
(34)
Proof of Theorem 3. Set £ = x? ,C, = x$ and r\ = xi in Lemma 1. Let n = [%/Ex] and uj = a + ^ J - 1 (0 < i < n). Then
x"i+i+i
E
P^fyxKp^+Oix^ + Oix1-*)
= T', + O(x-) + O(x 1 -J),
(35)
161
<
V
"
, ^
-
U+i + 1
//?Inf lnfX
,
CT
J
, ^
< UJ^,.,+1) r L V«i+i + l
/A;
z
25
p'z +1 \
, pln2f
Vln 3 i/
i±ij 2
x
Vln xA;
llnx 'lnPJpln^
+
/
+O
*2^J
+0(').
2
\\n x
pel
\\r?x)
Since ^
Vui + l + 1
) Jul
L VUJ + 1 + 1
^iui
Z2
Ja-l
/
\Z + 1
\Z + l
)
Z2
J\ Z2
(37)
= oh)=O('), we have
V! ll
p ± <XQ
fx-bm.xl
\
\
/
Pnx
n-1
= E^ n-1
= ^2 fi + O(xi Vlnx) + Oix1-^ Vlnx) l=o
(38) and therefore
162 by Lemma 1. On the other hand, since Ti>\\[ L \ui+i
——dz\—T-+O[—*-) z2 J ln2x Vina;/
,ui) J JUl
and
f'-1 Ja-i
( 0z \z + l V2 + l / 22
^ ^
\ fUl+1z J JUl
( 0u, V«« + l
+ l, z2
(
1 \ \Vh^J
we have
V
Z^
1
(X-b^:r r-
P
^"1 I \
±
ll
\y«-i
„
V^ + i
n
> °>Pni-l I
\
J
Pni
/
z
yin2x
Vin 2 - 5 xy
and therefore
by Lemma 1. (27) follows and the theorem is proved. Remark.
Since PU{X;W)
< P*{x;t;,v) < Pu,(x;Z,z), e < v,
the functions X(u,v) = X(v,v) = X(v) and A(u,i>) = A(u,u) — A(u) clearly satisfied the requirements in Theorem 3 (see [4-7]). 4. Estimation of Pu(x, q; £) We use the notations in Sees. 2 and 3. The aim of this section is to prove the following: Theorem 4.
The inequality
(39) holds uniformly in (to), where q =
0{x*).
163 Proof.
1) It follows by Selberg's method that the estimation _ / p
f2x\*\
t/»c(q)x A i d )
»{*>«{7) ) ^
/zlnlnaA
^
+0
(40)
{-^x-)'
holds uniformly in (u>) and q = 0{x*), where
*"[W-AM]' Md)={
,
r
(41)
[(rf-l)2-flnf + < 5 ( | ) - ^ '
-
-
in which r) is a preassigned positive number and
tf(d)=lim-^-
^ln2-L,
Y £
d>2.
(42)
pp' < id
A(d) has a similar expression for d > 6, and we may take A(d) — A(2) for 0 < d < 2. We refer to Wang Yuan [4-7] for the proof of these formulas but we should take £=(^)i/log5a;here. 2) By Brun's method, we know that the estimation
(43) holds in (us) and q = O(x*). We refer to Buchstab [10, 11] for the proof, but we should make the following changes: pr is the largest prime number <( —) T5 ,p r3 = Pr2 = Pn = Pr, and Prfc(4 < k
pJx,q-,(^)")<mM22^L+o(-f r-), \ \q J ]
\qj
J
gin 2 1
\qln3xj
and
P,L;p)A)<101,j«i+o( • ) .
164 3) Suppose that a, (3 are two real numbers satisfying 2 < a < j3 < 15 and that there are two non-negative and non-decreasing functions \(z) and A(z) with the following properties: They have at most finite number of discontinuities and the formulas (2x\1\
_ (
P»[™{J) and _. / Pu[x,q;[
^/a;lnlnx\
. c(q)x
J^^^Ul^j
/2z\*\ , c(q)x ^fxln\nx\ —\ < A ( z ) - ^ - +O 3
, ,
(44) 45
holds uniformly in (a>). Then X1(a)=maxi0,X(J3)-2
A(z)-^-dz\
(46)
and A 1 (a)=A(/3)-2 /
A(^)^d2
(47)
have the same properties as X(z) and A(z) respectively. We refer to Buchstab [10, 11] for the proof. Note that xi < | if ( ^ ) ^ < p < ( y ) ° , and so g = O(x3) = o ( ( f ) 3 ) - The existence of the functions X(z) and A(z) satisfying (44) and (45) follows from 1) and 2). 4) P r o m l ) - 3 ) , w e h a v e t h e following t a b l e : d \ 10 I 9 I 8 I 7 I ••• Ap(rf) 9 9 . 9 8 1 8 1 1 U 7 8 4 6 9 6 0 . 8 8 8 1 7 4 3 . 5 1 5 5 4 ~ ••• A 0 ( d ) I 1 0 0 . 0 2 0 7 3 | 8 2 . 7 2 0 7 | 6 8 . 5 2 5 1 1 | 54.39352 | •••
(48)
(see [7, 1 0 , 11]). T a k e ut+\ -ut= 0 . 0 1 . T h e n b y 3) a n d t h e f o r m u l a s
/
Ja — l
\{z)-^dz>Y,Kut) Z
t_0
Jut
-ydz
(49)
and
/
A( Z )^z<^A(« t + 1 )
-J-dz
(50)
for i t e r a t i o n s , w h e r e ^ p - = 0 . 0 1 , w e o b t a i n d \ 10 I 9 1 8 I ••• 1 4 . 3 1 1 ••• An(d) 99.98181 80.892035 63.59931 ••• 0 . 0 5 ••• A12(d) 100.02073 81.11841 64.403149 ~ 3 0 . 8 2 1 ••• T h e t h e o r e m is proved.
(51)
165 5. Estimation of Pu(x; $, rj) Theorem 5.
The inequality
(52)
P^(x;xKx^)>0m-^+o(-^w-) In i
\\n xj
holds uniformly in (u>). Proof.
Take (3 = 5 = 8 and a = 3.24 in Theorem 3 and set A(u,v) = A12(u)
and X(u,v) = An(v).
Then An(8)-/ J2.2A
A12 (-^-)Z-^dz> 0.01. \
z
+ 1/
(53)
z
The theorem follows. Theorem 6.
The estimation 1
1
CX
(
X
\
(54)
Pu{x;x^,x^)>0.29-T-+O[-Tr-) In i \ln xj holds uniformly in (u). Proof. Let
\0{u,v) = Xn{v) and A0(u,v) = Ai2(u). Let u t +i — ut = 0.01 and ut+i < /3. Then by Theorem 3 and the formulas \+1(P,ut)
= Xi+1((3,ut+1) - /
Ai(J^!Z)^dz
Jut-l
\Z + 1.
3{ut+l 1
> Xi+1(p,ut+l) - A, (< V
W
~ \ut+l
*+l
JZ
- l ) H*1'1ZA±dz(55) z
/ Jut-l
and yu t + i-i ( Bz \ z + 1 A i+ i(/3,u t ) = A i+1 (/3,u t +i) - / Ai I -^3-7,-2) —2-cte Jut-l \Z + I J Z
< Al+I(f3,ut+1) - A, f^"'"^,^ - l ) n+l~l \
U
t
J Jut-l
Z
A±dz (56) Z
we have (u,v) \i(u,v)
1 (8.05,8) I (8.05,7) I (8.05,6) I ••• 6 4 . 0 1 1 9 9 8 5 5 . 5 5 9 5 5 1 4 6 . 5 8 2 4 8 8 •••
(u,v) I (7.05,7) I (6.9,6) 1 (6.76,5) I ••• A i ( u , u ) I 5 0 . 8 3 3 6 8 5 | 4 3 . 8 6 9 9 8 5 | 3 9 . 9 9 4 5 3 7 | •••
(57)
166 and (u,v) I (10,9) I (10,8) I (10,7) I ••• I ( 1 0 , 2 . 8 4 ) I ••• X2(u,v) 89.912569 79.816805 69.635682 ••• 0.29 (u,v)
(8.89,8)
(8.75,7)
(8.58,6)
•••
(58)
A 2 ( u , v ) I 7 1 . 3 4 4 2 4 5 | 6 1 . 6 7 7 9 3 1 | 5 2 . 6 6 7 5 8 2 | ••• T h e theorem is proved.
6. Proof of Main Theorem Take e =
5 31 *5 24
— ^ . Then by Theorems 2,4 and 5, it follows that N(s) > S 5"i5.24-^ = S A ,
(59)
if s is sufficiently large. This is the main result announced in [1]. Then take e = 5 3ix4 84 ~ ^6' ^ y Theorems 2, 4 and 6, we obtain N(s) > S 5 3 iii.84- £
= SA!
(60)
if s is sufficiently large. Theorem 1 follows. Remark. If x~& is replaced by x^i or z A in Theorem 6, then it is possible to establish N(s) > s " by Theorem 3 with more complicated numerical calculations. Remark added on 7 April 1966. proved
We know recently that Kenneth Rogers has
N(s) > s~&,
s > so
(see Pacific J. Math. 14 (1964) 1395-1397). References [1] Wang Yuan, A note on the maximal number of pairwise orthogonal Latin squares of a given order, Sci. Sinica 8 (1964) 841-843. [2] R. C. Bose, S. S. Shrikhande and E. T. Parker, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Can. J. Math. 7 (1960) 189-203. [3] S. Chowla, P. Erdos and E. G. Straus, On the maximal number of pairwise orthogonal Latin squares of a given order, Can. J. Math. 7 (1960) 204-208. [4] Wang Yuan, On the respresentation of large even integer as a sum of a product of at most 3 primes and a product of atmost 4 primes, Ada Math. Sin. 6:3 (1956) 500-513. [5] Wang Yuan, On the representation of large even integer as a sum of a prime and a product of at most 4 primes, Ada Math. Sin. 6:4 (1956) 565-582. [6] Wang Yuan, On the representation of large even number as a sum of two almost primes, Sci. Rec. (New Series) 1:5 (1957) 15-19. [7] Wang Yuan, On sieve methods and some of their applications, Sci. Sinica 8 (1959) 357-381.
167 [8] H. F. MacNeish, Euler squares, Ann. Math. 22 (1922) 221-227. [9] A. A. Buchstab, Asymptotic estimation of a general number theoretic function, Math. Sb. 2 (1937) 1239-1245. [10] A. A. Buchstab, New improvements on Eratosthenes sieve method, Math. Sb. 4 (1938) 375-387. [11] A. A. Buchstab, On representation of even number as a sum of two integers with bounded number of divisors, Dokl. Akad. Nauk SSSR 29 (1940) 544-548.
168
Vol. XVIH No. 5
SCIENTIA
S1NICA
Sept. - Oet. 1975
Science Articles
ON THE REPRESENTATION OF EVERY LARGE EVEN INTEGER AS A SUM OF A PRIME AND AN ALMOST PRIME PAN CHENG-DONG
(SSJl)
(Department of Mathematics, Shandong University) DING XIA-XI (TX&t)
WANG YUAN (5E 5C)
(.Institute of Mathematics, Academia Sinioa) Eeeeived Oct. 21, 1974.
ABSTRACT
In this paper, we give a modified proof of Chen's theorem "every sufficiently large even integer is a sum of a prime and a product of at most 2 primes". 1.
INTRODUCTION
For brevity, we denote the following proposition by (1, a): Every sufficiently large even integer is a sum of a prime and an almost prime of at most 2 prime factors. The proposition was studied by T. EstermannL4), A. Eenyi[18!, Wang Yuan19'101, M. B. Bap6aHul-I2J, Pan Cheng-dong16-171, B. B. JleBHH»61, A. A. Byxurra6[13'14], A. H. BHHOrpaflOB1151, H. E. Bichert[8] and Chen Jing-runt2>31 successively by means of sieve method and large sieve method. The best result is due to Chen. He proved
Theorem 1. (1, 2) Chen gave the previous method an important improvement. duced and estimated the
£=
S
Especially, he intro-
o-i)
i,
(
where p, pt, p2, p3 are primes and CPi,2) denotes the condition x10 < pl^ x* ^ p2^ (—) . The aim of the present paper is to give a modified proof of (1, 2). First, we shall show that the estimation of Q may be derived from the following mean value theorem. Let 2 ^ y ^ x. Let it(y, a, q,l) =
^]
a
»
169 600
SCIENTIA SINTCA
Vol. XVHI
where |-1, for prime n, l
Theorem 2. estimation
1=
0, otherwise.
For any given positive constant A and positive number e ( < 1), the
,JL*. - -- JL KaYy>a'q> ° - ict) - KrV)
ci.2)
A
\log a;/ holds for log28^ < Ay ^ A2 < yl~*, where | / ( a ) | ^ 1, B = A + 7 amd ffee constant implied by the symbol "0" depends only on e and A. Next, we use the comparatively elementary sieve method given in the previous work of one of the authors (Cf. [10]) to replace the Eichert's method. We have by the same way that Theorem 3. There exist infinitely many primes p such that p + 2k is a product of at most 2 primes, where k is a given positive integer. Theorem 4. Every sufficiently large odd integer N can be represented as N = p + 2PC2), where p is a prime and P t2) is an almost prime of not more than 2 prime divisors. The other famous problems concerning the distribution of almost primes can be treated similarly. II.
THE PROOF OF THEOREM 2
To prove Theorem 2, we shall need Theorem A (large sieve). Let 1 < P < Q. Let M and N be positive integers and let b'ns be any complex numbers. Then *
M+N
2
/
TLT\
M+N
(21)
*
where 2
denotes that the sum is over the primitive characters mod q.
For brevity, we omit the index q of Xq. Cf. P. X. Gallagher [5] and Chen Jing-Eun [3]. The Proof of Theorem 2. 1)
Denote Z>x = logB x,
D= zhog- B a\
(2.2)
170 No. 5
PAN et al.: A SIMPLE PROOF OF CHEN'S THEOREM (1, 2)
601
Then we have
*(V, 0,3,0-
2
8
-
=
TTS
! ( I ) X W
S
( I
.
J :
W.
(2.3)
fl«=/(mod 0)
where (a, q) = (Z, g) = 1 and 2 denotes a sum in which Xq runs over all characx, ters mod q. Hence
*(y, a,ftZ)
i - 2
?>(«)
" = -TT 2 *(0*(«) 2 «»*(M)
a
«
9 ( 2 ) x3-¥X0
^ ^ ^ S 2 ^(0X(o) 9(2)
9,14 X,
2
»
»
«nX(«).
(2.4)
t», «/«,)= 1
It follows from prime number theorem that
£
a. - *(^-) + 0 ( 2 l) = H - + 0 U- e-"**) + 0(f).
(2.5)
Therefore we have from (2.3), (2.4) and (2.5) that
Z< S ^ - T 2 - ^ maxS*
S /(«)««) 2 ««*(») (a,« 2 )=l
+ ° ( T 4 - )<
max max
t».9 2 )=l
ks* • 7».» + ° (TZT-)>
V-V
S ff(«)Z(«) S *.Z(n) ,
(2.7)
where
J».«» S -TT E * «
^,<«<^2
"<Wo
in which fff(«) = / ( w ) , <^» = «», for (w, m ) = 1, g(n) — da = 0, otherwise.
2) Let
Iy.m = 4 % + /i2,'-,
(2.8) (2-9)
where
(2.10) 7
"- = 2
-TT S *
2 ff(o)^Cfl) 2 d.Z(») .
(2.11)
Then it follows by Siegel-Walfisz theorem (Cf. K. Prachar [ 7 ] ) that there exists a positive number s 1 = e^e) such that
171 602
SCIENTIA SINICA
Wm < S "TV 2 * I S +
2J
- 7 - T ZJ
«
ZJ
X,
fKQJ
Vol. XVHI
«-*(»)
«•
ZJ
^ O s ! ^ »
= OC-D^e-6^1"*7 logx) + OCfl^jm 6 ) (2 12)
-
"^T^H-)l
3)
\ log* x / Obviously, we have
I{H < S S
Z
^ ( i , *),
(2-13)
where 2]D1 < D < 2I+1Z>1, 2"% < J.2 < 2K+lA! and
Jft.G,*)~
2
-TT 2 *
Z'D^^O'+'D, "PW;
for A; < K and the 2
k+1
X,
2
2kAl<*<2k+'Al
»(«)««) 2*.^»).(2.]4) »
A! in (2.14) should be replaced by A2 when k = K. Let
/(«, z) = 2 ^
.
^1
Take
n'
(•'-it- -r 1 -)\
^2-15>
log a;/
T = e*""''.
(2.16)
Then from Perron's formula (Cf. K. Prachar I 7 | ) , we have
2
«U00 = - i : rTfl^X)
I1-)1 ds + 0(*-) + 6(.a),
(2.17)
where 6(a) Suppose that H
,0(1), for a | y,
(2.18)
l
O, for a | » .
Denote
/,(«,*) = 2 - - ^ .
/^ s >« -
2
^
•
(2-19)
Then we have immediatelj' that
f(s, Z) = /,(«, X) + /2(s, Z) + O(*- 2 ).
(2.20)
Let
ff*(«,Z)=
2
g(<0 (fl)
?
( 2 - 21 )
and
P}fl («) =
2
^ T 2 * I »*(«» ^)/'( s ' *) I' 0 - 1» 2).
(2.22)
172 No. 5
PAN et al.: A SIMPLE PROOF OF CHEN'S THEOREM (1, 2)
603
Since fir*O, *)/.(«, X) X-ds a-IT
S
gic(s,
*)/.(«, X) O-ds
j\-iT
S
= 0 (f (S •-* ) ( S •-*)) = ° ( ^ ) - OCO ,
(2.23)
therefore from (2.14)—(2.23), we have
2it J 1-/T
+ 0
|S|
2sr J o-iT
\S\
(2 24)
(r^r-)-
-
^ log^^ x J 4)
By Schwarz inequality, we have
pj!l(0<(
V
x(
- f r S * lflfc&*)l2V
2 2'Dt<«<2'+'C1
S
Take
<
P ( 3 ) X,
'
- f - S * !/«(«.*> I'V 0 = 1.2).
ff=(2'Z>,)2.
(2.25) (2.26)
Then we have from Theorem A that
« (fl" + 2 fc 4,)^ logx « a;^log-fl+1 x for s = — + &(— T < i < T). Let 2RH < I7 < 2R+1JT and
2 r)
/l (s, Z) =
2y&£, for 0
2'H<»<2'+'H
y.
Then E « log2^ and
Hence, it follows by Theorem A that
W
'
d.X(«) ;
for r = B
(2.27)
173 604
SCIENTIA SINICA
2>DJ V E
\ A,
Vol. XVm
&Dj
« (— + —V log2 x « log"* y • log2 x
(2.28)
for s = a + « ( — 2" < tf < T ) . Substituting (2.27) and (2.28) into (2.24), we have max ItflU, &) « * log~a+4 a; « a; log--4"3 a;.
(2.29)
Hence the theorem follows from (2.6), (2.12), (2.13) and (2.29). We deduce from Theorem 2 immediately (Cf. Pan Cheng-dong [6]) Corollary.
Under the conditions of Theorem 2, we have
(o,«)=l
= 0(-^-Y
(2.30)
M)Ae»*e v(g') denotes the number of prime divisors of q and B = 2A + 24.
Remark. Starting from the function
A
2
(w) 1( «* —»
oB=/(mod q)
we may prove the similar result too. HI.
1. Let rj = 2
THE SIEVE METHODS
Mean Value Theorem of Bombieri-BuHoapadoe
e, where s I < —\ is any given positive number. V 4J
Let q be a
positive integer and § > 0. Let £(x, q, £) denote the set of all integers with the form k = qm, where m ^ — and the largest prime divisor of m is not exceeding f. Further let
«(*,«, s) -
3 (fc)
" I <"<>) I m a x
S
*«fl(*.«.« where jr(j/ } fe, I) = 3r(y, 1, A, 0 .
Theorem B.
v<
*
(/
max '* ) = 1
*c* *, o - ^ r ,
(3.D
For any positive constant A, we have Biz, 1, as*) = 0 ( y ^ ) ,
(3.2)
174 No. 5
PAN et al.; A SIMPLE PROOF OF CHEN'S THEOREM (1, 2)
605
where the constant implied by the symbol "0" depends only on e and A Cf. E. Bombieri [1] and A. H. BHHorpaflOB [15]. 2. Brun's Method Let
2 s=S y ^ x be two integers. Let a,q;dit
( 1 < i < r)
O)
be a sequence of integers satisfying O,2) = l, «,-^0( mod p,.), ( l < t < r ) ,
ff<
(3.3)
where 2
(3.4)
Denote
(3 5)
*« - •- n ^ 4 n (i - r-hv)' Pi«y P — 2 p> 2 \
CP — 1 )
-
y
where y is the Buler constant. Theorem C. Suppose that C is a positive constant. Then there exist two nonnegative and non-decreasing functions A(ff) and A(«) (0 < a ^ C), each of which has only finite discontinuities, such that
V
<
(5!^ <
PM (X) g ,
V
V
V W ;
l0gX
}
A («)
C
V
' ^lia:
«p(2)logf
\
\
(1 + 0 (Ml2£3£)\ V
V l0gX
)}
(3.6)
+ O(log>x-R(x,q,(^yyj holds uniformly in a and (a>). In fact, we may take
Ml-± A(a)-{ V ^
^Cft+DO™), for«>7, (2& + 4 ) ! ^
(3.7)
If), for a < 7, and A(a)=
V
A
(2*+ 5)!
z1
(38)
lA(8), for a < 8, where A = 1.5 + £ and r = log 1.5 + e, in which s is any given positive number.
175 606
SCIBNTIA SINIGA
Vol. XVHI
3. Selberg's Upper Bound Method r
Let c > 0,P = TT pi and £* < —.
Kd)
^
for d\P, where /(ft) = (p(ft) TJ
Let
/<*) '
u
&<* /(O
(3 9
- >
p
~ 2 . Further let P— 1
PI*
(3.10) d2\P
d^P
where [dl!d2] denotes the least common multiple of ^ and d2. Theorem D. The estimation P.C.*. Q, I ) < QCx, Q, i) + OOog2 x - B(x, q, £))
(3.11)
and
(3.12) hold uniformly in a(0 < a < 6) and (w), where 4er,
for 0 < a < 2, ?25I
A(a) =
a
,
for 2 < a < 4 ,
~' ~f ^ f
(3-13)
2 ^ ^ /Or4<«<6, a - 1 - — log — + *(«) 2 2 in which *(o) = f f
— 4.
^
dfcfa, (a > 4).
(3.14)
Byxuira6 Method.
Theorem E. Let X(a) awi A(a) fee two functions with the properties as those stated in Theorem C. Then the functions defined by [max V(x(a), A(/?) - ('"' ^&A,(o) = i J«-i 2 U(a), /or
0 < a < 1 + 6,
dz\ /
for l + e < « < / 9 < C ,
(3.15)
176
No. 5
PAN et al.: A SIMPLE PROOF OF CHEN'S THEOREM (1, 2)
607
and
fmin V(A(a), A(/?) - Lf""l1 ^z A^a)-] ~ lA(a),
dg\ /w 1 + s < « < 0 < C, ' (3.16)
/wO
/tave Wie same properties as those of the functions X(a~) and A(_a) respectively. We refer A. A. ByxiiiTafi1141 and Wang Yuan1101 for the proof of Theorems C and B and Wang Yuan wl for Theorem D. IV.
THE PROOF OF THEOREM 1
1. The Estimation of Fw(a, /?). Let /? > a > 1. Let
r*(«,£)= where p denotes prime.
2
(4-D
P.(x,m{jf),
Then from Theorem B, we have
+ O(—I—V 2. Let P =
JJ
(4.2) The Estimation of Q.
p. Let a; = i/ be even integer.
Further let a = 1, q = 2 and
_l_e_ 2<*4 ?
dt = a;(t = 1, 2, • • •) • Then we have
£< S
2
«. + oc*i)<2
+ O(*i) = 2 2
^K
S «-( 2
2 ^-P.P2, [di,*],*) + OGB*).
Obviously, ([d,, d 2 ], ptp2) = 1 and ld = O(log«).
£ <
2
2
O2
Hence we have
2 X*M (pctd,,1^])
+ O| log1*-
2
lA*(d)|3*'>
2
*(*,ftft,d,*)--^-
177
608
Vol. XVHI
8CIENTIA 8INICA
+ o(**) < 2 S S v * „([££]) + O( log's- 2 \ \
d<*i U,*)=l
IfOOlS"™
Z
fW<*> *>*>*>-~Jk\
» 2 *3°
WK
\ \
' / /
/ /
(«,<»= X
+ OQxi), where
/(a)-|
i i /x\± fl, for a = PiP2 and a;10 < pt < a;3 < p 2 < (— I ,
W
1.0, otherwise.
Therefore it follows from the Corollary of Theorem 2 (for A = 5) and Theorem D that fi<(8er
2
"
V (6 M 2 log-^-
+ 8)-°*2-(l + 0(-±-))
^
^
W ^
P1P2
10,(2 -
i)
< (»«' j" ^ n ^ * + ») ^ 0 + 0 (-V)) < (7.01474 + 2<J) - ^ - ( l + 0 ——")), log2 a; \ logix"
(4.3)
for s sufficiently small, where 5 = o ( l ) as s —> 0. 3) We have A0(7) = 13.95578 and /l o (8) = 16.00624 by (3.7) and (3.8) and A,(«)(0 < a < 6) is given by (3.13). Take /? — « = 0.01. Then we have ^ 0 (3 + 0.01i)(0 < i < 400) by Theorem E. For examples, X0(6) = 11.90332, A0(5) = 9.77058, Ao(4) = 7.41296 and Ao(3) = 4.44824. Take also /J — a = 0.01. Then we have Xi(.a) and A ^ a ) from A0(ce) and A0(a) by Theorem B, for example, ^ ( 5 ) = 9.87844. 4) Let x = y be even integer. Further let
M = -i2
2 1
1.
Let o = 1, q = 2 and di = x(ji = 1, 2, • • • )•
P.(a;, 2 R a;*) + — + 0 (*»).
(4.4)
2
Then from Theorem B, (4.2), (4.3) and 3), we have
P,Qc, 2, xh -M> 2^(5) - |-[], \
y ° d« - 3.50737 - *) -^~ 2
2 Jfff s(5 — z)
/ log a;
X ( l + 0 (—-—•")) = 2 (9.87844 - 10er (2; — — ^ Mog^a;^ ^ J.(5-2ZX2z-l-«logs)
178 No. 5
PAN et al.: A SIMPLE PROOF OF CHEN'S THEOEEM (1, 2)
- 2er log — 3.50737 - d) X - ^ _ (l + 0 (-^—)) 1.5 / log2 a; \ Hog* a:" Cx > ' (l + o (—^—^\) > 1 (for sufficiently large x). 10 log2 x \ Hog* a:"
609
(4.5)
Let p denote prime. 11 p'\x and p' | (a: — p), then p = p. Since the number I 2. of prime divisors of x is 0(a; 6 ), hence Pw(.x, 2, a;10) + O(x10) is equal to the number of primes p satisfying 2 < p < x, if p' | (a; — p), then p > xr°.
(4.6)
Since the number of primes p satisfying (4.6), such that x — p has a prime divisor l
1
p > xw, is P<£.x, 1p, a;10) and the number of primes p ( < a;), such that x — p is I
divided by p'Kp > »10)> is at most f>*
10
hence the number of primes p satisfying (4.6), such that x — p has at most 2 prime xx
XX
factors in xw < p' ^ a;3 or 1 prime divisor in s;10 < p' < a;3 and 2 prime divisors > Xs, is not exceeding M. Consequently, it follows from (4.5) that there exists a prime p such that x—p has at most 2 prime factors for sufficiently large x. The theorem is proved. REFERENCES [ 1] [ 2] [ 3] [i ] [5] t 6] [ 7] [ 8] [ 9] [10] [11]
Bombieri, E.: On the large sieve, Mathematilca, 12 (1965), 201—225. Chen, Jing-run: On the representation of a large even integer as the sum of a prime and the product of at most 2 primes, Kexue Tonglao, 17 (1966), 385—386. Chen, Jing-run: On the representation of a larger even integer as the sum of a prime and the product of at most two primes, Set. Sin,, 16 (1973), 157—176. Estennann, T.: Eine neue Darstellung und neue Anwendung der Viggo-Brunschen Metode, J. Sei. und Ang. Math., 168 (1932), 106—116. Gallagher, P. X.: Bombieri's mean value theorem, Mathematika, 15 (1968), 1—6. Pan, Cheng-dong: On the representation of large even integer as a sum of a prime and an almost prime, Ada Math. Sin., 12 (1962), 95—106. Praehar, K.: Primzahlverteilung, Spr, Ver, (1957). Biehert, H. E.: Selberg's sieve with weights, Mathematika, 16 (1969), 1—22. Wang, Yuan: On the representation of large even integer as a sum of a prime and a product of at most 4 primes, Aata Math. Sin., 6 (1956), 565—582. Wang, Yuan: On the representation of large integer as a sum of a prime and an almost prime, Set. Sin., 11 (1962), 1033—1054. Bap6aH, M. B.: HoBbie npHMeHemm 6ojibuioro pemera KD. B. JlHHHHKa, Tpy. HH. Mai. u.u. B. M.
[13]
PoManoecKoeo, 22, 1961. Bap6aH, M . B.: IlnoTHOCTb Hyjieii L - p w o B .iwpHxpe H 3 a « a q a o cjioweHHH npocTbix H n o i r a npocrbix •mean, Mar. c6, 61, (1963), 419—425. ByxiuTafi, A. A.: HoBbie pe3yjibTaTH B HccjieAOBaHHH npofijieMH rojibA6axa-3ftnepa n npoSjieinbi
[14]
n p o c m x iHcan 6jiH3HeiWB, RAH CCCP, 162 (1965), 739—742. ByxuiTa6, A. A.: KoM6HpHaropHoe ycnjieHHe Merafla spaToccjjeHOBa peuieTa, VMH
[12]
(1967), 199—226.
CCCP,
22,
179 610 [15] [16] [17] [18]
SCIBNTIA
SINICA
BHHorpaAOB, A. H: O IMOTHOCTHOH ranoTe3e unit L-paacm flHpnxpe, HAH
Vol. X V I H CCCP,
cep.
Mar.,
23,
(1965), 903—934. JleBHH, B. B.: Pacnpe^ejieHHe "noMTH npocTbix" qnceji B neji03Ha>!Hbix noJTHHOMHajibHux, nocjieflOBaTejibHOCTHX, Mar. c6., 61 (1963), 401—419. FlaH, MSH-AYH: O npeAcraBJieHMH qeTHbix qaceji B Bane cyMMbi npocToro H HenpeBOcxo^iimero 4 npoCTbix npoH3BeAeHHd, Soi. Sin., 12 (1963), 455—474. PeHbH, A.: O npeACTaBjieHHH qeraux iHceJi B BHfle cyMMH npocToro a noTra npocToro <mcen, HAH CCCP, 2 (1948), 57—78.
180
REMARKS ON A THEOREM OF DAVENPORT* WANG YUAN Institute of Mathematics, Academia Sinica Received 6 January 1975
We use x, a, c to denote the n-dimensional real vectors, \x\ = \{xu...,xn)\
= {x\ +
---+x2n)1'2
the modulus of x, and A an n-dimensional lattice, i.e. a set formed by the vectors
where a i , . . . , a n are a given linearly independent vectors in n-dimensional Euclidean space and u\,...,un are any integers, { a i , . . . , a ^ } is called a basis of A. In this paper we shall use Brun's method to prove the following: Theorem 1.
Let A be an n-dimensional lattice and c»(l
be any given n - 1 vectors. Then there exists a basis { a i , . . . , a n } of A such that ai
- iVcil = O(log 3 N),
1 < % < n - 1,
holds for any number N(> 2), where the constant in " 0 " depends only on A andci's. This gives an improvement of a result due to Davenport. In his original result, the error term should be replaced by O(Ne), where e is any preassigned positive number and the constant in "O" depends on e,A and c,'s. Besides its interest itself, Davenport's theorem is also useful in the study of diophantine approximations and geometry of numbers (see H. Davenport [1], J. W. S. Cassels [2] and C. G. Lekkerkerker [3]). We may also obtain some improvements on generalised Davenport's theorems by similar method. L e m m a 1. (Brun) Let Q be a positive integer and pi < p 2 < • • • < Pr be a set of prime numbers not dividing Q. Let P(Q;pi, • • • ,pr) be the sum of non-negative real *Acta Mathematica Sinica, 18:4 (1975) 286-289.
181 numbers an's, where n satisfies the following conditions: n > 1, n = 0(mod<2), n ^ 0 (modpj),
1 < i < r.
(1)
In particular, P(Q) is the sum of an's with n>l,
n = 0 (modQ).
(2)
If there are M and i? depending only on an's such that P(Q) = ^ + O(fl),
(3)
hereafter the constants in "O" are absolute constant, then there exists an absolute constant a (>0) such that
(4)
P(Q;Pu:.,Pr)>^-f[(i-pj+o(P^R).
We refer to G. Ricci [4] and Wang Yuan [5] for the proof, but the ind n in [5] should now be replaced by n. Lemma 2. Let q be an integer >2 and s,t be integers such that (t,q) = 1. Then there exists an absolute constant K such that there is a positive integer u satisfying (tu + s, q) = 1 in any interval with length not less than i^log q. Proof.
1) Let G be a real number, H = Klog q and q\ = \\
p, where p
p^q
V < log5 q
denotes prime number, 5 = Then
2
£=
Q99 and K is a constant which will be defined later. Y,
l>Si-E 2 ,
(5)
G
where Ex =
Y,
1 and S 2 =
G
^
^
1.
p\q G log6 q tu + s = O(mod p)
Since the number of prime divisors of q is at most 2 log q and
(6) G
m holds for (t,q) = 1, hereafter 6 denotes a number satisfying \6\ < 1 but not always the same in different occurrences, we have
V (x+e)<-^r- Vi + E 1
s2=
p > log6 g
< 2 F l o g 1 " % + 21o gg <4ii'log 4 -' 5 g.
(7)
Set ( l , if n = tu + s, an = < (^0, otherwise,
G
+ H;
in Lemma 1. Let pi < P2 < ••• < Pr be all prime numbers satisfying p|g and P < log"5 ?. Then Ei = P ( l ; p i , . . . , p r ) > ( 7 i J
JJ
A-^+O(p2-99),
P < log5 g
by (6) and Lemma 1, and therefore
lo 2 1 si > ^ 7 r r - fi + ofr^—)) +°( g "^) ^ ^f^ ' (8) lo lo
<51oglogg \ \ g g9// loglogg by Mertens theorem, where 7 is Euler constant and r is an absolute constant. By (5), (7) and (8), we know that there exists an absolute constant qo such that log log q 2) Suppose 5 < qo. By Eratosthenes sieve, we obtain
s
=
£
1= E
G < u < G + ff (tu + s,q) = 1
G
=2 ^ d|?
E Md) d\{tu+s,q)
E
G<«
= H]\(l--\+6q>vK
i = "E^r+0Ei
ff
d|9
d|?
log5"1 g + 6q,
where v is an absolute constant. Since q < qo, we may choose K sufficiently large such that E > 1. The lemma follows from 1) and 2).
183 Lemma 3.
Let b j , . . . , bn be a basis of A and n a, = _ ^ Vijbj,
1< i <m < n
j=i
be a set of vectors in A. Then a necessary and sufficient condition that a i , . . . , a m can be extended to a basis a i , . . . , a^ of A is that the determinants of all m x m submatrices of (vij),
1 < j
1
have no common factor. See J. W. S. Cassels [2]. Proof of Theorem 1.
Let t>i,..., bn be a basis of A and n
Ci = YirVhi>
1 i n
(9)
^^ '
i=i
where r^'s are real numbers. Now we proceed to show that we may choose a basis n ai = _ _ U y b j ,
l < i < j
(10)
of A such t h a t
v^ =Nrij+O(\og3N),
1 < j < n,
\
(11)
where A^ is any given number > 2 and the constant in "O" depends only on n and rjj's.
We can choose Vij's with the property: For any integer I < n, the integers Ri = det(vij),
1
1 <j
and SI = d e t ( v i j ) ,
l < i < I ,
2 < j < I + l
are all nonzero and coprime. In fact, we may prove it by induction. Suppose that / = 1. Let v\\ be the integer which is nonzero and has the least distance with Nru and let W12 be the nonzero integer which is coprime with vu and nearest to Nr\2- If j > 2, we choose t>y to be the integer nearest to Nrij. Hence (11) holds for i = 1, j ^ 2. Suppose i = 1 and j = 2. If v\\ = ±1, then v-12 clearly satisfied the above conditions and (11). Otherwise, take t = l,s = 0,q = \v\\\ and G = Nr^, it follows from Lemma 2 that we may choose V12 such that the above conditions and (11) are satisfied. Hence •Ri = vu and Si = v\2 satisfy our requirements.
184 Now suppose that I > 1 and that v^s are well defined for i < I. Choose vij to be the integer nearest to Nrjj if j ^ / , / + 1. Expanding Rj and 5 / according to their last columns, we obtain
Ri = ±vnRi-i
+ A and
5/ = ±vIJ+1Si-i
+ vuB + C,
where A, B, C are definite integers. By the assumption of induction, i?/_i and S7_i are nonzero, (-R/_i,5/_i) = 1 and 5/_i = O(NI~1), since 5/_i is a sum of (I — 1)! products of I - 1 Vij's. If S/-1 ¥" =tl> then by Lemma 2 with £ = ±.R/_i, S = A, q = |S/_i| and G = iVr// we may choose VJI such that Rj ^ 0, (i?/, 5/_i) = 1 and w/7 " ^ r / 7 = O(log 3 15/-!|) - O(log 3 N). If 5/_i = ± 1 , we may clearly choose VJJ satisfying the above requirements. If Rii 7^ ± 1 with this vn, then by Lemma 2 with t = ± 5 / _ i , 5 = vuB + C, q = |i?/| and G = Nrjj+i, there exists w/,/+i such that Si ^ 0, (SI,RJ) = 1 and w/,7+1 - NrItI+1
= O(log3 |i?i|) = O(log 3 N).
Otherwise, if Ru ^ ± 1 , we may choose evidently w/,/+i satisfying the above conditions, (11) follows by induction. Since {Rn-i, SVi-i) = 1> it follows from Lemma 3 that we may choose an such that a i , . . . , a n is a basis of A, and finally ai-Ncil
=O(log3N),
l < i < n - l
by (10) and (11). The theorem is proved. References H. Davenport, On a theorem of Furtwangler, JLMS 30 (1955) 186-195. J. W. S. Cassels, An Introduction to the Geometry of Numbers (Springer, 1959). C. G. Lekkerkerker, Geometry of Numbers (North-Holland, 1969). G. Ricci, Sur la Congettura di Goldbach e la costante di Schnirelmann, Ann. del. R. Scu. Nor. Sup. di Pisa 6 (1937) 70-115. [5] Wang Yuan, On the least primitive root of a prime. Ada Math. Sin. 9:4 (1959) 432-441.
[1] [2] [3] [4]
185
Vol. xx No. i
S C IE N T I A
j.™.. Feb. 1977
S IN I C A
ON JIHHHMK'S METHOD CONCERNING THE GOLDBACH NUMBER WANG YUAN (3E
7t)
{Institute of Mathematics, Academia SiniccO Received February 5, 1976.
ABSTRACT
In this paper, some conditional results concerning the Goldbaeh number are proved. ple, assuming that the density hypothesis of §(s) is true, the inequality "i
(ln.AO ' 3
,.
For exam-
\N — p — p'\ =£ C(E)
always has solutions; here e is any pre-assigned positive number and p, p are primes.
It seems that there is a gap in JIHHHHK'S original proof of the similar theorem.
I.
INTRODUCTION
The even number that can be represented as a sum of two odd primes is called the Goldbaeh number. The binary Goldbaeh conjecture may be stated that every even integer > 4 is a Goldbaeh number. Let 0 < v < 1/2 and T > 0. Let N(T, v) denote the number of zeros of Riemann's zeta function f(s) in the rectangle -• + v < < r < l ,
U| < T .
(1.1)
Now, let us state the Riemann hypothesis ( R ) and the density hypothesis ( D ) as follows:
(R)
N(T,v) = o, (o
r>oY
and (D)
N(T, v) = OCT^-^Cln (T + 2 ) ) O ,
(o < v < — + e, \ 37
T > 0), /
where r and c ( > 0) are constants, g is any pre-assigned positive number and the constant implied by the symbol "0" depends on e only. Since
ivT0(r)>cJv'(r,o), ( T > T 0 ) ,
(1.2)
where c and To are positive constants and N0(T) denotes the number of zeros of f(s)
186 No. 1
ON JIHHHHK'S METHOD CONCERNING GOLDBACH NUMBER
17
satisfying
|*| < T ,
(1.3)
(cf. A. Selberg [4] and N. Levinson [ 2 ] ) , there is no need for us to consider the case v = 0 in (D). Since £(s) has no zero near the line a = 1 (cf. H. M. BiraorpaaoB [5] and H. M. Kopo6oB [ 6 ] ) and N(T, v) is comparatively small for — + e < v < — 2 37 (cf. M. N. Huxley [ 1 ] ) , we need not consider the case 37
h £ < u < —• either. 2
We use N to denote even integer, p, p prime numbers, c positive constant, e any pre-assigned positive number and c(e) positive constant depending on e only. However, they are not always equal to the same values. Theorem 1.
Suppose that
N(T, vXc(e)2 71 - 2 »ln(r + 2),
(o < v < — + eV v 37 *
(1.4)
Then for any given N, there exist p, p' such that 148,,
\N — p — p'\
(1.5)
Suppose that
F(r,v)
(o
37
(1.6)
/
Then for any given N, there exist p, p, such that \N — p — p'\ < c ( e ) ( l n i V ) 3 + 5 .
(1.7)
In general, we may prove Theorem 3.
Suppose that \cTl~2v (M(T + 2))r,
forO
#(2»<J
1
Lya-^/ci+e,)
for
(1-8)
a < v <
where a, r, e t are constants 0 < a < 1/2, r ^ — 6a and Sj > 0. iV, f/iere exist p, p such that
T/iew /or <ww/ grwew
\N - p - p'\ < c(e) (ln^)C3+r)o-2«)-'+e_
(L9)
We have also Theorem 4. Let q and N he two given positive integers such that q
e(s), where h satisfies 0
187 18
Vol. XX
SOIENTIA SINICA
The proofs of these theorems are based on JIUHHHK'S method (ef. KD. B. JIHHHHK [7]). Theorems 2 and 4 give some modifications of the corresponding theorems in [7], where JIHHHHK also stated a result that under the truth of (1.4) with 0 < v ^ 1/2, the right-hand side of (1.5) might be replaced by 0((lniV) 7 ). The present author, however, is unable to understand his arguments. It may have existed a gap in his proof. (See Remark in V.) II.
SEVERAL LEMMAS
We use the notations x = N~r + 2itiS, ( 0 O < l ) , <W~
2
lnplnp',
(2.1) (2.2)
(2.2)
«,(&,#)= S ^ T C O ,
(2.4)
where 2 j denotes a sum over all zeros pk = fik + itk of f (s) in the critical domain 0 < C T < 1.
S2(S,i\O= 2
x-^rCft).
(2-5)
flf,(d,^)= 2
^TCft).
(2.6)
Lemma 2.1. For — 1 < cr < 2, we Ziave
r(«)
d9 = ^ 1 e" w « /w .
a;
e
Jc (jv-i
+
2^3)2
^g
'
where C denotes the closed contour which contains a segment [ — B, R ] and a semicircle jBe'^O <
^
A(n)A(n)
= Q(N) + O(*/~N(.lnNy').
Lemma 2.4. Suppose that Nx = JV + H, where H denotes an integer satisfying H = O(VN (In A^)2). Then
188 No. 1
ON JIHHHHK'S METHOD CONCERNING GOLDBACH NTTMBE3
19
Q(NO = e \ \ 8(9, Nye2'iN^d& + O(ViVCln^)2).
(2.7)
Lemma 2.5. We have tf)2)-
8(9, 2V) = x-1 - 8,(9, N) + O((ln
(2.8)
Proof. From Mellin's transform, we have Ks)x-!jr
flf(d, A") = - ~—\
(2.9)
(s)ds.
Obviously, we have
#"~*
==
\\x\s
e-'°(?-
e*'-'""*^
First, suppose that 9~^Q.
arct
*sy,
for
9 > 0, C2 10")
Shifting the line of integration in (2.9) to the line
a = — —, we have
8(9, N) = x"1 - 8,(9, iV)
— [~*+'°° T(s)x~' -£ (*)<&•
2nri J - { - • • »
Q
(2.11)
Since - f ' ( - — + **) = O(ln(|*| + 2 ) ) Q \
2
(2.12)
/
(cf. Prachar [3]), we have by (2.10), (2.11) and Lemma 2.1 that
rT+'" T(s~)x-S -£-' («)<& « r*"1 e~'""g^~\ntdt J-|-i»
^
J2
« f" r : e"' " c t K ^ In tdt « 1,
(2.13)
for the ease N9 < 1. Now, suppose that iVa ^ 1. Then —^— <arctg —^— <—^—, ixN9 2xN9 2TTN9
and J-i-.oo
r(s)x~' -^ (s)ds « Q
+ f"
J2
(2.14)
e "»N» r 1 In trf*
e'l^TF r 1 In *d* « (In N)2.
(2.15)
Substituting (2.15) into (2.11), we have the lemma. The ease 9 < 0 may be treated similarly. The lemma is proved. Lemma 2.6. (JIMHHHK [7]). Suppose that -r\ satisfies — > 77 ^ 4iV-1. T&ew we have 4
189
20
SCIENTIA 8INTCA
P' | 8&,ff)| 2d9 « S
E (**. + 1)'* "*
X (t fc + I)"*,"* i?1-**,-"*.
^
I h1 — hj + 1
and
f2' i«3(&, ^ ) i 2 ^ « S X
Vol. XX
S
CI**,I
e-
(
'^+%'arctg7^r;
(2.16)
+ D"**-*ci**,i +1)**.-*
1 ^"^"^(-""-sW). I *»,-**, I + 1
(217)
We need also gome results concerning the critical zeros of £ ( s ) . Lemma 2.7. In any interval it, t + 1), the number of critical zeros of f ( s ) does not exceed c l n ( | t | + 2 ) ( c / . Prachar [ 3 ] . ) Lemma 2.8.
(BHHorpaAOB [5]-Kopo6oB [ 6 ] . ) f ( s ) Tias MO sero in the domain
(2.18) Lemma 2.9. (Huxley [ 1 ] . ) We to« 37 iV(r, v) «
3Cl-2i>) 2.2(1+2.)
+ r f
/
w
8 . _
21 (2.19) <
v
<
1
)
where the constants implied by the symbol "<3C" depend on s only. From Lemmas 2.1 and 2.8, we have Lemma 2.10. Suppose that 0 < 9 < 8JV""1.
Tfeew we 7iaw
^ ( 3 , iV) = O(JVe- f
(2.20)
Lemma 2.11. We have f \8(9, N)\2d9 = —N]nN+ 0(Nlnln3N). Jo 2 HI.
(2.21)
JIHHHHK'S METHOD
Lemma A . Suppose that N~i < K = X(iV) < — . If 4 (" \81(9, N)\2d9 Jo
« JV(lniV)- £ / I 0 ,
(3.1)
hereafter the constants implied by the symbol "
190 No. 1
ON JIHHHHK'8 METHOD CONCERNING
GOLDBACH NUMBER
21
\N — p — p'\ « K"1 O-nNY'2.
(3.2)
J ( # i ) = \* S(.S,Nye2*iNSdd. J-« Then by Lemma 2.5 and the Schwarz inequality, we have
(3.3)
Proof. Let
(3.4)
d9 + B, -*
2
x
where |B | < 2 ( " |ifif^d, iV>|\te + OCBO,
(3.5)
Jo
in which
«, = J\*-^\* iS^NWdS + A/«r/^(lniV)2 V J» |*| 2 Jo
\
Jo \ x \ 2
+ y/» j * | ^ ( d , i V ) | 2 ^ ( l n i V ) 2 + (lnJV)4. From Lemma 2.2, we have rs j s * " ^ ^ = J-« a;2 Since we have
N
-*,/„ + 0([°°d9\a Nie-N>/N + 0 ( K - 0 2 \J* d /
Jo | x | 2
(3.6)
(3.7)
Jo N-2 Jw-« »>
(3.8)
it follows by (3.1), (3.4), (3.5), (3.6), (3.7) and (3.8) that J(2V,) = iV16-N-/N + O(iV (In iV)- 6/M ).
(3.9)
H = K-'OnAO 672 ,
(3.10)
Denote and
r(9)= S
e2""9.
(3.11)
0
Then we have
|T(9)| < |»|-l
(3.12)
for d 6 [K, 1/2] and 9 € [ - 1 / 2 , - K ] . Let r = [4/e] + 1 and a; = xy + • • • + xr, where 0 < Xj < if, (1 < j < r ) . Further let ^ denote the integers of the form N + x. Then we have from (3.9), (3.12) and Lemmas 2.4 and 2.11 that
2 9(^0 = « S f, S(d, #)2e2'"7'.9
+ O(-v/¥ffr(ln^)2) = e S Ntf-W + (KNH'Qn iV)-£/20)
191_ 22
SCIENTIA SINICA
Vol. X X
+ 0 (fl"r(ln N)~"/2 [* 18(9, 2V) 12d») = eN 2 e-'(l + 0(2\r».ff)) + O(i\rfl"r(ln #)- 6/2 °) = NHr(l + O(ln i^)-E/2°) > 2, for TV > e(s).
(3.13)
The lemma follows. IV.
T H E ESTIMATION OF INTEGRAL
Denote M= [21nNl
and Mt= [inN - cQnN~)i] + 1.
(4.1)
In this section, the constants implied by the symbol "
(o < v < — ) ,
(4.2)
where r is a constant and ^(v) is a non-increasing function satisfying — ^ /t(v) ^ 3. Then \8l(9,N)\2dS
t
~ s ~ A -S-^"^-M-A 1 ^(i n _^)2+r. (4.3)
T-=2Nn.
(4.4)
^]-^"^
1) Let
Then we have #^2^8,
-J-^arctg^— >—.
(4.5)
Hence it follows by Lemma 2.6 that P' \82(9,N)\2dd«Z1
+ S2!
(4.6)
where
'B 2 >0
X
"u ! 1^ , e-^,+^'^, I **, — hj + 1
(4.7)
and S2 is obtained if the condition pki < /Sfcj in It is replaced by /Jfcj > /9fcj. Clearly 2:, < ! ; „ + 212 + Z13,
(4.8)
192 No. 1
ON /IHHHHK'S METHOD CONCERNING GOLDBACH NUMBER
23
where
OO^OVr
0
X
ttcfi'NT
X
i-
(49)
e-(%+tK)M*T
0<«t 2 « t l
1 e-<'*1+<*2V4«rj I *Jc, — tkt I + 1
(4.10)
and J o is obtained if the condition concerning tki and t/Ci in S12 is replaced by 0 < **,<**, and tk2>NT. 2) Obviously, we have «
tr+l)T
^•12« 2 J
2 J ^Si>?
2_I
s=N
PKl
2J
|, _
%
1=1
I'fc,
f
, ,
1
»fc,l + -
e
1
Hence it follows by Lemma 2.7 that
s a « n~lT S
" S i5 ^ L se~'/411 « 9?"12'2 S ^ln sr > 3 e~sM"
S
« JV2 (In iV)3 e-N/8» 2
s l n s 3e
) "'/8" « ! •
(
(4-n>
Since 2 13 satisfies the same relation as ^ 12 , we have by (4.8) that (4.12)
Sl«In + l. 3) Let Im denote the interval we have
—+ L2
m
~ , M
2
1- — . Then from Lemma 2.8, if-I
2n=i>u(m),
(4.13)
».= i
where
o« B l <wr
X
^
o<«B2
e-»*, + '*, Wrf .
(4-14)
Z u (m) « 2ffl(ffl) + Zn 2 (m),
(4.15)
I**,-'*,! + 1
Obviously, we have
193 24
Vol. XX
SCIENTIA SINTCA
where
2u.w = 2 X
and
2
2
<(Cj<(/+2)r
17 ? I o - i «" ( '*' + l *' V 4 r f . I »*, — ffc21 + 1
2i»(m) = 2 X
(**. + D'* "* (**, + D^-V-'*-'*•
2
2 e-
I**,-**,! + 1
(4-16)
(**, +1)'* "* (**, + D"*.-*^*.-**.
(t +
K 'K)M«T.
(4.17)
4) Suppose that m > 2. Since 1 « (iVr)1/M « 1, we have
2n,(m) « §
((s + l)Z0»*-y-w*. ^
2
ln(s+ 2 ) y
e-'^
sT
« ^ V " * 0 n ^ ) ! 2 0 + i)WMe-'/4"iv ((* + i)y,
TO
)
« r ^ " + " ^ ^ ~ ^ 7j-2WM (In ^) 2+r 2 ] (s + 1)"^ + "^X 1 '"^ e-'/4" « I «
v
«A
M'V^MA
"''(lni^)2^.
(4.18)
For the case m = 1, it follows by Lemma 2.7 that N-l
2m(l) = 2
/ =o
(In (s + l)r)2e-'/4*iVr((s + l)r, 0) N-l
« T(ln iV)3 2
(s + l)e- 5/4 " « iVij (In N)3.
5) From Lemma 2.7, we have
J,u(m) « I7"1 2 x
2
2
*=[(j+2>n
p«,
« r- 2
/ =o
((« + l)r)"*-* i,l-w*, e-'/te
2
2
(**1 + i)"*.-ie-*'/4"T
Pkt,pkle'm sT
(Cs + i)T)'*r*,'-»». «-'/*•
(4.19)
194 No. 1
ON JIHHHHK'S METHOD CONCERNING GOLDBACH NUMBER
25
00
X
(x + 2yh~i
2
e~*MltT In (a; + 2)
N-l
« T~l 2
( 0 + l)Z7)**i-H1-J/i*.e-'/4"
2
a;**.-* e-'Mln (x + 2)dx
X f°° J [CJ+2)T]
N-l
« 2
((« + l)27)w*r1»71-2''*«e~"'4'
S
(4.20) X f°° /fc,->e-» f <
/4lt
2m . fra-lV,
ln(j/ + 2)dt/
2m\
I ^•^"("B"X
7m-]V, Zm\
"="; ,^-B-A'-ir; ( i n Ny+rf
tor m>2,
(4_2Q)
2
[^(lniV) , for m = 1. Trom (4.12), (4.13), (4.15), (4.18), (4.19) and (4.20), we have S1 « NrjQnNy + 2 iV^" + " ( 2 ^ i ) ( l "^ ) ^"(^X 1 -^-) ( l n iy)2+r> m=2
Obviously, X2 satisfies the same relation as Si.
(421)
Therefore we have by (4.6) that
f2"1 |S2(d, N)\2dd « ^7?(ln Ny + 2 i^"S" + " ( "^ X '-B-J^I-B-X l -^r) ( l n Ar)2+r_ n>=2
(4.22) (4-22)
Similarly, we may prove that (4.22) holds also, if 82(9, N) is replaced by $ 3 ($, iV)' Since f" 18^9, JO 12^9 < 2 f2" |flf,(d,iV) 12d9 + 2 (2" | &(», ^ ) 1 2 ^ , (4.23) Ji)
Ji
Jij
hence we have the lemma. V.
THE PROOF OF THEOREM 1
Let _148_£
N = K(iV) = (ln iV) 13 2 _
Let £l
= l(T3e and M2 == [2 f— + g^ lnivl + 1 . L \ 37 / -I
(5-1)
(5.2)
Then it follows from Lemma 2.9 and the supposition of the theorem that there exists a positive constant e2 = e 2 (s) such that N(T,v)«\
fT 1 - 2 "ln(T + 2), for v € J m ( K m < M 2 ) , x (1_2U) } , for v e / m (ilf2<m
(5.3)
195
26
Vol. XX
SCIENTIA SINICA
hereafter the constants implied, by the symbol "<SC" depend on e only. Let L be an integer such that
(5.4) Then
« Ji£_ fii\
( ln Ny « ^(in ^)-e/io2 V ,
(5.5)
for 1 < i < L and ^ J\fM + T+i^ m=M2+l 1
«^i+^
M > ( l n JV)2 <<; jyr M + TfT^
M-l/il)l + e 2 V ^2 / +
S
2
2Mi
I+H' « (lnJV)3«iV6
_ S 2 ,flnNl' / 3
2
M ^ (ln
«i\r(lni^)- 2 .
Ny
(5.6)
Hence by Lemma B, we have
(
S/2'""1
_ 13 ,
I ^ C ^ i V ) ! 2 ^ « iV«(ln Ny 2~' + iV(ln iV)-£/1° 2 38
,
«/2'
+ #(ln NT2 « JV(ln NTe/l° 2~^'
+ iV(ln N)~2.
(5.7)
Obviously, we have by Lemma 2.10 that (•«/2L Jo
I^CS,^)!2^^
Ci/N Jo
,„
|-S' 1 (d ) JV)| 2 ^«iVe- £fI ' w/ .
(5.8)
Consequently, it follows by (5.7) and (5.8) that C*
2
J^
CW2'-1
j o |^(d,iV)i (Z&= 2 J s / 2 , +
f»/2L
Jo
|Si(3,^)|2cZ9
I £,(3, JV) 12 da « iV(ln Ar)-e/io _
( 5 9
)
Hence, Theorem 1 follows from Lemma A. We omit the proofs of Theorems 2 and 3. They are parallel to the proof of Theorem 1. Remark. In his original proof of a theorem which is similar to Theorem 1, JIHHHHK used the following arguments: "Hence, it is sufficient for us, if the inequality
jyi+wo (ikY~^ « \ 2' ) or
ik.« or
1
7
N
(lnN)7
1__
2v-
196 No. 1
ON JJHHHHK'S METHOD CONCERNING GOLDBACH NUMBEB
holds for 0 < v < — —
27
^—^" (cf. p. 515 of [7]). If we take r = 1,
and HN = (lnJV)~7, then the above inequality is not satisfied with v =
. 2 (In N)wln Hence it seems to me that the conclusion O( (In iV)7) should be replaced by
VI.
THE PROOF OF THEOREM 4
1) Denote
ffGO-f1'
i0TX
(•0,
Tx=
S
=X
°
((U
>
otherwise,
ZCOe2""'*,
S(9, iV, Z) = 2 A(w)Z(w) e~",
(6-2) (6.3)
n-2
8^9, N, X) = 2 «~ Px r(^),
(6.4)
•where ^ j denotes a sum over all critical zeros of L(s, X). Then similar to Lemma "x 2.5, we have SO, N, X) = ^ x
where
2 - 8&d, N, X) - S2(9, N, X~),
S2(.9,N,X) = 0«lnNy).
(6.5) (6.6)
Since S(— V
+ 9,N)-~
2
/
- ~ J] fxZ(o)flf(d, i^, X) + O((ln iV)2), qp(g) X(J
(6.7)
for (a, q) = 1, where ^ j denotes a sum over all character mod q, and since r%0 = (i(q) and | r z | < \ / 2 for all X mod g (cf. Prachar [3]), we have 8 (— + 9, N\ = ( - f - 2 fzZ(o)(flf1(», tf, X) + »,(», ^ , ^))) 2 + 0(N0n N?) =
'f9!* + - ^ T 72 ( S ^ ( a ) ( S 1 ( 9 , N, X) + 8£9, N, Z))Y qo(2)2x2
f3 2 ^Ca)(i8i(», ^ ; *) + &(3, ^ , ^)) + 0(iV(ln^)2). (6.8) 2
2l q
(' iS^N^^l'dd^NvO-nNy,
J—1
(6.9)
197
SCIENTIA SINICA
28
for — ^
JJ
Vol. XX
^ 2N'1.
2) Suppose that iV1 is an integer satisfying N/2 ^Nt ^N. Let
UN,, ,) = S [I ' «(», A^V"".'**, where ~ > 2q
n
(6.10)
Then it follows by (6.8) and (6.9) that
^ — . N
JoCNi, V) = 2
2 ] e*"™t'« f* #(— + 9, N\ e2'iN^d9
*,!* (o,9,)=l
J~1
\
'
+ 0 ( ^ 0 + O(B2) + O ( ^ ( l n JV)3),
where
(6.11)
*i = S - r - y S j ^ S TXz(o)(/8f1(a, iv, JQ +flf2(»,^, z)) [ ds, (6.12) and B
(' k~' S ^(«)('8 f i(», ^> *) +ft(»,^ ^)) &>• (6-13)
' = S -7^7 2
By (6.6) and (6.9), we have R
i = 2 ^ - ^ r (' E S f ^ ' T, zZ'CoX&Ca, ^, z) +flf,(s,y, x)) «,i«
4
X (|S1(^iV,X)| + O((lnJV) ))^« 2 * ^ (
ln
x?1
J
-i
^)%
(6-14)
and ?1I«
x
(S \T~\
/
S rxZ(6)(Sl(9, JV, X) + S2(9, 2V, Z)) f T d9 1
""" 9,19
X (f'
J-'\M,)=I
/fi 2
S
X"1
^ J - 1 (a.^jij
V'' 2 /
2 fzAf(6)(SI(d, JV, Z) + S2(9, N,X))\ daY2
< 2 ^ - T T (
<
9,19
S^SrvclnW
(O5)
198 No. 1
ON JIHHHHK'S METHOD CONCERNING GOLDBACH NTJMBEB
29
Hence from (6.11), (6.14) and (6.15), we have
+ OCf1))
e^'N^(Nte-N^
UNly , ) = 2 - 4 ^ 7 S
+ 0 ( 2 ^ ( l n t f ) 3 ) + 0 fe /,g\,/2 Nrj«KhiNy»)
= iv-N'/N II Ci + ^ . ( P ) ) + o ( 2 —rV) + 0 ( S 8.^7 (In ^) 3 ) + O ( S
/ J/ ! 1/2 ^ I / 2 (In ^)V2)»
(6-16)
where
ffw.Cp) = '
P
(6-17)
— ( p _ xy;
for pliVi.
3) Let K=(lnJV)~3"*,
Br=(lniV)3+e
and
r=[-^j+l.
(6.18)
Let 2 ] e-2"'9*9.
r(S) =
(6.19)
2r
Let 9Jt be the sum of intervals complementary set of 9JI in
— — —, — + — , 1
.
(0 < o < q — 1) and m be the
Further let Nx denote the integers of
the form Nx = N-q(.hl+
where 0 < h < - ^ - . 2r
J
(6.20)
••• +hr),
Then — < Nt < iV and 2
= 2 f / -»(». ^ye2-'"'^ = I ] /„(#„ 4) + S J>(^» T)'
where
Afc-Wt \
Since
q/
i8f(d,^)2eJ-"''»d9.
y j (jf i i \ = f g(9 NyT(&ye1'"»d9 « «-' P \8(9, N)\2d9 qJ
Jm
(6.22) (6.23)
for 9Cm, therefore by (6.18) and Lemma 2.11, we have
V
-
Jm T(9) « K"1,
i^
(6 21)
J"
199
30
SCIENTIA SINICA
Vol. XX
« Hr (In N)~Er/2 Mn N « ^ - .
(6.24)
Consequently, it follows by (6.16) (notice that WNi(p) = 'P'iv(jp) for p\q), (6.21) and (6.24) that
J = n (i + ^(p)) 2 ^~Ni/N + o ( - ^ 2 -fr-)
+
° (-??-) ~ Ip|I ^ + ^ P ) ) 2 ^i«~"'/w + OCNHranN)-"). (6.25) \ lniv / 9
Nj
Since i\T is even if q is even, hence
II (l + 9 r N (p))>c>0, where c is an absolute constant.
Consequently, we have
J > c Y ) Nle~N^/lf + O(i^ffr ( I n ^ ) " E / 4 ) > », for TV > c ( e ) .
(6.26)
JVfl"',
(6.27)
3e 2 (2r) r
The theorem follows. REFERENCES
[ 1]
Huxley, M. N.: Large values of Dirichlet polynomials, Ada Arith., 24 (1973), 329—346; n , Ada Arith., 27 (1975), 159—169; m , Ada Arith. (to appear.) [ 2 ] Levinson, N.: More than one-third of zeros of Biemann's zeta function are on 0 = 1/2, Adv. in Math; 4 (1974), 383—436. [ 3 ] Praehar, K.: Primzahlverteilung, (1957) Spr.-Ver. [ 4 ] Selberg, A.: On the zeros of Biemann's zeta function, Skr. Nor. Vid. Akad. Oslo; 10 (1942), 1—59. [ 5 ] BHHorpaflOB, H. M.: HoBaa oueHKa (JjyHKUHH §(1 + it), HAH CCCP, cep. Mar, 22(1958), 161—164 [ 6 ] KopoSoB, H. M.: OneHKH TpHroHOMeTpHieCKHX cyMM H HX nptuioxeHHR, VMH CCCP, 4 (1958) 185-192. [ 7 ] JIHHHHK, K>. B.: HeKOTopwe ycTOBHbie TeopeMbi, KacaroniHecH SHHapHbix 3a«aq c npocraMH qncjiaMH, UAH CCCP, 77 (1951), 15—18; HeKOTopue ycjioBHue TeopeMbi, KacaioniHeca 6HHapHwx npo6jieMbi roJibfldax, HAH CCCP, cep. Mar; 16 (1952), 503—520.
200
REMARKS CONCERNING A TRANSFERENCE THEOREM OF LINEAR FORMS* WANG YUAN AND YU KUN-RUI Institute of Mathematics, Academia Sinica ZHU YAO-CHENG Institute of Applied Mathematics, Academia Sinica Received 1 June 1977 Revised 22 July 1977
Let n > 2 and 9\,...,9n be a set of real numbers such that l,9i,...,9n independent over rational number field Q. For a real number x, let ||x|| = min(a; - [x], [x] + 1 — x)
and
are linearly
x — max(l, \x\).
We use £ to denote a preassigned positive number and c\, c2 the positive constants depending only on e, n, 9\,..., 9n.
Proposition A.
There exists C\ such that (£i---x n ) 1+e ||:ri6>i + - - - + : E r A | | > 1
holds for any given set of integers x\,...,xn Proposition B.
satisfying x = maxi<j< n \xi\ > c\.
There exists c2 such that for any integer yn+\ > c 2 , we have y1nX\\\yn+i9l\\---\\yn+len\\>\.
In this paper, we shall use Mahler-Baker's method to prove the following transference theorem: Theorem 1.
Propositions A and B are equivalent.
A similar result may also be established if the e in Propositions A and B is replaced respectively by certain functions E\(x) and £2(2/71+1) which take positive values and tend to zero decreasingly. *Acta Mathematica Sinica, 22:2 (1979) 237-240.
201 Proof of Theorem 1. 1) Assume first the truth of Proposition A. We proceed to show that Proposition B holds. We may assume that yn+\ > 2. Let hn+iOiW = IVn+iQi ~ Vi\,
(1)
l
Since 1,6i,..., 9n are linearly independent over Q, we have
\\yn+i9i\\ > 0,
1 < i < n.
Let ^ = (yn+l||2/n+l^l||---||yrl+l^n||)"||2/n+l^ir1,
1 < t < n.
(2)
Without loss of generality we may assume fi
>
Since
(3)
it is impossible that
1,
1 <j
(4)
\Xk\ < fk • • • Vn,
\yixi -\
\-ykXk+yn+ixn+i\ < 1-
Since the absolute value of the determinant of linear forms on the left-hand sides of (4) is y-n+i and the product of right-hand sides of (4) is also yn+i by (3), it follows by Minkowski's linear form theorem [3] that there are integers x\,..., xk, xn+i not all zero and satisfying (4). The last inequality in (4) yields that yixi H
VykXk +yn+ixn+i
= 0.
(5)
Hence x±,... ,xk are not all zero. By the definition of k, we have
• • • xk
(6)
< ifX • • •
by (3) and (4). Therefore by the identity j/ia;i -\
h VkXk + 2/n+i^n+i = (zi#i H k
1- xkdk + xn+i)yn+i
202 and (1), (2), (4), (5), we obtain k
< ] T Nllyn+i^ll
\xi6x + ••• + xk9k + xn+1\yn+1
»=i k t=l
(7)
(7)
To prove Proposition B, it is sufficient to assume e < 1. Suppose that y n +i > 2 and y1n++£1\\yn+i0i\\---\\yn+i9n\\
e, n, 6\,..., 6n such that
(A^---A^) 1 + !fe||A ; r i 0 1 + --- + Azn0Ti|| > i
(9)
holds for any not all zero integers x\,... ,xn, in particular, for the yn+\ with (8) and those x\,... ,Xk,Xk+i = • • • = xn = 0, not all zero and satisfying (4). By the combination of (6)-(8) and e < 1, we derive that 1 < (AiT• • • \x~k)l+^HAzifli
+ •••+
\xk9k\\
< A f e ( 1 + ^ ) + 1 (5i • • • z f c ) 1 + ^ Hn^i + • • • + xk6k\\ < A^Hzifli + • • • + < A
n+2
xkek\\yn+1yf+l
fc(y n+1 ||y n+1 fli|| • • •
\\yn+19n\\)-nyt+l
= A"+2fc(^.||j/n+1^|| • • •
\\vn+i6n\\)±y:£
n+2
<\
ny-^.
This means that if (8) holds, then yn+i < n ^ k / \ 2 " ( ^ + 2 ) , The right-hand side of the above formula may be regarded as c 2 in Proposition B. Therefore Proposition B follows. 2) Assume now that Proposition B holds. We proceed to prove Proposition A. Let x = max \xA, l
where x\,...
,xn are integers. Suppose that x > 1 and (^•••£ n ||a;i0i + ---+a; n 0 n ||)« <
L
(10)
Otherwise Proposition A is obviously true. Suppose
\ X l 6 i + --- + x n e n + x n + 1 \ = \\x1e1 + --- + x n e n \ \ .
(n)
2(B Set i>i = ( x 1 - - - x n \ \ x 1 e 1 + --- + x n 6 n \ \ ) ± x - \
\ < i < n .
(12)
Since 1,9\,..., 6n are linearly independent over Q, we have ipi > 0,
1 < i < n.
Consider t h e system of linear inequalities oiyi,...,yn, \y% - yn+i6i\ < ip%, \xiyi H
yn+\:
i < i < n,
h xnyn + xn+iyn+i\
(13)
< 1-
Since the absolute value of the determinant of linear forms on the left-hand sides of (13) is ||a;i0i + • • • + £ n (? n || by (11) which is equal to the product of the righthand sides of (13) by (12), it follows by Minkowski's linear form theorem that there are integers yi,...,yn,yn+i not all zero and satisfying (13). If yn+\ — 0, then ipi < 1,1 < i < n by (10), and therefore we have j/j > 0, (1 < i < n) by the first n formulas in (13). This leads to a contradiction, and so yn+i ^ 0. We may assume that yn+i > 0. The last formula in (13) yields xiyi H
h xnyn + xn+iyn+i
= 0.
(14)
Therefore from the identity xiyi +
h xnyn
+ xn+1yn+i
= (xi6i + •••+ xn9n + n -^2xi(yn+i6i -y{)
xn+1)yn+1
i=l
and (10)-(14), we obtain n
\\xi9i H
hx n 0 n ||i/ n + i < ^_Xi|y n + i0i - j/j| < *=1
n
yixjipj i=l
< n ( x 1 - - - x n | | a ; i 0 i - | - - - - - | - x n 0 n | | ) i < n.
(15)
By (12) and (13), we derive IVn+lOl — 2/11 - - - IVn+lQn ~ Vn\ < 1>1 • • • fa = ll^l^l + • • • + Xn9n\\.
(16)
Now suppose that Proposition A is not true then there exists e with 0 < e < 1 and a sequence of integer sets ( x i , . . . , xn) with x = maxi<j< n |XJ| —* co such that {xx • • • £ „ ) £ * ||a:i0i + • • • + xn9n\\ < 1.
(17)
It follows from Proposition B that there exists a positive integer r such that (T^+i)1+*||r2/n+101||--.||Tyn+10n|| > 1
(18)
204
holds for any positive integer yn+i- Let xi,... ,xn be a set of integers such that (17) « and let y±,... ,yn,yn+i (yn+i > 0) be a set of integers holds and x>ns?r satisfying (13) which is induced by x\,... ,xn as above. Then from (15)—(17) and e < 1, we obtain •n/n+i||Ty n +i0i|| • • • ||-n/n+i0n|| < Tn+1yn+1 \yn+i6i - j/i| • • • \yn+i6n
n+1
< r
yn+l\\xlel
n+1
+
---+xn6n\\
n ( x i • • -x n ||a;ifli + • • • +
= nTn+1((Xl
• • • xn)^\\xtf!
X (£i • • • £ „ ) - " ||zi01 -\ <
- yn
xn9n\\)±
+ •••+
x
n
6
n
\ \ ) ^
hXn0n||"
nr^x-iniy^ 2n
<{nsT
n(n+2)
'
_ i . x /
x
)n(Tyn+i)
N _ S.
,
» < (ryn+i)
s_i
".
This gives a contradiction with (18), and thus Proposition A follows. References [1] K. Mahler, Ein Ubertragungsprinzip fur lineare Ungleichungen, Gas. Pest. Mat. 68 (1939) 85-92. [2] A. Baker, On some Diophantine inequalities involving the exponential function, Can. J. Math. 17 (1965) 616-626. [3] Hua Loo-keng, Introduction to Number Theory (Science Press, 1957).
205
Vol. XXII No. 3
SCIENTIA
SINICA
March 1979
A NOTE ON A TRANSFERENCE THEOREM OF LINEAR FORMS WOLFGANG M.
SCHMIDT
AND
(.Department of Mathematics, University of Colorado, USA)
WANG YUAN (EE
(Institute
x)
of Mathematics, Academia Sinica)
Eeeeived September 22, 1978.
ABSTRACT
In this paper, a transference theorem of linear forms in diophantine approximation The proof of the theorem depends on a theorem of Mahler.
is proved.
1. Let m and n be integers ^ 1 and [0,j (1 <J i ^ m, 1 ^ j ^ n) be a given set of mn real numbers. Let ||a;|| denote the distance from a real number x to the nearest integer and x= max(l, \x\~). Property A.
For any given e > 0, the inequality
( n n*«*. + • • • + 6i.*.\\) (*•• • -^) i + e < i N
/
<=i
CD
has only finitely many integral solutions G"i>"""»*OProperty B. For any given e > 0, the inequality ( f [ \\6uVi +•••
+ dmiym\\) (ft- • -gmy+° < 1
(2)
has only finitely many integral solutions (j/i, • • •, ym~). In this note, we prove the Theorem.
The properties A and B are equivalent.
For the case m = 1 and 1, 6n, • • •, 0,B are linearly independent over the rational field Q, we have the result of [1]. 2.
The proof of the Theorem depends on the following:
Lemma 1 ( M a h l e r ) . Let /fc(x) ( 1 < J < O be I Unearly independent homogeneous Unear forms in the I variables x = ( # , , • • • , £ / ) and let S^Cy) ( 1 < k < 0 be I Unearly independent homogeneous linear forms in the I variables y = ( ^ , • • •, y,~) of determinant d. Suppose that all the products cc,% ( 1 < i, j < 0 in
have integer coefficients.
If the
inequalities
206 No. 3
A TRANSFERENCE THEOREM OF LINEAR FORMS
|/»(x)|<X,
277
1<*<*
are soluble with integral x ^? o, then the inequalities lff*(y)l
l
ore soluble with integral y ^= o. See K. Mahler [2] and also J. W. S. Cassels [3]. 3. Proof of the Theorem. If there is a 6i} € Q, then Properties A and B are obviously both false. So we may suppose that all the d'^s are irrational numbers. First, we shall prove that if there exists an i with 1 ^ *' ^ m such that 1, 8n, • • •, 6,-n are linearly independent over Q, then Properties A and B are both false. Since there exist integers au- • •, an not all zero and an integer a0 saah. that a0 + afin + • • • + and!n = 0,
(3)
it follows that (1) has infinitely many integral solutions (Jcalt • • •,fca,)(fc = 1, 2, • • •)• Hence Property A is false. Since 0,-,- 6 Q (1 < j < n), it is necessarily n > 2 by (3). Without loss of generality, we may assume that an > 0. Take e = — —. Then it follows by Dirich2(« — 1) let's theorem that for any given integer t > 1, there exists an integer q such that 1 < g < <"-> and ||0;Jg|| < f1, Take y = aog and c = n max I a< I. Hd^H < ct~\
1 < j < n — 1.
(4)
Then 1 < j < « - 1,
and further by (3) ||0,.y|| = Pma.q\\ = HCfliflrt + • • • + afl-.0,-.n-.)«ll S Iki0,-,3ll + • • • + I k - A n - i d l < c*"1Consequently, we have
IIMl • • • Weij/W*' < (cro-Cc*-1)^8 < c+2r^ < l if t is sufficiently large. Since ||0,-jdl < f 1 and 6a I Q, there are infinitely many integers q satisfying (4) when t runs over all the integers > 1. Hence we have infinitely many integral solutions Qyu'",ym) of (2), where yi = anq and yf = 0 ( j =N» »)• So Property B is false. Similarly, we can prove that if there exists a j with 1 ^ j < n such that 1, By,-••,6mi are linearly dependent over Q, then the Properties A and B are false also. So in the following, we may assume that for l ^ i ^ m , 1, diu •••,din are linearly independent over Q and for K j < n, l,dl}, ••-, 0mj are linearly independent over Q. By the symmetry of the two Properties, it is sufficient to prove the following assertion. If Property A is false, then Properly B is false also. (5)
_ _ _ _ ^ _ ^
207
278
SCIENTIA SINICA
Vol. XXTT
Suppose that there exists e > 0 such that (1) has infinitely many integral solutions (jd, • • •, xn~). Write (6)
Z = xl---xn. For any integral solution of (1) with X ^ 2, we define Au • • •, Am, A by 0<\\0atCi
+ • • • + 0inxn\\
= X~*i (1 < i < m) and Bx,---,Bn
and A, + • • • + Am = A,
(7)
by
x, = XB>,
(1 < j < « ) .
(8)
Then A,- > 0 ( 1 < t < m), Bt > 0 ( 1 < j < r») and Bi + • • • + Bn = 1. The expo•nents A I; • • •, Am and B1; • • •, Bn depend on X. By (1), we have A > 1 + e.
(9)
Let liaT
mia(i
"'"'i"-:) =2P A
(aaX^oo).
(10)
Denote by Xn+i (1 ^ i ^ m) the integers such that 10ft«i + • • • + fl/A + as.+, | = ||0fta!, + • • • + fl,.a;.||, 1 < » < m.
(11)
1) Suppose that p > 0. Then there are infinitely many integral solutions of (1) such that m i n U , , - - - , ^ ) >p>0. A
Write
(12)
17 = max(l, A — (n + m — 1) m i n ^ , • • •, 4 m )).
(13)
Then from (9) and (12), we have — <max(—-—, A M + g
l-(fi + m - l U < L /
(14)
Let x = (a;,, • • •, xn+m~) and y = (j/ I; • • •, yn+m~), and let
(15) and fX-^j/,-,
l
ff,(y) = jz^-/-((? 1 .^y l + • • • + 0m,,-m2/ra + j/,), Since m+n
S
m
/.•(x)fi'.(y) = S
n a;
«+<j/< — S
K
^™+i»
(16)
208 No. 3
A TBANSFEBENCE THEOEEM OF LINEAB FOBMS
279
and since there exists an integral solution of (1) satisfying (12), it follows by Lemma 1 (with I = 1 and d = XV~A') that there exists an integral point y ^ o such that |»i I < ( « + » - 1) x '
1
^
r + A
>,
1 < i < m,
(17)
and \8nyi + ••• +omjym
+ ym+i\
<(ti + m - l ) I 1 ^ r " ' \
l
(18)
By (9) and (14), we have \8iflh + ••• + enjym + ym+l\
< (n + m - l ) ! " ^ "
<(« + m-l)X"+"-1 < („ +
m
< 1,
_
u
;
1 ) z -5^=r-••(irr.c-+-t)p)
(19)
1 < i <«,
if X is sufficiently large. Hence (jylt—, ym~) ^ o. Since the right-hand sides of (17) are all ^ 1 by (13), we may replace the y{ by j?,- (1 < i < m) in (17). Take 8 > 0 such that 1 - in - 1)3 1 + m8
= max
/_j__; V1 + e
1
_
( w+ w
_
1 )
\+ /
5>
( 2 0 )
Then by (14), (17) and (18), we have
( ] I llflitfi + • • • + emlyj) (&• • -gmy+s <
(w
+
m
_
1 ).^i+.) X iTsr T «>+-«>
+ <
' t->+f- l W)
= (« + m — i)»+»(i+*)2:~ "+"1-1 *> 1+'"*
A
>
< (n + m - l)«+»«+«z" " + m " 1 < 1,
(21)
if X is sufficiently large. Since 1, Qxi, •••,Qmi are linearly independent over Q for 1 < j < n, it follows by (9) and (19) that there are infinitely many integral points (i/i, • • •, i/m) satisfying (21) when (x : , •••,«„) runs over all the integral solutions of (1) satisfying (12). In other words, Property B is false. Thus the assertion ( 5 ) is proved. 2) We now proceed to prove the assertion (5) by induction on m. Since p = 1/2 for m = 1, the assertion holds for m — 1. Suppose that m > 2 and that the assertion holds for m — 1. If p > 0, then the assertion (5) is true by 1). In the following, we consider the case p = 0. Take
209
280
SCIENTIA SINICA
Vol. * X T T
(22) Without loss of generality, we may assume that (1) has infinitely many integral solutions (#!, • • •, xn~), such that (23)
~-
•*.)l+J/i
< ( ( n H0"^ + • • • + 0,.s,||) Gv • •^)1+£)1~" < 1 by (7) and (22). Hence it follows by the hypothesis of the induction that there exists a t > 0 such that
(]& lift/* + • • • + em-i,}ym-i\\) (fr • •gm-ly+t < 1 has infinitely many integral solutions (,yu • • •, ym-C). many integral solutions Ctfn" '> Vm-u 0) for s = t. hence the Theorem is proved.
Consequently, (2) has infinitely Thus we have the assertion (5),
REFERENCES
[ 1]
Wang Yuan, Yn Ktm-rui & Zhn Yao-oheng: A note on a transference theorem concerning the linear forms, Ada Math. Sinica, 22 (1979). [ 2 ] Mahler, K.: Ein tjbertragnngsprinzip fiir lineare XIngleichnngen, das. Pest Mat., 68 (1939), 85—92. [ 3 ] Cassels, J. W. S.: An Introduction to Diophantine Approximation, Camb. University Press, (1957).
210 Chin. Ann. of Math. S (1) 1981
A NOTE ON SOME METRICAL THEOREMS IN DIOPHANTINE APPROXIMATION WANG Y U A N
Y U KTTNRUI
(Institute of Mathematics, Academia Sinica)
§ 1. Introduction. Suppose that A is a set in w-dimensional Euolidean space Bn. If (xi, •••, xn) £A implies that (x'ly •••, x'n) £A for any 0
«0i}, - , {<#,}) €^<.
(l;
Further let
»"(A) = g«A(?)
and
Q(h)=±+(q)q-\
Then for almost all (9t, •••, 6n) £Bn, we have
N(h, olr ..., en)=w(h)+o{w(hyQ(hy{\ogyr(h)y+°).
(2)
r
Letg =(g'i, •••, qm) and r = (ri, •••, rm) denote the lattice points in Bm, where #i's a n d r f ' s are positive integers, 6= (#i, •••, 0m) a point i n Rm, q8 = qx9^
the soalar product of q and 8 and d(q) — 2
\-qm8m
!• We also use q<Ji to denote
^ = max(^1, •••, qm) *^h. Similarly, we may define Q
where 0t= (0a, —, 9im) (l^i
(3)
%{h) - 2 $(q) d(q). Q
Then N(h,
0i, - , 6n) -!P-(A) +O(x(h)*(logx(h))*+>)
h o l d s f o r a l m o s t a l l (&!, ••, $ n ) = ( 9 l l t ••-, 9 l m , ••-, 0nl, •-, Manuscript received May 28, 1980.
0nm)€Rnm.
(4)
211 CHIN. ANN. OF MATH.
2
VOL. 1
Theorem 1 gives a modification of a theorem of Gallaghera\ Take Aq to be the set n
of points (xt,---,xn) satisfying 0<,Xi
(K«<w)
and
/t
vxf-scn
Then it is easily proved by mathematical induction that f2~", forT<2"
^ ^7r(l0g-f)' Take Aq = E(q(logq)n).
0th6rwise
-
Then q(logq)n>2" and
^q) - n.i - (ff(kgff)^^g ^.(^(JLQawll))' for g>8. Hence
^(A) = 2 7 T 2 (?(log?)•)-1 (log( q a J n q ) n )) s +0(1)
Obviously Q(h)=O(l). Let N(h, 9t, •••, 6n) denote the number of integers satisfying K j < A and the inequalities and
0<{q6^<^(l
(ft {^,})g(log ? )"
Then it follows by Theorem 1 that N(h, 0U - . , 6n) = (
w
^
log log^+O((log log A) * (log log log A) a+«)
;
(5)
holds for almost all (8lt •••, 9n) £Rn. Let |g|| denote the distance from the real number x to the nearest integer. Then from (6) with some simple combinatorial considerations, we may derive Theorem 3. Let N*(h, 6it •••, 0n) be the number of integers q satisfying ( i l Mill )(log)"<1,
Kq
(6)
Then for almost all (6lt •••, #„) fzRn, we have
N*(h, 6it ..., 9n) = (n j " 1 }
f
loglogA+O((loglogA)*(logloglog/02+8).
(7)
Similarly, we may derive from Theorem 1 that for almost all (9x, —, 9n~) £Rn, the inequality
( n ll^.fl )g(log ? )" + '
(8)
212 NO. 1 A NOTE ON SOME METBICAL THEOBEMS IN DIOPHANTINE APPROXIMATION
3
L e t / ( I ) - 1 and f(k) =/fc(logyfc)" or k(logk)n+'(k>l). Put i = max(l, \x\). Take AQ = .E(f(q1)'--f(qm)) in Theorem 2. Then we may obtain for almost all (0n, •••, flM) €.Rnm the asymptotio formula of the number of lattice points q satisfying max | q{ \ *^h and
ni^?i+-+M-iin/(?y)
(9)
From this formula we may derive Theorem 4. The inequality W\eaqi + -+9imqm\\ f i f e (log ^)" r s ) < 1
(10)
has only finitely many integral solutions for almost all ( # u , •••, 0nm) €zRrm, but
n\\Oaqi + -+0imqm\\ niglUmqT") < 1
(H)
has infinitely many integral solutions for almost all (On, •••, O 6-B. Especially, it follows from Theorem 4 that property A in Schmidt and Wang's"3 transference theorem holds for almost all (6llt •••, 0nm) £RnmThe proofs of Theorems 1 and 2 are based on the method of Schmidt^ and we may also treat the similar problems in non-linear diophantine approximation (Cf. Schmidt [3]). Remark. We propose two conjectures. 1° Suppose that On, •••, anm are n real algebraic numbers such that 1, an, •••, Onm are linearly independent over rational field Q. Then n l|a,igi+-+o, m gj| ng} + «»i. 2° Suppose that
/3IJi=er",
where r(j(l
Put n=l or m=l. Then 1° and 2° are Theorems of W. M. SehmidtW ana A. Baker^ respectively.
§ 2. Proof of Theorem 1. If 2 i K g ) < ° ° , t t e theorem can be proved by BorelCantelli's lemma (Cf. Gallagher [1]). Now we suppose that 2X90 diverges. Evidently, we may confine ourselves to the case (01} ••-, 9n) £Gn. Let
y(q,0i,-,0J=
P(q, qOi-pi, - , q0n-fn),
pi, l < i < n
y(h q, 0i, - , ^n)=
S
Kq, q0i-pi, - , qOn-p»),
l(q)=\1ii-\\(q,6u l(k, q) = \1-\\(k, Jo Jo
»>,0.)Mi-M» q, K - , Ot)del-d0n,
213 4
CHIN. ANN. OF MATH.
I(K q, r)-[-[y(k, Jo
q, 9lr - , 9n)y{k, r, 9U - , 9n)d91-d9n,
Jo
U, «, 9X, - , 0n) -
N(k,
and notice
VOL. 1
± y(k, q, 9X, ••; 9n) a=u+i
N(v, 9lt - , 9n) = ±y(q, 9U - , 9n).
Lemma 1. I(q)=^(q), I(h,q)=$(q)
(12) (13)
K?)=£-£r(g, ot, - , 9n)d91-d9n = [Q-\"q~ny(g, g'^u - , q-i9n)d9t-d9n Jo
Jo
-?-
2 Pi, l
{"-{"Pig, 91-p1> - , 9n-pn)d91-d9* J0
JO
=
iQ°,q) = q-"Pi, (PI,2qXhJO (*-fV(7, 91-p1, -, 9n-Pn)d91-d9n JO 1-SJ.sn
= xjj(q)
q)nq~".
Now we proceed to prove (13). Divide the sum l(k, q,r)= 2 \1--\10(q, q91-p1, - , q9n-pn) i>(, (Pi,a)
Jo
X/8(r, r^-sa, •-, r9n-sn)d91--d0n
into n+1 parts
!(*, g, r)=I0+- + In, where /^ is the sum of all the terms with exactly j indices %, •••, if satisfying
(14)
qpi — rsi = 0.
We first estimate JoIo<
2
Pi, »I
asi-rpntO
arrtl+o
P-fiSfa, qBx-pi, - , q9n-pn)p(r, r9t-su - , r9n~sn)d9r-d9n
JO
r
JO
-^i. 8
- \
.1-Js.
-
8 }
y 8 ( ? , grfll, .-., qffH)
~^
x/3(r,r9'1-^rPL,
..., &„-«*>-**' )dff1-d9\.
Write (g, r) =d, ^ =rfg'and r = dr'. Then we have gs ( -rpi = M . For given ^=£0, p,
214 NO. 1 A NOTE ON SOME METEICAL THBOEBMS IN DIOPHANTINE APPEOXIMATION
5
is determined uniquely modulo q', so we have /o
-,
rOn--^)d8r~den. (15)
Put
J(Xt, .-., »,)-[" -f~ £(?, ff0lf - , ff^0/8(r, r91--^-,
-,
r6n-^f)
xd0r ••<$,,. We proceed to prove that J decreases as a function, of kt when X,f>0 and increases when Xj<0 for « = l, •••, n. Without loss of generality, we may suppose 4 = 1. In faot, for fixed $a, —, 0n and A,a, •-, K, P(q, q&i, —, q6») and /g(V, r ^ — ^ - , —, r ^ n —2—) are the characteristic functions of two intervals on ^i-axis which have fixed lengths and start from 0 and —^— respectively. The measure of the overlap of the two intervals is \"_J(q, qOi, .-, q9.)fi(r, rO,-^-,
-,
r9%-M-)dBu
It is a decreasing function of Xi for A,iX) and an increasing function for Xi<0. Hence J decreases for X^O and increases for Xi<0. From this fact and (15) we have X dBi- • -dejXf -dXn = i/> (q) iji (r). As for I)(j>l), since 2 2 2 [-i1 Kq, qOi-pi,-, qOn-Pn) (Pi,Q)
(16)
JO
x/8(r, rOt-h., —, r^-« B )^i-<^» 1—
= 2
2
2
(Pi, Q)<1C qs,-rp,*O
qsi-rp,=O
Pi
^
[ " -f
J _^i_
Vn
" i8(j, gd, -, qff.)
J -jgn.
x ^s^, r g' t - gfr-fPi., ..., rff^-3h=r^L,
x /8(r, r ^ - - ^ - , - , r ^ - f e ,
re>n_i+1,
..., r ^ ) ^ i - d ^
r^- i+1 , - , r9n)d9r-dSm
f" ...f" /8(g, jfli, - , ^ B ) x,8(r, rOi-^i-,
- , r9%-,-^s=L, r6^j+1> - ,
r9^dJ91-M%dii'-dK-i
q, r)>q~>,
215 6
CHIN. ANN. OF MATH.
VOL. 1
hence
W
"WM(*,
(17)
q,r)q~\
(13) follows by combining (14), (16) and (17). The lemma is proved.
Lemma 2.
P - f V f a 0i, —, en)d6r~d9n = WX>v),
Jo
(18)
Jo
P - T ^ C * , «, «, ^, - , 9n)d6r~den^ ± *Kq)
Jo
?-[ JO
JO
Jo
(19)
g=a+l a
N{h, u, v, 9U •-, enyd9v-d9n<W(u, ^) + 2(2"-l) 2 tf,(q)dk(g), S=ii+1
(20)
where dk(q) = 2 1. d|(j,
Proof (18) and (19) follow from (12) immedeately. (20) follows from (13). The rest part of the proof of Theorem 1 is similar to the proof of Theorem 1 in Schmidt [2], and we omit it here. § 3 . Proof of Theorem 2. If E'K<7)< I =°, ^e theorem can be proved by BorelOantelli's lemma (cf. Gallagher [1]). Now we suppose that 2,ip(q) diverges. We may also confine ourselves to the case (fix, •••, &n) £(?„»,. Let w(0) = 0 and co(h), h~>l, be an increasing integral-valued function which tends to infinity. Set #' = {0} \}{h>0\
a>(h-l)
S" = {h>0\co(h)
we define intervals of order t to be (y2*+v1} (u+l)2*+va'], where u, i>i, Vz are non-negative integers such that i>i<2* and Vi, Vi are the smallest non-negative integers satisfying w2* + i>x € S, (u+1) 2* +1)2 € 8. Lemma 3. Every interval (0, x] with %£S can be expressed as union of intervals U /j of the type described above, where no two of intervals It are of the same order. Proof (cf. [2]). Put L 0, otherwise. y(Q, 6i, - , 0,,)=
2
0(g, Q0I-PI,
-,
Q0»-P«),
Pi, 1«£»
I(g, r) = f - f y(s, 6U -, 6n)y(r, 8X, -, 0n)d01-d0a, &(«,*)=
jGm
J Um
2
U
N(u, v, 0lt •», 0n)= 2 v(g, 0i, "-, 0«), U
216 NO. 1 A NOTE ON SOME METRICAL THEOEEMS IN DIOPHANTINE APPROXIMATION
and notice
7
N(v, 01; - , 6n) = ^y(q, 0u - , 6n).
Lemma 4. (21) I(ff)=«Kff). If q and r are linearly independent (this fact is abbreviated to q, r, I. i.), then Kff, r)=./r(ff)iKr). Jf q and r are linearly dependent (this fact is abbreviated to q, r, I. d.), then
(22)
(23) I (9, r)<$ (q) <£ (r) + (2" -1)A{qu n) » (q) gT1, where A(qt, r-x) is the number of the integral solutions (p, s) of tfie equation giS-r1p = O, 0
n r3
^ 0 . Let
(
qi
qf-qm\
r-L r 2 - - - r m 1 0 I(m"2> /
where Iw is the ZxZidentity matrix. Obviously, det T = q1r2 — q2r1. Write T0f = & = (in, -', ilm)(Ki
andM(?m={(a;a, ••-, xm)\0<x{<M, Ki<m}. -(
y(q, &„ - , 6n)y(r, 6U - ,
= Jlf-"m|g1r2-g2r1|-" 2 f
-f
Then
en)det-d0n
&(q, £u-p1; - , U~fn)
x/3(r, it»-H, - , L2~s«)d£i-d£». (24) Put T(MGm)x-xT(MGm)=D(M). Let Pj and P 2 (P1<=:D(M)c:P2) be two nmdimensional parallelepipeds whose surfaces are parallel to the corresponding surfaces of D (M) with distance *Jnrn. Since
f - ( fi(Q, in, - , Li)/3(r, fM, - , L*)d&-dL = <]>(Q)
•"(
P(Q> tv-fu
- » fi-3V>
x/3(r, €iS-si, ••-, £n2-sn)di!f-dgn
Let M-*o°, then we have (22).
217 OHIN. ANN. OF MATH.
8
VOL. 1
2) T a k e r = ( l , 0, •••, 0) and Ar = Gm, then i/»(r) = 1 . Since all the components of q are positive integers, q and r are linearly independent. Hence (21) follows from (22). (Notice that the proof of (22) depends only on the linear independence of q and r.) 3) Suppose q, r, l.d.. Put /l W =\ \
_22- ... g» \ g* g1 , 1 0 I*"- ' /
£ = TF0 ( (l«Kw).
Evidently, deW = l. We have J>(, S( J TF(Om)
J ITWm)
x/8(r, n f u - « i , - , r1|nl-sn)rf?1---dfn = I 0 + - + I n , (28) where It is the sum of all the terms with exactly j indioes iu •••, if having qxS( — ript = 0. For real a1; •••, an, by the method similar to the proof of (13), we have 2
Ft. si
J Oi
<
2
•"
P(q,qiVi-pi,-",qiV«-pn)0(r,r1r}i-s1,---,r1'on-sn)dr]1--dr]n
J an
%
' -
P(Q, qir/i, - , qiVn)
x /8(r, r W x - ^ ^ i . , - , r^-gA~r^)drA-«H<^(g)
/o
JO
2
f1+O1-
V,, si ^a, «iS(-rij(-*.O ktoi
(29)
2J
•••
0(9, qivi-pu —, gi^n-pj
BiSi-tiPi*O aiSi-riP(=0
x/3(r, rnTi-Si, •••, riife-Sn)^—^
=
2
2
Qt'i-riP&O ais,-rip ( =0 l<«
I
"1
•••[ „ *'
0(a, q*k.-, qi->0
" " "37Ql
n)ql\
218 NO. 1 A NOTE ON SOME METRICAL, THEOREMS IN DIOPHANTINE APPROXIMATION
9
m
Taking ai = gi1 2 f t f « ( K * < « ) , we have 2
2
[
•••[
p(.«< ix, ii Jw(.am) l<»«;»-j »—J
-••• «&.-#.. 2 JO
JO
/3(tf> ?ifn-3>i, —, giLi-Pn)
Jir«j«)
2 f -
p !( .si Pi, s» Jax Oisj-ripi+O g ^ i - r ^ ^ O
Jo,
Hence Ii<( n )«A(ff)^(?i, OST 1 .
(30)
(23) follows from (28), (29) and (30). The lemma is proved. Lemma 5. f -f f -f
N(u, v, 0t, »., ejMi-M.-Wiu,
N(u, v, eu •», e^dffi-de^wiu,
v),
(31)
vy+2(2»-i) 2 +(g)d(q). (32)
Proo/ (31) follows from (21) immediately. Let r
f •••( y(Q, K - , en)y(r, ex, - , en)d0v~Mn
u
-
2 HQ,r)+ 2 I(Q,r)
r
r
U
U
a
<W(u, i)) + 2(2»-l)
2 d.r.l
WtiMqu rdq?
(33)
a.
by Lemma 4. If r is linearly dependent of q and satisfies u
-Q* ——?—P
(a 6)=1
'
'
then 6|g,(K»<m), — < - | - < l . Conversely, if (a, 6)=1, b\qi(l
—<-y
••-, -v-<7m) is a lattice point which is linearly dependent of q and
satisfies w
2
2 ^(fc,-f^W 1
Wo)Mqi, rdgi1- 2 «A(«) 2
Q.r.li.
- 2 *(«) 2
UK*
(0,
6)=1
2 -f-^r1^ 2 Hv) 2 i&= 2 +
219 10
VOL.1
CHIN. ANN OF MATH.
Combining (33) and the above inequality, we obtain the lemma. Takeea(A) = [ z (A)]. Let L,= {(u, v) |«€»S', i>£#', (oi(u), w(i))] is an interval of any order t, w('u)<2'} and let A* = A*(s) be the greatest integer satisfying w(A) <2 S . L e m m a 6.
2 Proof
f •••( (N(u, v, $lt •-, 6n)~W{u,
v)yd0v-d0n^O(s2').
By Lemma 5, every term in the above sum has upper bound
2(2»-l) 2 4>(Q)d(q). U
We first sum over all the (u, 1>) £L, for which (G>(M), G>0»)] is an interval of fixed order t. Since intervals of order t cover the positive axis exaotly once, we have the upper bound
2(2n-l)X(h)=O(2°).
Summing over t, the lemma follows. Lemma 7. There exists a sequence of subsets o\, ov-- in (?„,„ with measure* J
such that holds for anyhGS', Proof
N(h, 0U —, 6n) =W(h) +0(2^s^ + *) a>(h)<2s and (fiu —, 0«) 6GBm\o-s.
W e define a, to be the set of (0lt •••, 0n) £Gnm for which
2 CM, vtaL,
(JV(«, v, 0U ••; 0n)-W{u,
v)y<s*+>2>
f34)
does not hold. By Lemma 6, we have M. = O(s- 1 -'). co(h) <2', then by Lemma 3, (0, w(A)] can be expressed as union of at Ifh€8', most s intervals («(«), w(v)], where (w, v) GL,. For (filt —, 0n) £Gnm\o-,, summing over these (M, V) , we obtain
(N(h, 0X,.-, 0n) -w(h)y=cE
(u.v)
(N(u,«, eu '-, 0n) -wbi,
v))y
(u,u)6l,
by (34) and Oauchy's inequality. The lemma follows. Proof of Theorem 2. Since 2 s " 1 - 8 < ° ° , there exists for almost all (0lt ••-, 0n) £Gnm a s o = So(^i, •••, 0n) such that (0t, •••, 0n) £cr s for s>s0. Suppose that (0±, ••-, 0n) has such a So and h is so large that co(A) >2 So . Pick s satisfying 2*~1
h£S".
220 NO. 1 A NOTE ON SOME METRICAL THEOREMS IN DIOPHANTINE APPROXIMATION
11
Then we have Similarly Since N(h', 6U the theorem follows.
\W(h) -W(h') \<\x(h) -x(h') | <1 | W (h) - W (h") | < 1 - , 0J
References [ 1 ] Gallagher, P . X., Metric simultaneous Diophantine approximation, JLMS, 37 (1962), 387—390. 12 ] Schmidt, W. M., A metrical theorem in Diophantine approximation, Can. J. of Math., 12 (1960), 619—631. [ 3 ] Schmidt, W. M., Metrical theorems on fractional parts of sequences, TAMS, HO (1964), 493—518. C 4 ] Schmidt W. M., and Wang Yuan, A note on a transference theorem of linear forms, Set. Sin., 22: 3 (1979), 276—280. [ 5 ] Schmidt, W. M., Simultaneous Diophantine approximation to algebraic numbers by rationals, Acta Math., 12S (1970), 189—201. £ 6 ] Baker, A., On some Diophantine inequalities involving the exponential function, Can. J. Math., 17: 4 (1965), 616—626.
221 12
CHIN. ANN. OF MATH.
i
7C
m
VOL. 1
^«
*
£ P. X. Gallagher £3«Jgfcia, # & £ W. M. Schmidt W i l f t ^ a . &nm^tfl, MM: 1°. MfJl^m^^i (Pi, - , 0«) €Rn, &4tf
(w5i),
loglogA+O((loglog/>)v»+«),
e -^» «,. 2° W. M. Schmidt i5i7Clft$S&£S*l#£J! ^ ^ T A ^ ^ W M (On, - , 9J)
222
ACTA ARITHMETICA XLVIII (1987)
Bounds for solutions of additive equations in an algebraic number field I by
WANG YUAN *
(Beijing, China)
1. Introduction. Let k be a rational integer ^ 1. Similar to Waring's problem, one can show by the Hardy-Littlewood's method that an equation a2 x\ + ... + as xj = 0, where at, ..., as are given rational integers but not all of the same sign, has a nontrivial solution in nonnegative rational integers xlt ..., xs, provided only that s^Ci(fe). (See, e.g., H. Davenport [3]). Here we use c{f,...,g) to denote a positive constant depending on f, ..., g. As for a bound of these solutions, it was shown by J. Pitman [10] that if s ^ c2{k), then there exists a nontrivial solution in nonnegative integers such that (1)
maxxj
where c2 and c 4 are explicit. Under suitable conditions and if s is very large, the estimation can be considerably improved. (See, B. J. Birch [2] and W. M. Schmidt [11], [12].) In particular, Schmidt proved that if s^c 5 (/c, e), the equation fli^+
•••+asxks =b1y\+
...+bsyks
with positive rational integer coefficients has a nontrivial solution in nonnegative rational integers x l 5 ..., xs, yx, ..., >'s such that (2)
max(xh
yj)
^ max(ah
b/lk+c.
We use hereafter e, e l5 ... to denote arbitrary preassigned positive numbers < 1. The number l/k in (2) is best possible. Although the circle method is still used in the proof of (2), the treatment of the minor arcs is completely distinct from that in Waring's problem. * Supported by the Institute for Advanced Study, Princeton, N. J. 08540.
223
118
Wang Yuan
It was Siegel ([13], [14]) who succeeded in dealing with Waring's problem in an arbitrary algebraic number field by his generalized circle method, and he obtained the result corresponding to Hardy-Littlewood's estimation on G{k). Siegel's result was improved by R. G. Ayoub [1], Y. Eda [4], O. Kdrner [8], R. M. Stemmler [15] and T. Tatuzawa [16], [17] in various aspects. By the combination of the methods of Schmidt and Siegel, we can generalize Schmidt's theorem to an arbitrary algebraic number field. Let K be an algebraic number field of degree n. Let Kip) (1 < p ^ r t ) be +r2) denote the real conjugates of K and let K{q) and K.(q + ri) (rt + l ^q^rt the complex conjugates of K, where rx +2r2 = n. Throughout this paper, the indices p and q are over the sets of integers cited above. For yeK, we denote n
by }'w (1 < / < « ) the conjugates of y and by N(y) = Y\ 7li) the norm of y. Let ;= I
7j (1 < i ^ n) be numbers of K and x ; (1 ^ j < n) be real numbers. We set ^ n
= Y, xjlj
an
n
d define £(l) = £ x}yf
j= i
(1 ^ i ^ n). We use the notations
i= l
lid = max |
S(^)=fe>
and
Eg) = exp (2TUS(£)),
i= 1
where exp(x) = ex. A number y of K is called totally nonnegative if y(p) > 0. Let a1, ..., OLS, / ? ! , . . . , & be 2s nonzero totally nonnegative integers of K. Consider the equation of the type
(3)
<*!%+...+«,% = 0!^+
...+?,£.
A set of numbers Ax, ..., A,, fit, ..., fis satisfying (3) is called a nontrivial solution o/(3) if Ai, ..., A,, / i l 5 ..., fis are totally nonnegative integers of K, not all zero. Set (4)
m = max(N(ai),N{Pj)).
In this paper, we shall prove the following THEOREM. Suppose s ^ c6(k, n, E). Then the equation (3) has a nontrivial solution such that (5)
max(JV(Af), N(nj)) < m1/([+£.
Here and below the constants implicit in or 0 may depend on k, K, e, ..., but not on m. If k = 1, then A,- = Pi, ft = a, (1 < i ^ s) is a nontrivial solution of (3) with (5). So we suppose k ^ 2 throughout this paper. Suppose that a,, ..., as are given integers of K. In the second part of
224 119
Bounds for solutions of additive equations
this investigation we will show that if s ^ c7(k, n, s), the equations a1 al 2\ + ... + as as Xks = 0 has a solution in a1, ..., as, / l 5 ..., ks, where each a, is 1 or — 1 and where Xl (1 < i ; ^ s) are totally nonnegative integers, not all zero, with max N&) < m a x ( l , |N(a,)|, ..., |iV(as)|)c. i
2. Several lemmas. L E M M A 1. Lef fl5 ..., f Pl+r2 ^ e a sef of real numbers r,
(6)
satisfying
rj+r2
I
p=l
X f, = 0-
« = rj + l
Then there exists a totally nonnegative unit a of K such that c8" l e" < a{p) < c8 e",
c8" 1 e'q < \(T(\ < c8 e'9,
where c8 = c8 (K). See, e.g. Lemma 1.1 in Hua Loo Keng and Wang Yuan [6]. (Put a 2. There exists a rational integer c9 = c9 (K) such that for any integers a, /? of K, where fi # 0, there exist a rational integer I and an integer co of K such that 1 ^ / ^ c 9 and \N(k-ctip)\ < \N(P)\. See, e.g., K. Ireland and M. Rosen [7], p. 178. L E M M A 3. For any t integers ) \ , ..., y, of K, not all zero, let y be a nonzero element of the integral ideal a = (ylf ..., yt) with the least norm in absolute value. Then LEMMA
£9! 1',/y,
1< i
are integers. Proof. Set a = y, and P = y in Lemma 2. Then there exist a rational integer /,- and an integer oii such that |W(U-o>,-y)l<|JV(y)|,
K/,
Since /,• yt — &),-yea, it follows that JV(/,-ft—<»,•?) = 0. Therefore /,ft —
7
h \7 J
are integers. The lemma is proved. 2 LEMMA 4. For any t integral vectors (ft, dt) (1 < / ^ t) of K , where y, / 0
225 120
Wang Yuan
(1 < i < 0, if 51
=
=
d,
then
(7i,^)=^yZi(y^),
Ui
where y is defined in Lemma 3, and where 5 and Xi (1 < i < t) are integers.
Proof. By Lemma 3, X\ = c^-lih (1 < ' < 0 are integers. Let yi
it
Then <5; = ay; (1 < / < t). Since ((5j, ..., dt) = <x(y1, ..., yt) = <xa is an integral ideal and yea, 3 = ay is an integer. Therefore c9!
c9!
c 9 ! y;
c9!
\c9\J
The lemma is proved. LEMMA 5. For any nonzero integer
c io = 4max £ \cof\ *
j= I
and
JVP = — - c 1 0 , l
\
a
I
Kp^n-
Since the matrix (a}Jp>) (1 ^ p < r1? 1 ^ j < n) has rank r 1 ; we may suppose det(a»jp)) ^ 0 (1 =$ p, j' ^ rj). The system of linear equations
has a unique solution. Set aj = [xj] (1 ^ j ^ r j , where [x] denotes the r
i
integral part of x. Then we have an integer y = £ a,- a>, satisfying y(p)
j=i
3. Reductions. PROPOSITION 1. Suppose that x ^ 1/fc and s ^ c u (/c, n, x, e). Then (3) /jas a nontrivial solution with m a x (JV(A,), N(/i,.)) «
OT
X+
'.
226 Bounds for solutions of additive equations
121
The case x = \/k is the theorem. One can prove by Siegel's method that if s ^ c12{k, n), then the equation of the type
a, A5+ ... +«,A*-«, + 1 ^ + 1 - ... - M * = 0 has a nontrivial solution in totally nonnegative integers Als ..., As such that max JV(Aj) « max N(a,)Cl3<*'1*,
(7)
i
where a ! , . . . , a s are given nonzero totally nonnegative integers and l ^ f <s-l. It will suffice to prove Proposition 1 when m is large, say m ^ c14(fc, K, x, e). In fact, if m < c 1 4 and s^ c12, then it follows by (7) that (3) has a nontrivial solution such that
ma.\(N(X,), N(pj)) <§ mCl3 « ctf < w ?+E . Let X be the set of x such that Proposition 1 holds. Then (7) shows that X is not empty. It is clear that X is a closed set. Hence the proof of Proposition 1 is reduced to proving that if x > l/k and xeX, then there exists an x' e X, where x' < x. For 1 < 7 < s, set t, = k-' (log N(ot,)1'" + log |aj°| ~l),
1 < i < n.
Then (6) holds, and therefore there exists a set of totally nonnegative units a} (1 ^ j =% s) such that
eg l Nia/'+iaf)-llk
< of ^ c8 N{aj)1'* {af)" x / \
eg J N (<Xj)llnk | a f |" 1/(t < |
< c| N(tXj)lln,
eg * iV (a7)1/n ^ |aj«> fff| < c| AT (a,-)1/n,
1 < j ^ s.
Similarly, there exists a set of units T,- (1 <_/<s) such that c^Ntfj)1*
< |j8j«>TJ**| < 4 A/^) 1 '",
1 < ; < s.
Let Then (3) becomes
(3)'
k a'lX'l +
...+a'sKk
= ft < + ••• + f t ^ -
227
122
Wang Yuan
If Proposition 1 holds for x' and for the particular equation (3)', then we have a nontrivial solution of (3)' such that max(NW), N(^)
< max(N(«;), N(P'j)Y + <.
Since N(ty = AT (A,), N(^ = Nfji,), N(aj) = N(af), N(ft) = AT (ft) (1 < i < s), we have a nontrivial solution of (3) with max (A/(A,), N(fij)) 4mx+c. u i.e., Proposition 1 holds for x' and for (3). Hence we may suppose without loss of generality that a, and ft satisfy
cfs1 A/fa)1'" < a{" < c 15 A/fo)1'",
cfs1 ATfa)1'" < |aj«| < c l s iV(a,)1/n,
CiV ^(A) 1 '" < # " < c 1 5 ^(A) 1 '",
^r, 1 A7(ft)1'" < |j8}«| < c 1 5 A/(ft) 1/n ,
(8)
1 < i < s, where c 15 = c15(/c, K). In what follows, x will be a fixed number > 1/fc for which Proposition 1 holds. Take y sufficiently small such that 1/fc + 6c 13 ny + 20ny < x
(9)
and
22fcny < 1,
and put (10)
x' = max (x (1 - \ y) + y/2kn, 1/fc +6c13ny + 20ny),
so that x' < x. We proceed to prove that Proposition 1 holds for x'. Let e1 — min(e/8x', e/4) and divide the interval [0, 1] into a finite number of intervals (/}• of length < e t . If s is large, one of these intervals / will be such that many of the coefficients a l 5 ..., as are of the type
NioLd^rn',
me I.
We may therefore suppose without loss of generality that N(«,)
, ^ . .^
.x
Similarly, we may suppose !%<+•
'<»<••
Let a* = m1 max A7 (a,) and fc" = ml max N(ft). Let p, and q, be the largest i
rational integers such that N (a,) rf" ^ a"
i
and
N (ft) ^f" < b",
1 < i < s.
228
123
Bounds for solutions of additive equations
Since m ^ c 14 , an/N(ti^ ^ ml and bn/N(fi^ ^ mx, we may suppose
Hence JV(a,)/jf">io"
Nifid^" > \bn,
and
1 < i < s.
Set a| = a, pi, ft = ft «?, A, = p, AJ, ^ = 9 j /<; (1 < i < s). Then (3) becomes (3)', and by (8), a| and ft- satisfy (2c 15 )" J a < a?"> < c 15 a, (2c 1 5 )- 1 a
(2c 15 )" J a < |a,-^>| < c 15 a,
(2c 1 5 )- 1 fe<|ft ( « ) |
l
Suppose that Proposition 1 holds for x' and for the particular equation (3)'. Then there exists a nontrivial solution of (3)' with max (AT (A;), Ntf)) < max (a", bf+tl* < w ( 1 + £ i ) ( J C + £ / 4 ) <^ m*'+«/2. Since /V(af) = ml iV(aj)maxiV(aj)/mEl maxN(a,) = a"m~£liV(a,)/maxN(a,) ^ a B m" 2 e i ,
1 < i < s,
i
we have pf < rf" ^ fl7N(a,-) < m2£l < mE/2,
1 < i < s,
and therefore N(Aj) « p? JV(A0 < w x ' +£ ,
1 ^ i ^ s.
Similarly N(ni)<^mx'+£,
Ki^s,
i.e., Proposition 1 holds for x' and for (3). Thus in proving Proposition 1 for x', we may suppose that (11)
c16a
c16a < |aj«>| < c 1 7 a,
c 16 b < j8lp)
c 1 6 6 < | ^ 4 ) |
l^/<s
for certain positive numbers a, b, where c16 = c16(/c, X) and c 17 = c17(fc, X). 4. Continaation. In what follows, A will be the integer occurring in Proposition 1, and s > h. Set (12)
z = y/2kn2.
cu(k,n,x,e)
^ _ _ _
229
124
Wang Yuan
We distinguish two cases. A. There is a subset of h elements among a l 5 . . . , a s , say a l 5 . . . , <xh and there is a subset of h elements among /? l s . . . , / ? „ say /? t , . . . , j5A, and there are totally nonnegative integers at, ..., ah, i j , . . . , rfc such that (13)
0 < ||T,|| < mz,
0 < ||CT,.|| < nf,
1 < i ^ /i
and
\N{a)\ > m», where a is a nonzero element in the integral ideal {oL-^a^, ..., a.hah, PiTi, ...,phrh) with the least norm in absolute value. By Lemma 5, we may choose a nonzero integer y such that ||y|| ^ c 10 and ya is totally nonnegative. By Lemma 3, a,- =
and
p; =
-,
1 < i < fc
are all nonzero totally nonnegative integers. Therefore it follows from the case x of the Proposition 1 that the equation
a', A?+...+«U? = ft !*?+•••+&/*? has a nontrivial solution satisfying max(JV(A;), JV(/*J)) « max(JV(aO, N(P'j))x+e « „,(!+*«-«(*+«). Let Aj =ff;A,', /I, = T; /i; (1 < i < /z) and Af = ju,- = 0 (Ji < i: < s). Then by (10) and (12), the equation (3) has a nontrivial solution with max(N(Ai), N(nj)) ^ m u+*«-)»<*+*> + « ^
u
m d-w2)(x+ e )
+« ^
m*+£
We are thus reduced to case B. For any h elements, say a 1 ; ..., ah, among a.l, ..., as, and for any h elements, say f}lt ..., f}h, among jS^ ..., /3S, and given any totally nonnegative integers ox, ..., ah, xl, ..., zh satisfying (13), the integer a defined as in the case A satisfies JiV(er)| <my. Condition B depends on k, n, h, m, y, and it is denoted by B(k, n, h, m, y). PROPOSITION 2. Let q = 1 or — l. Let
(14)
m = max (a", b")
and let a l 5 ..., as, plt ..., /Js be nonzero totally nonnegative integers satisfying (11) and B(k, n, h, m, y). Then if s ^ cls(k, n, h, y), the equation
M i + • • • +«,#-& M - • • • -P./4 = «
230
Bounds for solutions of additive equations
125
has a solution in totally nonnegative integers Xx, ..., Xs, fiy, ..., /xs, x, not all zero, with max(JV(A,.), N{jij)) 4 m 1 ' " 2 0 " , i.j
|| z || < m6>'.
Now we proceed to show that Proposition 2 implies that Proposition 1 is true for x'. Let x, x', y, z, h be as above. Suppose that c 12 and c 18 are integers. Let s = uv, where u = c 18 and v = c12. Replace the indices 1 < / < s by double indices 1 ^ i < v, 1
(15)
£ (<xfl ^ + ... +a? u 4-ft, rf, - ... - A ^ J = 0.
i= 1
For each i, 1 < i < u, the coefficients a a , . . . , a,-,,, Pn,...,Piu satisfy the conditions in Proposition 2. Hence there are totally nonnegative integers X'n, ..., A;u, rt'ls ..., / C X.-. not all zero, such that «n ^ ' i + • • • + «.u %* ~ A i A*** — - - - — A« ^ : * = «3i X; with
max (AT W,.), iV(/i;,)) « m 1 ' ^ 2 0 ^ ,
||Zj|| < m6^.
We may suppose that Xi ^ 0 (1 ^ i ^ u). Otherwise we get a small solution straightaway. Take qx = ... = qv-x = 1 and qv= — 1. Then by (7), the equation
has a nontrivial solution satisfying maxNfaMin* 1 3 1 *. i
Let Ay = 7(Ay, /iiy- = JiUlj (1 ^ i < «, 1 ^ j ^ «). Then we have a nontrivial solution of (15) having
max(JV(^), Nfad) < mllk+6ci3"y+2Ony Uj,t,l
< m*'.
Thus Proposition 1 holds for x'. be an integral basis of K, h the 5. Weyl's inequality. Let oii,...,(on different and D the absolute value of the discriminant of K. We can choose a basis gl, ..., Qn of b~ ! such that
S
^
= \0,
otherwise.
m 126
Wang Yuan
Set £, =X1Q1+
a n d n = y l a ) 1 + ... + yncon,
...+xHgn
where x; and yt (1 < / ^ n) are real numbers. We denote by P(T) the set of (>>!, ...,yn) satisfying 0 ^ tfp) < T,
|i/(*>| ^ T;
a sum where /I runs over all integers such that 0 ^ Aip> «$ T, \ki9\ < T,
£ AsP(T)
and
^] a sum of integers /z satisfying \\n\\ ^ T U| 6 P(r)
LEMMA 6 (Siegel). Le? h ^ 1. Then for any £, ?fere ex/s? an integer a and a number fi of t)~ 1 such that
0<||a||
M-f}\\
(0
max(^|ot ^-^"l, |a |) ^ D~m,
1^ i < n
am/ N((a, i?b))
h>2
5
7 (Mitsui). Let A, B, h be positive numbers satisfying A ^ 1,
+ r2
D and 1 ^ B < 2'4~r2 D'^h.
X
min(A,
|l-£(c>JJ.)r
1
Then for any £
(1 < ; < n))
|/i|eP(B)
here and also in Lemma 8, a denotes an integer satisfying the conditions in Lemma 6. See Theorem 3.1 in Mitsui [9]. Notice that in the proof of his formula (3.42), we may use the estimation |JV(a)| > c||a|| instead of |iV(<x)| > cT with c = c(K). LEMMA 8 (Weyl's inequality). Let G = 2kl
and L(f) = X E(#t),
w
»ere
XeP(T)
Let h be a number satisfying +k+r
kl2*
Then
2DTk-i
k
T > k!
25+k+r2D.
232
127
Bounds for solutions of additive equations
Proof. By Holder's inequality X
X1
X1
X
^E£(u 1 r i ^+...f- 2
<2t 2 ii
" - j;E£(u 1 r i {+ ...)|2^2
2k 2 1
xi x
x2 x
4... A,
where (16)
x2
xk^1 x
Ai = / c ! A t . . . V i .
|Ai|eP(2r)
(l^/
and A runs over all solutions of the conditions
X+ X h + ...+XigeP(T)
(1 ^ ( l < . . . < i g ^ k - l ,
C
Let ,4(^) denote the number of solutions of (16). Then by the well-known properties of the divisor function, we have W
lO(T' 2 ),
otherwise.
Hence m
r
^ T"^-^+Tn(G-k)+£2YJ\IdE(fiXO\,
where the summation is extended over all fi, X satisfying HeP(k\2k~l I*-1)
and
XeP(T).
Since £
£(/MC) = ^(T" 1 " 1 min(r, |1 -E(najjC)\~l
(1 ^ 7 ^ «)))
XeP(T)
(cf. Siegel [14], p. 332), we have \L(Zf
4 T*G-»+T"iG-k)+e2ZjT'<-lmin(T,
Let /I = 7 and B = k\2k~l
|L(C)I
Tk~\
(1 < ; < » ) ) .
Then by Lemma 7, we have
^7 ^T
\1 -E(/uojS)\~*
I N I + 7 ^ T + ^ ^ ~ + ~7^J llNI + T + 7*/
233
128
Wang Yuan
The lemma follows.
=*
6. Schmidt's lemma. In this section, we shall generalize Schmidt's lemma to an arbitrary algebraic number field. £3 LEMMA 9 (Schmidt). Suppose that T > cig{k, K, e3), C ^ T" and |JL(£)I ^ C. Then there exist a totally nonnegative integer a and an integer f} such that
and 0
fT"\G
("c) r''
where a = a'y and fi = /?'y in which y is an integer satisfying \\y\\ ^ c2o(K) and a', P' satisfy the conditions of Lemma 6 with h = 7Jc~E3(C/T'I)G.
Proof. We have / r \G
/T''-1/C+£3\G
and
Let
Then /i satisfies the condition of Lemma 8 for T^ c19. By Lemma 6, there exist an integer a' and a number /T of b " J satisfying
Ha'S-Zni*:*- 1 ,
0<||«'||
and the other conclusions in Lemma 6. Take E2 = £3/2G. Since
and T""1/G+£2^C7^2"£3
we have by Lemma 8 that
c^iL(ai«r" +t2 na'ir 1/G ,
234
129
Bounds for solutions of additive equations
i.e.,
There exists a nonzero integer yy such that ||yx||
(o, b) = l.
We write •• -> a. Let t > 1 and F(t) be the set consisting of y = x, QX + ... ... +xngn satisfying (xj, ..., xn)eGn,
x, (1 < i'^ n) rational numbers, and
y->a
N(a) < t".
Let h = abm20ky-yln
(17)
and
t = mytn.
For any ye.T(t), subject to y -* a, we define the basic domain B r by {(xu ..., xn): (xj, ..., x n )eG n , ^ = x ^ ! + ... +x (I e (1
(18)
such that ft ||^ — yo|| < 1 for some y0 = y(mod b" 1 )). We may prove that if yt ^ y2, then J5yi nBy2 = 0. In fact, suppose there is & £eBn
r\By2, i.e., ^||^-y o ,|| < 1, where yOi = y,(mod b" 1 ) 0 = 1, 2). For
simplicity, we set yOl- = y, (i = 1, 2). Write max W > - y j " | , r J ) =
ffj0,
1 ^ i < «, 1 < ; < 2.
Then
f\of<\,
maxiafy^t,
j=l,2,
i= 1
and thus |y<«-y<0| < |^(0 _ y (0| + 1^(0 _ y 0 ) | ^ ^ - 1 ^ ( 0 + ^ ) )
= h-'af
af^r1+(<•?)-')
^ 2h-lofo2»t,
Suppose yt -* a,- (i = 1, 2). We have JV(01a2)|JV(y1-y2)|<(2r1f3r
Ada Arithmetica XLVIII.2
1 < i < n.
J235
130
Wang Yuan
since m Js c 1 4 . On the other hand, ax a2{y1 — y2)i> is an integral ideal, and thus N(a1a2)\N(y1-y2)\^\N(b-1)\=D-1. This gives a contradiction, and therefore the assertion follows. We define the supplementary domain E by (19)
E = G n-
U B y.
yefW
We use the notations £,
A=b (20)
$(£)=
....+xnQn,
=X1Q1+ ilk
20
m *,
X Ei^XH),
dx^dx^.-dx^
B =a
1/k
20
H = m6",
m \
T,(Z)= X £ ( - A / a
Ki<s,
S(^=nS,(a T(Q=f\Tt(Z) >=1
i= 1
and
F(«= X S(c)T(O£(-^), where q = 1 or — 1. Let Z denote the number of solutions of the equation in totally nonnegative integers At, ..., Xs, nlt ..., fis, x satisfying i,eP(A),
ft,eP(B)
(1 < i < s),
zeP(«).
Then (21)
Z = j ; jF«)dx+fF«)dx.
We shall show that under the assumption made in Proposition 2, Z > 1. 8. Supplementary domain. Take £3 such that (22)
£ 3 <1/2G,
e3(l- + 20y)
and s so large that
(23)
s>l^+fc. z
LEMMA
(24)
10. Suppose that (x 1 ; ..., xn)eGn and
\F(a>H"(ABrm-A.
236 131
Bounds for solutions of additive equations
Then £ lies in a basic domain. Proof. We may suppose that Then F(^)^HnA''(h~1)B'ls\Sh{^rh+1, and thus by (24) and m ^ c 14 , we have |S,(£)| > |S»(0| > Anm-5'is-"+1)
= C,
say for 1 < i < h.
By (20), (22) and (23), we have m S/(.-*+l)
^ ^1/4^.-11+1) ^ ^1/20 <
1 A ^-'3t
and therefore It follows by Lemma 9 that there are totally nonnegative integers
= mz
and ||^ ; CT ( .-
5G
«s-'1+1M£3"'t<m^-k,
1
since m^ cx^.. After a recording of fi1, ..., f}s, we may also suppose that
iT1(£)i>...>iT,(a Similarly, there are totally nonnegative integers T,- (1 < i < /J) and integers ^, (1 < i; ^ h) having 0 < ||T,|| < nf
and
||<SAT,-^,|| < m z B " \
1 ^ i < h.
Hence by (11), (12), (20) and m > c 14 , we have 11% /Sj Tj - IAJ a,ff.ll= 11% 0; T; - ^a, o-,. j3; T ; + {«,ff,-/?j T ; - ^ a, tr,\\ < H/Jj Tj|| ||^a, tr, - Vl\\ + ||a,
+
am2zB"k^m2z-2Oky<\,
and thus
Since ^i/J/Tj —^a,-ff,- is an integer, we have Thus by Lemma 4, the 2/i integral vectors c9!(a, o1,, (/>,-) and c9!(/y,T,, i^,)
237
132
Wang Yuan
(1 < / ^ h) are all integral multiples of an integral vector (a, x), where a is a nonzero element of the integral ideal (ai<7j, ...,a.hah, ^ T X , . . . , f}hTh) with the least norm in absolute value. Therefore the condition in case B yields that 0 <\N(a)\
<my.
Let ff~1Tl) = b/a>
(a, b) = l.
Then a\a, and thus
N(a) <\N(a)\ <my = tn. Since Hc^H < mz, we have
and by (11), (12), (17), (20) and m > c 1 4 , Ir(') _ C T ( ' ) \ - 1 T0')| _
|^(0.-(') ^(0
, n (i)|
^ " ' m ^ - ' = a-lb-lm~20ky = a-1b-lm-2Oky+yl2nk
+ nz
1
1
Therefore <^eBv, where y = a~ x(mod b" )- The lemma is proved. 9. Basic domain. We use the notations C - y = C,
rj = y1a>1+
G,(y) = N(a)- 1 £
...+yna>n,
£(M*y),
dy =
//,(y) = N(a)- 1 ^
•i(moda)
/, (C, /I) =
J £ (a,- ^* 0 ^ ,
G(y) = f l G,(y), '= 1
E(-p,tfy),
/j(moda)
•// = (C, B) =
P(/»)
(25)
dyx...dyn,
J £ ( - A /7k 0 ^ ,
1 < i < *,
P(B)
H(y) = fj «,(y), i=i
/(C, >D = f[ hiC, A) and i=
I
1=1
where y -* o. LEMMA 11. Let a be an integral ideal. Let N(a, T) be the number of elements v of a satisfying 0 ^ v(p) ^ T.
\v(q>\ ^ T.
238 133
Bounds for solutions of additive equations
Then
where To = max(iV(a)1/n, T). See, e.g., Lemma 3.2 in Mitsui [9]. Notice that the conclusion is still true for the number of v satisfying v + nea, 0 =$ v(p) + n(p) < T and \v{q) + i/q)\ ^ T, where /^ is a given number in a residue class mod a. Now we can prove the following lemma by the Siegel argument (see [14], pp. 328-330). LEMMA 12. Suppose that £eB y . Then (26)
St(Q = Gi(y)Ii(i;,A) + O{t2A"-1)
and (27)
Ti(Z) = Hi(y)Ji(t;,B) + O(t2B"-1),
1 < i < s.
Proof. Determine positive numbers 0(O (1 < i < «), with 9W = 0iq + r2\ such that 0(Omax(/iiC(O|, r'A^a) 1 '") n
= D 1/2n f l max(/i|C0)|, r l N(a)l/nyinN(a)1/n,
1 ^ i < n,
Then f ] 0W =
Dll2N(a),
i= 1
and it follows by Minkowski's linear form theorem that there exists ctea such that 0 < |a(l)| < 0(l), 1 < i < n. Hence aa" 1 = b is an integral ideal and
N(b) = |JV(a)| JV(o)-1 ^ (fl tf'Wa)-1 = v ^ ; i=l
hence b belongs to a finite set depending on K only. Let ax, ....,
1^ i^ n
satisfying ||Tl.||=O(||a||) = O(max0 w ) = O(f). i
Let n run over a complete residue system modulo a, and k over all numbers
239 134
Wang Yuan
in a such that X + fieP(A). Then S,(£)=
(28)
£
E(ociMky)
£
£(a,(A + ^ C ) .
/I + / J S P M )
Expressing A in terms of T,- (1 < i ^ n), we obtain ^ = 01*1+
where gi,...,gn
•••+9n^n,
are rational integers. Let G(A) denote the cube
(S,, . . . , Sn): ff = S 1 T 1 + . . . + S B T B ,
gfj^Sj < 3 , - + l
(1 < / < « ) .
Then ||
ii^+^c-^+^cii^iiff-AiiiiciKiiff+Aiir^p+^ir1)^^-1^-1, and therefore by (11), £(a,(A + /i)*C)= f £(a,(a + /i)kC)rfs + O ( a f / i - 1 ^ - 1 ) ) where ds = ds!...dsn. Since iV(a) ^ f" ^ ^l by (17) and (20), it follows by Lemma 11 that the number of X with a\k and A + /ieP(/t) is (^(^(a)" 1 /I"). Therefore X a|/
£(a,.(A + /i)kO =
X
J £(a,(
a|;. G(X) X + fteP(A)
Let F denote the domain in the s-space defined by 0 < a(p) + n(p) ^ A,
\a{q) + ^(«»| < A.
Then the volume of the area belonging to exactly one of
(J
G(-i) and
oi;.
F is dominated by 0{N{a)-1 tA"-1). (See, Siegel [14], p. 329.) Therefore by (17) and (20), we have X
£(a,.(A + /i)*C)= j£(a i (a + M f C ) ^ + O(iV(Q)- 1 f 2 ^- 1 ).
Let
240
_ _ ^ 135
Bounds for solutions of additive equations
we have
E(«i(A + tift) = N(ariIi(t,A)
X
+ O(N(a)-it2A»-1).
A + pePM)
Substituting into (28), we have (26). The proof of (27) is similar. 10. Continuation. We use En to denote the whole n-dimensional Euclidean space. LEMMA 13. We have (29)
7,.(C, A) « f ] nan(A, i= 1
fl"1''^0!"1'*)
am/
J,(f, B)« f[ min(B, ft"1/k|C('V1/k)-
(30)
i= 1
See, Siegel [14], p. 335. The only difference between the proofs of (29) and the corresponding formula of Siegel is that we use <x{p) x(p) and |aj" T(9)| instead of his T(P) and IT*^. LEMMA 14.
= G(y)H{y)E{-qxy)
O((AB)ns(ab)-"m-2Ok'll'-11}').
J /(C, A) J(£, B)dx +
Proof. By Lemmas 12 and 13, we have S(0T(0
= G(y)if(y)/(C, A)J(C, B) + O{{ABTt2mzx{A~*,
B" 1 )).
Let C(P) = « P ,
(31)
Cq) =
uqe^.
The Jacobian of xt, ..., xn with respect to up, uq, q>q is equal to the product of the Jacobian of xit ..., xn with respect to C
2 r2 D 1 ' 2 n«V It follows by (17) and (20) that
J d x ^ n ( f d«p)n(j" I M,du < ,^,)«r n = (a6)-"m-20'""'^
By
P
0
4
-it
0
241_ 136
Wang Yuan
and Therefore (32)
\S(Q)T(0E(-qX0dx By
= G(y)H(y)E(-qXy)jI(C,A)J(C,B)E{-qxQdx + By
+
0{{AB)ns{ab)-nm-20kny-11?).
In the integral in the right-hand side of (32) we replace E{ — q%Q by 1. Then by (20) and Lemma 13, the error is (AB)m \\\xQ\dx <^(AB)mHh'n-1
^(AB)ns(ab)-"m~2Okn:>-lly.
By
Hence (33)
f S(c) T(Z)E(-qX{)dx
= G(y)H(y)E(-qxy)
By
j I(C, A)J(C, B)dx + By
+ 0({AB)ns{ab)~nm-20kny-'Lly). If (*!,..., xn) is a point in En-By, then /i|C(l)| 5= 1 is true for at least one index i. By Lemma 13 and (31), we have
J
En-B
I(C,A)J(C,B)dx
{f\mm(A,a-1/k\C{i)\-llk)Umin(B,b-1/k\i:U)\-llk)Ydx
<$ J En-By
i = l
j=\
<$( f (^)" s/ ''«" 2s/k ^M)(jmin(/l 2 , a-s'kv-s/k)min(Bs, x( } ]min(A2s,
a'2s/kw~2slk)min(B2s,
b-^v-^dvf1'1
b~2s/kw-2slk)wdwd(p)r2
x +
-n 0
+ (|min(^ s , a- s/k u- s/lt )min(B s , b-slku-slk)du)ri o
x( J J (abr2s/kv~4s/k+1dvd(p)( -n
i,- 1
x
] JminO4 2s , a~ 2s/ * W - 2 ^) x -it 0
xmin(B2s,
b'2slkw'2slk)wdwd(pf2~l.
242 137
Bounds for solutions of additive equations
Since \min{As,
a-
s k
i u~stk)mm{Bs,
b~s/kiTs/k)du
0 1
4 A* Jmin(B\ b~ *'k u~ s'k) du o <^/ls(
J
Bsd« +
b-slku-s'kdu)^AsBs-kb-1
f
and jmin(/l 2 s , a- 2s/k w- 2s/ *)min(jB 2s , b~2s/kw-2slk)wdw
<s
A2sB2is~k)b~2,
0
we have by (9), (12), (17), (20) and (23), J
I(C,A)J(t;,B)dx
2s k 1
l - (abrslkAlri'1)sb~("i~1)B{ri~1Hs~k)A2r2Sb~2r2B2r2(s~k)
+ Ari'b~ri
Brils~k) h*slk~ 2 (ab)~ 2s/k A2(r2~l)s
^h2slk~i(ab)~s'kb~n+1 +
h
4slk 2
A{n~1)sB{"~1)is~k) 2slk
~ (aby
b~
n+2 (
<(ABr(abrnm-2Okny(m~i^l+y»
B "~
+
b~ 2{'2~ U B2{r2~
m k )
+
2Hs k)
-
+ rrn^l+~^)
<{AB)m{abynm-20kny-lly. The lemma follows by substitution into (33). 11. The singular integral. Let q' = y\a>1+ ... +y'na>n, C = X\Q1+ ... + x'nQn,dy' = dy\...dy'n, dx' = dx[ ...dx'n, t, = Ar,' and C = a^b'1 m-2OkyC The Jacobians of yv, ..., yn and x l 5 ..., xn with respect to y\, ..., y'n and x\,...,x'n are An and (a~* b~* m~20ky)n respectively. Set % = ixja (1 ^ i ^ s). Then where by (11), y, (1 < i < s) satisfy (34)
c 1 6
c16<|y|«)|
1 < i < s.
Let us write rj' and £' as ?/ and C again and let p
where P = P(l). Then /,(C,yl) = /r/,(O,
Ki<s.
243
138
Wang Yuan
Similarly, we have Jt(Z,B)
l
= B"MQ,
where J i ( Q = $E(-ys+ir,kOdy,
l^i^s,
p
and ys+1 = ft/ft (1 ^ i ^ s) which satisfy c16
(35)
1 < i < s.
c16<\M
Set
/(0 = f l /,-(0, i=l
J(Q=f[
i=l
Ji(0
and
Then we have j /(C, i4) J(C, B)dx = (/lB)" s (afe)- n m- 20ltn) '
(36)
Now we shall treat the integral
then F is said to be monotonic over I. LEMMA 15 (Tatuzawa). Let F(xlf ..., x,) be a finite product of positive bounded monotonic functions over the rectangle {(Xl,...,xt):
(Hi
0^x,^c,
/ / we write ,
x
sin27i-lx nx
then lim
^ • o
+ O, ..., +0).
f ... $F(xl,...,xt)xx1(x1)...Xx,(xt)dxl...dxt=&'F(
0
0
See Tatuzawa [17], pp. 47-49. LEMMA 16.
0
= D(
1 - 2s),2 k - 2ns N
(y i
?s)
- 1/k J J Fp Y[ Hq, P
9
244
139
Bounds for solutions of additive equations
where
in which Up denotes the domain 0<w,
l
w2s = w t + . . . + w s - w s + 1 - . . . - w 2 s _ 1 ;
and where 2s
H
q
Uwi'k~ldwi-dw2s-id
= [ K, 1 = 1
in whicn ^ denotes the domain 0 < w, < lyj"!2,
1 < i < 2s,
-re< ^ < 7i, 1 < ; ^ 2 s - 1 ,
Proof. By Lemma 13, we have
/.•(O^riminClJ^r 1 '*),
1<'"<*,
and J,(0 (1 < i < s) satisfy the same inequality. Then by the transformation (31), we have
\\I{QJ(C)\dx
En
P
0
q
-it 6
which converges for s > k. Therefore <*>=
lim
4>(Q),
*(O) = J / ( 0 J ( 0 d x ,
where (2 denotes the closed region of x defined by
Ki < AP,
|»,| < A,,
I«;I ^ A;
,
^
vq
in which ^P-C
vq-
,
^_.
Consider 2ns real variables ytJ (1 < i < 2s, 1 < j < n). Let It = yaOil+ ... +yin(on,
dYt = dyn ...dyin
and let P, be the domain 0^n|p)^l,
l^'Kl,
lKi^2s.
.
245
140
Wang Yuan
Let and Z
« + Z« + r2
Z
« ~ Z 9 + '2
V2
V2'
Since r(«) = v" +
iv
r ( « + r *' = " ' " ' ^
"
7 = "'"'"«
7
= ^
+ >
'"«
we have i=l
p
q
q
The Jacobian of x l 5 ..., xn with respect to fp, t>,, ^ is equal to |det(CJ»)|-! | -if 2 = D J ' 2 . Set du = d^!...dr r i dvn + !...dv r i +,2dv'ri +!...dv'fl
+rj.
We have *(fl)= J ... f (/y1...dy2ljexp(2jui t px
Pzjldx
j=i
n
P2S
= D''2 J . . . f dy 1 ... < /y 2 l jexp(2ni(5;ii p » p +!«,»,+X«i»i))^
=^>1/2 j - 1 n^p(«p)n(^K)^K))^...^2Sf
l
P
2J P
4
Let zj = f,
1 =$ i ^ n.
Then ,,(i) M (0d _ -
/.,(0 M (0d i
i ,,(0 M(0
-,(0
M (0k
_
_
v(0
M (0k
\
T h e J a c o b i a n o f ) ' 2 v , i , ..., >' 2 s,n w i t h r e s p e c t t o t r , . . . , t n i s e q u a l t o |det(/cy« ,K>*-1 a>y>)rJ |det(^ ; >)| = JV(fc"»lyj,1 /;L"kl), and the Jacobian of f1; . . . , tn with respect to u p , u,, w^ is
|det((o(r'))r1|'r2 = O- 1/2 .
246 141
Bounds for solutions of additive equations
Therefore *(O) = J UXxp(up)U(Xxq(uq)Xx'q(u'q))du Q
P
x
q
x J...
J
N(k-l\y;.1r,lrk\)dY1...dY2a-1,
where Q is a closed region containing the origin of u in its interior and du = YlduPY\(duqdu'q). p
«
Let
ttf> = yncoV+ ...+yjM?
-utf'e1**"1,
1
The Jacobian of y ^ , . . . , y jn with respect to ujp, ujq, u'jq is Idettwi'Or 1 N(k~l |J7J-"|) = D" l'2(k~l \nj ~k\). Then we have «
OP
2s-1
x [ ] {dun...dujiri+r2dil/jtri
+
1...d\)iln+r2),
where /? denotes the region OsSu^sSl — 7t < «Art =^ 7T
(1 < j < 2 s - l , 1 < / < r , + r 2 ) , (1 < r ^ 2 s - l , r i + l < r < r i + r 2 )
- y ^ ^ " = ^ - ( y ( i p ) « 1 P + . . . -ylfi'-i «2.-i.p), l7a^-k,-(^«ii 2 e I '* l € +-..-y!& ) -i«Ji 2 -i.,^ a '- 1 '')l,
Therefore $=
lim
where
F;= lim k-2syfs'1 lxx(up)dup\ i J e W , . . . ^ . , ^p"""
Qp
-Upi=l
247
142
Wang Yuan
in which wj is used instead of uip, Qp denotes the range of up in Q and U'p the domain 0 < w| < 1 ( 1 < i < 2s),
y
and where
H'q = lim fc"4'|yg|-2 Jx,,K)^K)d«,^;x V^""10
Qq
in which wj stands for uiq, i/>,- for i//,-9, g , denotes the region of uq and u'q in Q and Vq the domain 0 ^ w; ^ 1 (1 ^ i < 2s),
(1 ^ j ^ 2s-1),
-K^II/J^K
lyKl2 wai = ^f - W < / 2 e1*1 + • • • - i&-1 < - . «*2*~ Ml2-
By Lemma 15 and the transformations y\p) w[ = wt (1 ^ i ^ 2s) for the integral F'p and \^\2w't = w, (1 < i < 2s), tpj = 0; + ^ (1 < ; < s), p, = 0, + ^, + 7t (s+ 1 ^ / < 2 s - 1) for H'q, where 0, = arg y^ (1 ^ f < 2 s - 1), we have
F'p = /c"2s f] y!" 1 " 1 '"^, i=\
H'q = /c"4s fl l y i T ^ w , , i=l
and the lemma follows. 12. The proof of theorem. By Lemma 11, we have (37)
X
1 = ^ 7 - H " + 0(//n-1).
Therefore by (9), (14), (21) and Lemma 10, we have z
Z
=
O(Hn(AB)ns{ab)-nm~2Okny-17y).
jF(Qdx +
yer(r) B y
For a given a, the number of y in T, subject to y->a, is O(iV(a)). By Theorems 35 and 76 in Hecke [5], it follows that the number of a with AT (a) = disO( X l) = 0 ( / 4 ) . Therefore dx...dn=d
E1*
£
iV fl
( ) ^ Z d2
and by (20), (36) and Lemmas 14 and 16, we have Z = J0 2(f, H)(AB)ns{ab)-nm-20kny
+
O(Hn(AB)ns(ab)-"m-20kny-14y),
where
Jo =
D^-2^k-^N(yl...y2srllkYlFPUHq p
i
248 143
Bounds for solutions of additive equations
and S=®(r,H)= £
I G{y)H{y)E{-qXy).
XeP(H) yelXt)
Let £ * denote a sum, where y runs over a reduced residue system of (ob)"1, y
mod b" 1 . Thus ye(ab)" 1 , (y, b" 1 ) = (a, b" 1 ), and we take only one y in each class modulo b" 1 . Then
®= I
I*G(y)Htv) I £(-«zy)+
= SJ + S2,
I
I*C(y)H(y) X £(-«zy)
say.
By (37) we have ®i = I
1 = ^ ~ - H " + O(/f"- 1 ).
If TV (a) > 1, then X(moda)
(See, e.g., Hecke [5], p. 197.) For any given integer n, it follows by (17), (20) and Lemma 11 that the number of v e o and v + fieP(H) is V^iV(o)
VV(a) 1 - 1 " 1 /
Hence if the domain ^e.P(H) is split up into a union of complete residue sets (mod a), plus a few others, remaining elements, say R elements, then
and therefore by (17) and (20)
&2< I ^H"-1
Y.*R
X!
rf3
^H'-'r^^H"™"2'.
Consequently, we have S^c22(X)H". It follows by (23), (34) and (35) that Jo *s c23(k, K, h, y). Therefore Z > c24(k, K, h, y)Hn{AB)ns{ab)-nm-20kn» if m $5 clt(k, K, x', e). The theorem is proved.
> 1
249 144
Wang Yuan References
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18]
R. G. Ayoub, On the Waring-Siegel theorem, Canad. J. Math. 5(1953), pp. 439-450. B. J. Birch, Small zeros of diagonal forms of odd degree in many variables, Proc. London Math. Soc. 21 (1970), pp. 12-18. H. D a v e n p o r t , Analytic methods for diophantitie equations and diophanfine inequalities, Lecture Notes, Univ. of Michigan, 1962. Y. Ed a, On Waring's problem in algebraic number field, Revista Colombiana de Mat., 1975, pp. 29-72. E. Hecke, Lectures on Theory of Algebraic Numbers, Springer-Verlag, 1980. H u a Loo Keng and Wang Yuan, Applications of Number Theory to Numerical Analysis, Springer-Verlag and Science Press (Beijing), 1981. K. I r e l a n d and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, 1982. O. KSrner, Vber das Waringsche Problem inalgebraischen Zahlkorpern, Math. Ann. 144 (1961), pp. 224-238. T. Mitsui, On the Goldbach problem in an algebraic number field I, J. Math. Soc. Japan 12 (1960), pp. 290-324. J. Pitman, Bounds for solutions of diagonal equations, Acta Arith. 19 (1971), pp. 223-247. W. M. Schmidt, Small zeros of additive forms in many variables, Trans. Amer. Math. Soc. 248 (1) (1979), pp. 121-133. - Small zeros of additive forms in many variables II, Acta Math. 143 (1979), pp. 219-232. C. L. Siegel, Generalization of Waring's problem to algebraic number fields, Amer. J. Math. 66 (1944), pp. 122-136. - Sums of m-th powers of algebraic integers, Ann. of Math. 46 (1945), pp. 313-339. R. M. Stemmler, The easier Waring problem in algebraic number fields, Acfa Arith. 6 (1961), pp. 447-468. T. T a t u z a w a , On the Waring problem in an algebraic number field, J. Math. Soc. Japan 10 (1958), pp. 322-341. - On the Waring's problem in algebraic number fields, Acta Arith. 24 (1973), pp. 37-60. Wang Yuan, Bounds for solutions of additive equations in an algebraic number field II (to appear).
INSTITUTE O F MATHEMATICS ACADEMIA SINICA Beijing, China
Received on 30. 5. 1984 and in revised form on 18. 11. 1985
(1428)
250 ACTA ARITHMETICA XLVIII (1987)
Bounds for solutions of additive equations in an algebraic number field II by
WANG YUAN*
(Beijing, China)
1. Introduction. We use the conventions and notation introduced in [4] throughout this paper. Let au ..., as be a set of integers in K. Consider the additive form A(a, ^ = a 1 a 1 t f + . . . + a I a I # .
(1)
where a = (a1, ..., as) and A = {Xx, ..., As) are vectors. A set of numbers a, k is called a nontrivial solution of the equation (2)
A (a, A) = 0
if each a, is 1 or — 1, and the Aj (1 < i < s) are totally nonnegative integers of K, not all zero. Write
PI=max(P1||,...,PJ|)
and \A\ = max(l, ||ai||, .... W ) .
In this paper, we shall prove the following theorem by the combination of the methods of Schmidt [1] and Siegel [3]. THEOREM. Suppose s^ cx {k, n, e). Then the equation (2) has a nontrivial solution with (3)
M\<\A\:
This gives a generalization of a theorem due to Schmidt [1]. He first established the estimation (3) for the case of rational field. If a, X is a nontrivial solution of (2) with (3) for the case of k = 2, then a, A =(Ai, ..., As), with Ai = k} (1 < i < s), is a nontrivial solution of the linear equation <x1a1A1+ ...+asasAs
= 0,
having
PII«WI2. * Supported by the Institute for Advanced Study, Princeton, NJ 08540.
251^ 308
Wang Yuan
Therefore we may suppose k > 1 throughout this paper. If A is not identically zero, put A' = ^A, a where a is a nonzero element in the integral ideal (cc1> ..., as) with the least norm in absolute value and c2 = c2(K) is a rational integer such that
(4)
Let X be the set of x such that if s^cs(k, a nontrivial solution with
n, x), then (2) has
U\\<\A\X. (4) shows that X is not empty. Let x be the greatest lower bound of X. The conclusion of the theorem is x = 0. We will suppose that x > 0 and we will reach a contradiction. We may choose y such that (5)
0
and
x + kx2-kxy-k2x2y
< y.
(See Schmidt [1], p. 222.) Take z so small that (6)
y+12xz <x,
z < y/10,
z < 1/10.
Then pick x' with (7)
max (y +12xz, x — xz/(2n)) < x' < x.
We proceed to prove that x'eX. It will suffice to prove the assertion when |i4| is large, say \A\ ^ c6{k, K, x'). (See Wang Yuan [4].) And we may suppose clearly that cct =£ 0 (1 < i < s). Finally, pick x" with (8)
max(y +12xz, x-xz/(2n)) <x" <x'
and choose ^ such that (9)
(l+e 1 )x" + 4e 1 /fc<x / .
252
_ ^ _ _ _ Bounds for solutions of additive equations... II
309
Since l<|N(aj)|=|«J 1 >...«i'*|<|ay ) ||4-- 1 we have min\ctf>\>\A\-"+1. Divide the interval [ —n + 1, 1] into a finite number of intervals {/} of length ^ et. One of these intervals Jt will be such that there are not less than sx numbers among <X;'s satisfying
\«P\=\A\'1, where S j ^ s / l —£
/ VL i J
e1el1,
+ 1 ) . We may suppose without loss of generality that
/
a l 5 ..., aSJ satisfy the above relation. Similarly, there exists / 2 e U } such that there are at least s2 numbers in a x , ..., ccs satisfying
\af\=\A\e\
e2el2,
where
We may suppose that a t , ..., aS2 have the above property. Continuing this process, we obtain ( numbers among a,'s which we may suppose to be a l 5 ..., a, such that (10)
\of/«j»| < l^lf1,
1 < y, / < t , l < i < n,
where ^ S / ( [ ^ ] + l J . Suppose that if a 1 ; ..., a, satisfy (10) and t ^ c7(k, n, x1), the equation a 1 a' 1 Ai*+...+a,a;A;' t = 0 has a nontrivial solution satisfying max|A} (l) |«|i4| x '. Take cs (k, n, x') = ( — + 1 J c7 (ft, n, x') and set a,- = a[, A, = A,' (1 < i < t) fl.
= 1, A, = 0 (t < i < s). We have a nontrivial solution of (2) with
ii AIM u r . Hence we may suppose that the coefficients of (2) satisfy (11)
layyotj0! < I 4 ' 1 ,
Kj,Ks,
l^i^n.
253
310
Wang Yuan
Let at (1 ^ j ^ s) be a set of totally nonnegative units such that (12)
\N(aj)\lln laj'Vfl \N(aj)\lln, mi
(See, e.g., Lemma 1 in [4].) Let a" = \A\ rational integer such that
|iV(a,)|P?n
1
1
Since \A\ > c6 and a /|N(a,-)| > Ml"* , we may suppose
Hence Set (13)
a; = a, o-J1 P?
A, = a\l at Pt k[,
and
1 < j < s.
Then Ax (a, X) = ai a, ^ k + . . . +
= a\A(a,
A),
where X = (X'lt ..., X's). By (11) and (12), we have
1< 7 < s , 1 < i < n
a<\cx.f'\
(i)lk^(0~(i)-l 1/* n 4)
(1
'
\a® ~' ff(0l -
'
x
J
J
J
J
'~ l^aWa?-1
«|iV( aj )| 1/(t ">|JV( ai )|- 1/(t " ) |^r i/ ' [ « M| 2 E l / \ 1 < ; < s , 1 < i < n.
Since |N(«()| = \A\mi |JV(af)| max|JV(a7.)l/Mri max|iV(a,)| '
j
= a-|iV(a l )||Ar"Vmax|JV(a I )| ^
fl-14"2"1,
we have
(15
»
**im<w'~t-
Suppose that the equation A^a, X) = 0 has a nontrivial solution such that \\X\\<\Axr
<\A\h+H)x".
Then it follows by (9), (13), (14) and (15) that (2) has a nontrivial solution satisfying U\\<\A\(i+ei)x"+4eilk<$\A\*\
254 Bounds for solutions of additive equations... II
311
Thus it will suffice to prove that if s ^ c8 and if a,- (1 ^ i ^ s) satisfy (16)
c9a< \af\
1 < ; ^ s, 1 < i < n,
where c9 = cg(k, K), c10 = clo(k, K) and a > c6(k, K, x"), then (2) has a nontrivial solution with (17)
IIAM a*".
Of course c8 depends on k, n, x", but since k, n, x, y, z, x', x" are fixed, we will not indicate the dependency of c 8 (and of subsequent constants) on these parameters. We shall first prove that this assertion can be derived by the following Proposition 1, and then give the proof of the proposition. PROPOSITION 1. Suppose that a,- (1 < i < s) satisfy (16). If s^ clt, then either (2) has a nontrivial solution with (17) or there is a nonzero integer x such that (18)
A{a,$ = X,
XeP(a6z),
^eP(a%
1 < i < s,
where each a, is 1 or —1 and Xj (1 < j < s) are totally nonnegative integers of K, not all zero. We may suppose that c5(k, n, 2x) and c n are integers. Denote v = c5, u = c l x and s = uv. Replace the indices 1 < / < s by double indices 1 ^ i ^ v, 1 < X u. Then (1) becomes A(a,X)= where ^ = (an, ..., OjJ, kt = (kn,...,
£ 4 ( 0 , , A,-), kiu) and
u
A(Oi,
A,) = X <Xy Oijk\},
1 < I < 0.
If there is an equation, say Ai(ah Af) = 0, which has a nontrivial solution having
P,-Max", then we have directly a nontrivial solution of (2) with (17). Otherwise it follows by Proposition 1 that there are nonzero integers Xi, • ••, Xv satisfying M*i, l,) = Xi,
XieP(a6%
V W ,
!<*<», K./<«,
where each atj is 1 or — 1. Since the equation
B(b, n) = xihiA+--- +XvKrf, = o has a nontrivial solution with ||/4I « max ||fc||2* « a a 2 ~ ,
255 312
Wang Yuan
the equation (2) has a nontrivial solution ft;**;;, ju,Ay (1 < i < i>, 1 < ; ' < « ) satisfying
maxIMyll ^||/i||maxPJI ^a>+12x*
i
by (8). Hence it remains only to prove Proposition 1. 3. The circle method. Let t = az/n and h = a1+ky~z/n. Let F(t) be the set consisting of y = xx gt+... + xngn satisfying (x 1; ..., xJeGn, x, (1 < i < n) rational numbers, y-> a and N(a) < t". For any y e T (f), subject to y —• a, we define the basic domain By by
(19)
{(xu ..., x j : (x 1; ..., x n )eG n , £ = x t e i + ... +xngn such that A||^ —Toll < 1 for some y0 = y(mod d"1)}. We may prove that if yt =£ y2, then B7l nB V 2 = 0. In fact, suppose there is a ^ e B y i nfl, 2 , i.e., /ill^-yo.11 < 1, where yOi = y;(mod ^" 1 ), i - 1, 2. For simplicity, we set yOi = yt (i = 1, 2). Denote
max(h\£m-yf\, r1) = af,
1 <j < 2, 1 < i < n.
Then
n oy> < 1,
maxaf-'^t,
i=i
j = 1, 2,
•
and thus
lri° - y?l < l^(i) - y'!0! +1£(0 - r'i'l
Suppose yt -* a,- (i = 1, 2). We have iV( ai a2) |JV( 7 l -y 2 )| < (2/T»t 3 )" < ZT \ since a ^ c 6 . On the other hand, a1a2(yi—y2)5 1
N(aia2)\N(y1-y2)\>N(S- )
is an integral ideal, and thus
= D-i.
This gives a contradiction, and therefore the assertion follows. We define the supplementary domain E by (20)
E = Gn- U By. yetXt)
We use the notations i = x, Qi+ . ..+xngn,
(21)
dx = dx1...dxn,
Sftf)= X ^(Or^iA AeP(B)
Ki<s,
B = a\
H = a6z,
S(Q=flSt(®, i= 1
256 Bounds for solutions of additive equations... II
313
and
F(0= £ Stf)E(-ft), XeP
where at (1 ^ i ^ s) are defined by a2p
(22)
l«%-il
-1="^T'
fl2p=
|a ( $
(1
"^"
*^ri)'
(2r1 + l < ; ^ s ) .
aj = l
Let Z denote the number of solutions of the equation
a 1 a 1 A5+...+a I a,A* = z in totally nonnegative integers Al5 ..., As, # satisfying *eP(tf),
1 < i < s.
l,eF(B),
Then Z= X jF(«^+|F(Od{.
(23)
yer\t) By
E
We shall«show that under the assumption made in Proposition 1, either (2) has a nontrivial solution with (17) or Z is > 1. 4. Supplementary domain. In this section a, = + 1 (1 ^ i ^ s) which are not restricted by (22). LEMMA 1 (Schmidt). Suppose that
T^cl2(k,K,s2),
OT1'116^2
and | £ E(£i*)| > C, XsP(T)
k 1
where G = 2 ~ . Then there exist a totally nonnegative integer a and an integer /? such that ^ )
r2
~k
and
0 < ||a|| < [^—J T*\ See, e.g., Wang Yuan [3]. LEMMA 2. Suppose that s^c13 and £eE. Then either (24)
\F(^\
or there is a nontrivial solution of (2) with (17). Proof. Take e2 such that (25)
0 < £2 < c 14 < 1/(2G),
257 314
Wang Yuan
where c 14 is a constant to be determined later. Set (26)
h = m2.
and
m = c5(k, n, x + e2)
Choose c 13 ( > Skn) sufficiently large such that if s ^ c 13 , then n(k + 2/y) ^ and by (21), we have (fl*a2yi/(s-*+l) _ gn(t+2/y)/(s-fc+l)
<
jfl
If (24) fails to hold, then ir\S1(Q...SM(Q\>F(®>H"B*-k>a-2: We may suppose without loss of generality that \S1(Q\>...>\Sg(®. Hence we have \Sh{Orh+1
B*h-l)
>
Bn{s'k)a~2n,
and thus by (25), B^s~h~k+1)l^~h+1)a~2nlis~h+1)
|S-(£)|">
> B"(Bka2)-n^-h+1)
> B"-'2 > Bn~UG+e2,
1 < i < h.
Take C = B" °2 in Lemma 1. Then it follows that there are totally nonnegative integers ec; (1 < i < s) and integers pj (1 < j < s) such that 2
llfo*i-AII
(27)
0
2G£2
,
,
i
1
Denote T, = fttr?" (1 < i ^ h). Then
iifoo?-T,ii ^ i k i r ' I I ^ ^ - A I I «i?-** 2 ^,
i ^ / ^ /,.
Therefore by (16), we have
Itotf T,-«X*III < iK^X-^a^ll + lK^.^-T,.)^.^!! «aB-t+4(tG£2,
U i ^ l i ,
i.e., the vectors / ; = ( a ^ , T;) (1 ^ i ^ /i) satisfy (28)
l|det(/;,/,)|| « aB- t + 4 < l G £ 2 ,
1 < i,j ^ h.
Let ft be a nonzero element in the integral idea (aio\, t t ) with the least norm in absolute value. Then fi\c2cx1(Tk1 and fi\c2ti. (See § 1.) Set c2v.la\=
Pa,
C2T!=J?T
and
f = {a,x).
258 315
Bounds for solutions of additive equations... II
Then
c2fi=fifWe may choose ft such that \N(o)\1"><$\\a\\<\N(a)\1">.
(29)
(See, e.g., Lemma 1 in [4].) We have also two integers & and T' such that /? = a 1 ff* 1 T'-T 1 (T',
therefore i.e., c 2 = ax' — to'.
(30) Set g = (a', T'). Then by (30),
=C219if+C21*l'i9,
fi where a.- of a'
cpt=
Tj
T
,
,
and
,
\j/i =
a af of T
T,-
,
l ^ i ^ h
are integers. By (27), we have 1<JV(^)^|4»|B2(""1)G£2, i.e., (31)
Itffl^JT 2 *"" 1 ^ 2 ,
U;<M
Since C j a ^ = fia, we have by (16), (27), (29) and (31) that (32)
a\\a\\-'B2kGt2 > \p*\ > a\\a\\-'S'2'^^2,
1 < i < n.
Therefore it follows by (28) that (33)
m
= ||det(/J,/)|| < ^ m a x l ^ r 1 lldetV,,/!)!! «|M|B"* + 6 k l l C £ 2 = M,
l^i^h.
1. Suppose M ^ 1. Replace the indices 1 ^ / < h by double indices 1 ^i,j^m. Define
where a,- = fo,lf ..., aim) and A, = (A,ls ..., kim) (1 < i < m). It follows by (26), (33) and the definition of the set X that the equation Al(al,ll) = 0
259 316
Wang Yuan
has a nontrivial solution having 114)1 4Mx+e\
(34)
l
Let m
m
c
1
ft = I ! j= i
j=
1 < i < m.
i
The first coordinate of # is m
At = C2 *ffS fl.v 4 9»y.
1 < i < m.
Therefore c2)3i/(T (1 < i ^ m) are integers. If ftlt ..., f}m are not all zero, then let x be a nonzero element in the integral ideal (/?j, . . . , /?m) with least norm in absolute value and satisfying
\N{x^llH<\\x\\<\N{x^lm. Then a\c2x and by (29),
IWNIIzll-
Consider the form
B(b,n)= £ptbtrf, i=l
where b = (bu ..., bm) and p = (JUJ, . . . , nJ. Since m
A = Z aij%j<*ij°kiv
1 < i < m,
we have by (16), (27) and (34), ||AIMal?2*Ge2M(*+£2)\
l<m,
and therefore the equation B(b, fi) = 0 has a nontrivial solution satisfying /
MM max (l,
2kG *2 aB
M(x+°2)k\x+E2
^
J .
Consequently (2) has a nontrivial solution bi au,
m a{J Aij
a, = 1,
(1 ^ i, j ^ m),
4 = 0
(/i^s)
satisfying 2G 2
+
/
nR2kGe2
AJ*-x + e2>k\x
||J|| < 5 * M- '» max ( l , ^ 5 - ^
)
+ e
2
260
Bounds for solutions of additive equations... II
max
2
317
r—w—)
2
, say.
I
Since c2a1o*1 =fio,by (27), (29) and (33), we have 2
||<x||«aB
(max|j8(l)|)
l
<£aB
2
,
2
,
i
M 4aB and therefore I
= aB2kGci M(x+E2)k + 1M-' jj-k+8knGe2f
k+6knG °2 B-
n~ k+ SknGE2-.(x + e2)k
Since a > c 6 , we have IIAII
a
x+kx2 kxy k2x2 +c
~ ~
y i5(k->i)s2
Hence if c 14 is sufficiently small, then by (5) and (8), we have the desired (17). 2. Suppose M < 1. We revert to the indices 1 < iI ^ h. By (33), we have \jjt = 0 (1 =$ i ^ /i), i.e., c 2 /j (1 ^i^h) are integral multiples of the integral vector / . Let
B(b, n)= I«,of6,^, wherefe= (6j, ..., bh) and fi = (fi1, ..., fih). Let / be a nonzero element in the integral ideal (a t a\, ..., <xhcrk) with least norm in absolute value and satisfying \N(x)\11" > \\x\\ > \N(x)\u". Then a\c2x, and thus ||a|| < || z ||. Hence the equation B(b, fi) = 0 has a nontrivial solution satisfying
||/,||<max(||ai«Tf||Hr1)X+t2 ^ a f l ^ l W I - 1 ) 1 * ' 2 . i
It derives a nontrivial solution of (2): Oi = bh ki =ViHi aj = l,
Xj = O
(1 ^ i ^ h ) , (h<j^s).
If c 14 is sufficiently small, then
UW^B^iaB^M-1)*^2 _ < a
x + t2 + 2Gyt2 + 2kGy(x + E2)e2 II | | ~ x ~ £ 2 x + xz/(2n)||ff||-X
261_
318
Wang Yuan
If |M| ^ a*1", then by (8), we have ||A|| ^ ax-xzH2n) ^
QX^
i.e., (17) is true. Now we suppose that |M| < tf/n. Then by (27) and (31), we have ||5-
if c 14 is sufficiently small. Let 0~1Td = b/a, (a, b) = 1. Then a\a, and thus iV(a)^|JV(cx)|
£ - y = C,
ri = y1o)1+ ...+yna>n,
dy = dy^.^dy,,,
0,(7) = JV(a)-1 X £(«<«;/?)
(1 ^ i ^ s),
fi(moda)
G(y)=t\G,(y), /,(C,B)= 1 E{a,a,rfQdy
(1 < i < s)
P(B)
and
/(C,B)=ri/,(C,£), i=l
where af (1 < i < s) are defined by (22). LEMMA 3. Suppose that £eBy. Then St (0 = G, (y) I, (C, B) + 0 {a2*'" Bn~J). See, e.g., Lemma 12 in Wang Yuan [4]. LEMMA 4.
/,(£, B) « fl m"»(B, a - ^ l ^ r 1 / k ) ,
1 < i < 5.
See Siegel [3], p. 335. LEMMA 5.
IS(§E{-X®dx = G(y)E(-Xy) J/(C, BJdx + O ^ - ^ a - - 7 ^ .
262 Bounds for solutions of additive equations... II
319
Proof. Let The Jacobian of xlt ..., xn with respect to up, uq,
Dll22r2Y\u9. 9
Suppose £eB y . Then by Lemmas 3 and 4, we have S(Z) = G (y) I(C, B) + 0 ( B - - l a2*"). Since by (19), ^dx^h'n
= a-n-kny+z,
By
and by (6), (l + 2/n)z-y < — Iz, we have (36)
\S(!;)E{-tf)dx By
= G(y)E(-Xy) J /(C, B ) £ ( - z O ^ + 0(B^- t »a- n - 7z ). By
In the integral on the right-hand side of (36) we replace E(~xO by 1. The error is
B" JllzCIM* ^B^Hh-"-1
By
by (19) and (21). Hence (37)
= G(y)E(-XY) \ I{L B)dx + O{B«*-*a'"-1*).
$S(OE(-xOdx By
By
If (x 1; ..., xj is a point of En — By, then the inequality /i|C(0| > 1 is true for at least one index i. Since s ^ c 13 , it follows by Lemma 4 that
J I{C,B)dx4 £n-By
J (nmintB.fl- 1 "^ 0 !" 1 '*)) 1 ^ £n-Bv i=l
«( I a-s/tu-s/tdu)(Jmin(Bs, a-^i;-^)^)' 1 " 1 „-!
0
x( J Jmin(B 2s , a-2s/kw-2slk)wdwd(pj2 -n 0
+(J min(B% a'slk u'^duj1 0
{] ] a~ Wv-W+l dvd
263
320
Wang Yuan
x( J Jmin(B2s,
a-^w'^wdwdcpj2'1
-it 0 4
a-s/k hs/k-
1 _-(n ~ 1) ^ O - W C l - 1) _~ 2'2 B 2 d - * ) ' 2
+ a ~ r i 5 < s " < I ) r i a~ 2s/ *
fc2s/*~2
a~2{'2~1]n2(s~k)(r2~1}
^ ^(s-t)(n-l)a-s/*-»+l+(1+'')'-z/'')(|—l) +
<£B
g^-k)(n-2)a-2s/k-n+2 + (l+ky-zM(-Y~2) nis k)
- a-"(a~to
zs
+
z
2zs
2z
» + a~~to~+~^)
4B«s-k)a-n-7z
The lemma follows by substitution into (37). 6. Singular integral. Let ri' =y'ico1+ ... +y'nO)n, dy' = dy'x...dy'n, t] = Br]'
C' = A Qi + • • • +
and £ = a " 1 - * ^ ' .
The Jacobians of yx, ..., yn and xu ...,xn with respect to y'_, ..., y'n and x\, ..., x'n are B" and {a~1~ky)n respectively. Define yt = at/a (1 < i ^ s). Then
and by (16), we have c9<|yf|
(38)
1 < ; < s , 1 < i < n.
Let us write f/' and C' as JJ and C again and let
Ii(0 = IE(aiyiVk0dy (1 < i < s)
and
J(0=fU(0,
where P = P(l). Then and thus j /(£, B)dx = B"( s -")a- n | /(Qdx.
(39) LEMMA 6.
J/(C)ix = I>< 1 - s >/ 2 fc-'«|Ar(y 1 ...7 s )r 1 /' [ n^n^
E
n
P
9
264
_ _ _ 321
Bounds for solutions of additive equations... II
where
in which Up denotes the domain
l
0<w,**M%
w2p = w 2 p _ 1 ±w 1 ±...±w s ,
here the sign before wt is the sign of at y\p) (cf. (22)), and where
vqi=i
in which Vq denotes the domain O^Wt^lypY
(l^i^s), VVs
-n^cpj^n
(l^j^s-l),
i
= |w}/2e ^+...+vvi/.2ie^-i|2.
The proof is similar to that of Lemma 16 in Wang Yuan [4]. 7. The proof of the theorem. We have
E N(a)4 I d2
I H
If (24) holds, then by (23), (39) and Lemmas 2, 5 and 6, we have z
Z jF(Qdx + O(HnBnis~k)a-"-4-z)
=
Vent) By
= Jo S(r, H)B*~k>a-' +
OiH-B*-*a'"-**),
where
J0 =
D^-^k^\N(yi...ys)\-llkUFPUHq P
and S=S(t,fl)=
I
Q
I G(y)E(-Xy).
Let £* denote a sum, where y runs over a reduced residue system of (ad)-[ modcT1. Then ®= I
JV(o)=l
I*G(y) I £(~Zy)+ y
xeP(H)
I
l<JV(o)«t B
= 8! + S 2 , say. We have
® x = X 1>H".
E*G(y) X E(-XY) ?
ZeP(H)
265 322
Wang Yuan
(See, e.g., [4].) If N(a) > 1, then
£ E{-Xy) = O.
/(mod a)
Therefore if the domain xeP(H) has to be split up into a union of complete residue set (mod a), plus a few other, remaining elements, say R elements, then
R^H^'Nia)1"1, and thus ®2 «
Z
^H"'1
X*H"- 1 iV(a) 1/ "
£ d3
£
W(a)1 + 1/n
Hence It follows by (38) that Jo > c16, and therefore
Z>c11HnBn(s'k)a-">
1
if a > c6(k, K, x"). The theorem is proved. Remarks. 1. The inequality (3) can be replaced by max|AT(^.)| « m a x ( l , \N(^)\, ..., \N(ocs)\f. (See [4].) 2. Consider the equation
(40)
A(X)=txi%=°>
where au .., as are given integers in K. If k is an odd number, then ai%={aiXif
(l^i^s).
If rx = 0, i.e., K is totally complex, then the singular integral Jo is always positive. Therefore in these two cases it follows by the theorem that if s > cls{k, n, s), the equation (40) has a solution in integers Xt, ..., Xs, not all zero, satisfying U\\<\A\*. 3. We can further consider the problem of the estimation of bounds •for solutions of certain diophantine inequalities in an algebraic number field (cf. [2]).
266 Bounds for solutions of additive equations... II
323
References [1] [2] [3] [4]
W. M. Schmidt, Small zeros of additive forms in many variables II, Acta Math. 143 (1979), pp. 219-232. — Diophantine inequalities for forms of odd degree, Advances in Math. 38 (1980), pp. 128151. C. L. Siegel, Sums of m-th powers of algebraic integers, Ann. of Math. 46 (1945), pp. 313— 339. Wang Yuan, Bounds for solutions of additive equations in an algebraic number field I, Acta Arith. 48 (1987), pp.
INSTITUTE OF MATHEMATICS, ACADEMIA SINICA Beijing, China
Received on 30.5.1984 and in revised form on 7.1.1986
(1429)
267
Reprinted from JOURNAL OF NUMBER THEORY
Vol. 29, No. 3, July 1988
All Rights Reserved by Academic Press, New York and London with permission from Elsevier
Diophantine Inequalities for Forms in an Algebraic Number Field WANG YUAN* Institute of Mathematics, Academia Sinica, Beijing, China Communicated by Hans Zassenhaus Received March 26, 1986; revised March 30, 1987
1. INTRODUCTION
Given a vector with complex coefficients x-(xu
..., xs) put
|x| =max \xt\ and given a form (i.e., a homogeneous polynomial) F let
1*1 be the maximum absolute value of its coefficients. With every form F of degree k there is associated a form F{xu...,xk) which is linear in each vector x, {l^i^k) Xj,..., xk and such that
and symmetric in the k vectors
F(x) = F(x,...,x). Schmidt in 1980 [5] proved THEOREM A (Schmidt). Given h^l, m^ 1, and odd numbers k^,..., kh, and given a positive number E, however large, there is a constant
c1 =
cl(ku...,kh;m,E)
as follows. If M ^ 1 is real and if Fi,..., Fh are forms with real coefficients of * Supported by National Science Foundation Grant MCS-8108814(A04).
324 Copyright © 1988 by Academic Press, Inc. AH rights of reproduction in any form reserved.
268 DIOPHANTINE INEQUALITIES
respective degrees ky,..., kh in x = (x 1; ..., xs) where s^cu linearly independent points x(l),..., x(m) in U with \x(i)\^M,
325
then there are m
l^i^m
and |#(x(/ 1 ),...,x(4 j ))|«M- £ |F,|,
Kj^h,
l^iu...,ik.^m.
If the coefficients of all forms are rational integers, he derives from Theorem A the following. THEOREM B (Schmidt). Given /z> 1, m > 1, and odd numbers kx, ...,kh, and given £ > 0 , however small, there is a constant c2 = c2(k1,..., kh;m,s) such that if Gx,..., Gh are forms of respective degrees klt..., kh with integer coefficients in x = (xu ..., xs), where s^c2, then G{,...,Gh vanish on an m-dimensional subspace which is spanned by integer points x(l),..., x(m) having
\x(i)\
1<W,
max(\,\Gl\,...,\Gh\).
Remark 1. We will show that the conclusion of Theorem B is still true with suitable definition of G if Gx,..., Gh are forms of odd degrees with coefficients in integers in an algebraic number field K of degree n, provided only hat s ^ c3 (k,,..., kh ;n, m, e). In fact, if cou ..., wn is an integral basis of K, then G, (1 ^i^h) can be written as Gi = Giicol+ ••• +Gin(on, lsS/'2, where Gy(l
Suppose E > 0 and suppose
D{x) = d1xk1+
•••
+dsxks
is an additive form of odd degree k with dteZ (X^i^s) s^ c4(k, s). Then there is a nonzero point x in U with
£>(x) = 0
and
|x| <max(l, |Z»|£).
and
with
269 326
WANG YUAN
The next step is to prove a special case of Theorem A, namely when there is only one additive form. And the final step is to prove the theorem by an inductive argument. To consider the problem of diophatine inequalities for forms of arbitrary degrees we shall need a proposition for additive equations of arbitrary degree. If the solutions of the equations belong to a totally complex algebraic number field (i.e., a field with no isomorphic-embedding into the reals), such a result can be proved by the combination of the methods of Schmidt [4] and Siegel [6]. (See Proposition 1.) Let K be an algebraic number field of degree n over rationals. K(1\ ..., K(n) are real conjugates and K(r' + l\..., K{n + 2n) are the complex conjugates of K. Here rx + 2r2 = n. The complex conjugates are so arranged that, for rx +1 ^q^r1 + r2, the fields KM and K{
II€11 = max |£«>| and
im=max 1^11= max |Aj')| for a vector "k = (Al5..., Xs). THEOREM 1. Let K be a totally complex algebraic number field of degree 2r. Given positive integers h, m, and ^ , . . . , kh, and given a positive number E, however large, there is a constant
cs = c5(ku ..., kh; r, m, E) as follows. If M~^ 1 is real and Fx,..., Fh are forms with complex coefficients of respective degrees klt..., kh in "K=(Xl,..., Xs) where s~^cs, then there are m linearly independent points >.(1),..., X(m) in F with
HMOKJlf,
l^i^m,
and \F(X(il),...,Uikj))\<M~E\FJ\,
l
U / „ . . . , i t ^m,
270
DIOPHANTINE INEQUALITIES
327
here and below the constant implicit in <4 or 0 may depend on ku ..., kh, K, m, E, e but not on M, Flt..., Fh, andG. In particular, it follows that \Fj(Ui))\<M-E\Fj\, Suppose n o w that Gu...,Gh with coefficients in J. Let
l^j^h,
l^i^m.
are forms of respective degrees
kl,...,kh
IIGJ denote the maximum absolute value of its coefficients and their conjugates. Further let G = max(l, HCII,..., \\Gh\\). S u p p o s e t h a t s^cs(ku ..., kh; r, m, 4rkt •••khs~i) = c6(kl,..., kh; r, m, e), say, where 0 < e < l . Apply Theorem 1 with M = MoGe, where M o = M0(k{,..., kh; K, m, s) is to be chosen in a moment. We obtain m linearly independent points X(l),...,~k{m)in Js with
IIMOK M0G«,
l^i^m
and \Gj(Uil),...,Uik))\<$GM~4rk<-khe~'
(1)
On the other hand, &,!(?,(>.(/,),..., X(ik)) is an integer in K and \\kj\Gj{mx),...,
X(ikj))\\ <
GMk'<Mk0'Gl+k'.
If G'/Mi,), ...,*.(»*,)) # 0 , then \N(ki\6fi.{.ii),...,\{.ik)))\>l> and therefore
IG/M/,),..., Hik)\ > (M^Gl+k'r2r+l
>M^G~4rk'+'
which leads to a contradiction with (1) if Mo is sufficiently large. Therefore 6J(k(i1),...,k(ikj))
= 0,
and we have the following THEOREM 2. Given positive integers kl,..., kh and m, and given e, however small, there is a constant c6 = c6(k1,..., kh; r, m, e) such that i/Gj,..., Gk are
271 328
WANG YUAN
forms of respective degrees kl,..., kh in X = {Xx,..., Xs) with coefficients in J, where s^c6, then Gu ..., Gh vanish on an m-dimensional subspace which is spanned by m points X(l),..., X(m) in Js having
HMOHG8,
l^i^m.
Remark 2. Theorem 2 gives an improvement for a result due to Peck [3]. He first established by the combination of the methods of Brauer [ 1 ] and Siegel [6] the existence of X(i) ( l ^ r ^ m ) with c'6(ku..., kh; K, m) instead of c 6 , but the estimation of ||X,(j)||'s was not considered. As we have shown in Remark 1, a similar result can be obtained if the coefficients of G,,..., Gh are integers in any given algebraic number field Kx. The proof of Theorem 1 relies on the Schmidt's method [ 5 ] . In this paper, we shall prove a special case of Theorem 1, namely when there is only one additive form, and give only a sketch on the inductive argument from a single additive form to a system of forms, since it is easily treated by Schmidt's method.
2. ADDITIVE FORMS
We suppose that K is a given totally complex algebraic number field of degree 2r throughout this paper. PROPOSITION
1. Suppose e > 0 , & > 1 , and s^c7{k,r,e).
Then given an
additive form A{k) = all./Cl+ ••• + M * with coefficients in the integer of K, there is a nonzero point XeJs with A(l) = 0
and
\\X\\
\\A\n
This proposition was proved in [ 8 ] . (See Remark 2 in [8].) Now we shall prove the following proposition which is a very special case of Theorem 1. PROPOSITION 2. Given k ^ 1 and given E, however large, there is a constant cs = cs(k, r, E) with the following property. Let A{k) be an additive form of degree k with complex coefficients in at least c8 variables. Then for real M^-l there is a nonzero point keJs with
WU^M
and
\A(K)\ <M~E
\A\.
272
_
DIOPHANTINE INEQUALITIES
329
We begin with simple reductions. Suppose we can prove the conclusion for s ^ cs(k, r, E) and M^cg(k, K, E). Then in the case of 1 < M < cg, we put A, = 1
and
X 2 = - - - = X S = O,
and therefore HM = 1
\A(k)\^\A\=cEcg-E\A\
and
Hence it will suffice to prove Proposition 2 for large values of M, say for M>c9(k,K,E). Choose 5 > 0 so small that „,
E+23 .C -f
(
8
Proposition 2 is obvious if there is an a, with |a,-| <M E \A\. In fact, we may take A,= 1, /Ly = 0 (y'#/) in this case. So we may suppose that M~E\A\^\ai\^\A\,
l^i^s.
Cover the interval [ — £,0] by a finite number of intervals {/} of length 5. One of these intervals / will be such that at least \_s/([E/S2 + 1)] of the a, are of the type |a,| = M" \A\ with etel. We may suppose without loss of generality that this holds for all i. Put L = M6 \A\=MS max |a,| and choose natural numbers qy,..., qs, each as large as possible, with
Since L/|a,-| ^M5,
we have
{L^\0L,\qkt^L
(2)
if M is sufficiently large. Further, qki^LI\a.l\=M6\A\l\a.i\^M2S. Proposition 2 is true for B{]i) = a l q k 1 n k l + ••• + x s q k n k
with M0 = M ( £ + M ) / ( £ + 1 / 8 ) ,
E0 = E+\
Suppose
_
273 330
WANG YUAN
in place of M, E, i.e., there is a nonzero point \ieJs with and
||H||
\B(yi)\<M»*\B\.
Let Xi = q,ni (1 ^ K 4 Since | 5 | < L = Af* Ml, we have
| i ( i ) H M - p + 2 i | / ( £ + l f f l ( £ + 1 / V Ml « M - £ Ml and \\X\\<(maxqi)\\n\\^M2S
+ E+
^
2S)/iE+1/s))
<M
if M is large, ie., Proposition 2 is true for A(X). What is special about B is that by (2) each of its coefficients is at least %\B\ in absolute value. By what we said it is clear that if Proposition 2 is true with E +1 in place of E for form A with
iMKN<MI.
is* '<*,
then it is true with E for general forms. By homogeneity we may replace the above relation by Ml = l
and
H|oc,Kl,
1
(3)
It now will suffice to prove the following statements. (i) The conclusion of Proposition 2 is true for 0 ^ E ^ \ for forms A with (3), provided only that s^cl0(k, r, E). (ii) The conclusion of Proposition 2 is true for E for forms A with (3), provided only that s ^ clo(k, r, E) and that Proposition 2 is true for E — \ for general additive forms. 3. ANALYTIC METHOD
Let a)i,...,(o2r be a basis of / with cuJ« + r) = d>S») ( l < / ^ 2 r , 1 «S q*S,r), 5 the different and D the absolute value of the discriminant of K. We choose a basis pu ..., p2r of <5-1 such that [0,
if
i=£j,
where T(y) = ^jr=i y(0. Given a set of complex numbers c!,..., c2r with c <, + r = cg {l^q^r), there is a unique set of real numbers yu ...,y2r such that c,. = y, o>i') + • • • + ^ffli?,
1 < i < 2r.
274
DIOPHANTINE INEQUALITIES
331
Suppose that a,,..., a.s is a set of complex numbers satisfying (3). We define for each j ,
Then a, has a unique representation tf) = z1co[i) + ••• +z2ra>$ ( l < / < 2 r ) ,
z,eU ( l < / s $ 2 r ) .
Set £ = * , £ ! + ••• + x 2 f p 2 r , > 7 = > ; 1 a ) 1 + ••• +y2r^2r, dx = dxl---dx2r, and dy = dyl •••dy2r. We denote by /•"((?) the set of (yu ...,y2r) satisfying
\\i\\
5,(0=
a sum
where /. runs over all integers in K with ||A|| ^ Q. Set
Z E(ocfakl
E{a^nk)dy,
7,(0= f
5(0=115,(0
and
1
7(0=Il/,-(0,
/=i
/=i
2jt c
where £(y) = e(r(v)) with e(,v) = e " . We use the notations /sin nxM~E\2 K(x)
=
smnxM
2r
)
(
A:(X) =
and
n
K(Xjl
where A: is a real variable and x = (.v,,..., x2r) is a real vector variable. We wish to estimate the number Z of solutions of \A(\)<M'E
(4)
II^KM.
(5)
in points k e Js subject to
Our plan is to show that either Z > 1 or (i) and (ii) holds. Therefore (i) and (ii) hold in every case. Put 8 = (rk+(r+l)E+3)-l(4k _J1 m
~ \cs(k, r,E- £)
+ 5E)-\
in the case (i), in the case (ii),
(6)
(7)
n = c7(k,r,d),
(8)
h = mn,
(9)
275
332
WANG YUAN
and choose r\ > 0 so small that (10)
4lrGhri
(11)
In what follows, the constants in <^ or 0 may depend on s (in addition to k, K, E). But observe that if Proposition 2 is true for a particular value of s, then it also holds for larger values of s. We assume ¥ to be large, i.e., A/>c 9 . LEMMA
1. We have for real Q
(12) Proof. Make substitutions /? = MEa, and MEQ for g in Lemma 50 in [2]. Let En denote the n-dimensional Euclidean space. Expand Yfj=i <*jtf a s
X aj'Uj')fc = ^ ^ i " + • • • + A2rco£,
1 <«<2r.
(13)
Then by Lemma 1, we have M2rE f S(£) A:(x) rfx J
£2r 2r
2r£
=M
I
=
A e/>(A/>
'
/-co
£ ••• X n j e(xjAj)K(Xj)dxj •••
Z (l-M.IM^-.^l-M^IM^). (14)
M,,<^-£;-ie/>
Let »?7 = 7 j l c o 1 + ••• + ^ , 2 r o j 2 r ,
dYj = dyn---dyJt2r,
l^j^s,
and f
aj"»jj'">* = B, « < / » + • • • + 52rO)J?,
1 < i < 2r.
276
_ ^ _ _ _ ^ _
DIOPHANTINE INEQUALITIES
333
Then by Lemma 1, we have M2rE f I{Z)K{x) dx J
E2r
= f
•••
J
P(M)
|«/|<M- £
(l-\B1\ME)---(l-\B2r\ME)dY1--dYs.(l5)
f J
P(M)
If \Af\ <M~E, \^i^2r, then it follows by (13) that A(k)<M-£, and thus the right-hand side of (14) gives a lower bound for Z. The general idea now will be to show that the right-hand side of (15) is large and to show that the left-hand sides of (14) and (15) differ little. LEMMA
2. The right-hand side of (15) is
Proof. Let ,,]«) = uVkeilp">/k,
1 <j < s,
l^q^r.
The Jacobian of yJt (1 «£/<2r) with respect to ujq, q>jq (1 ^q^r) is
2rk-2D-1/2ft< - ' , and so the right-hand side of (15) is equal to 2rsk-2rsD-s/20,
(16)
where
cp=r fj (i - M £ 15,1) n ri « 2/ v ! ^ ^
( iv )
in which
Uy^J,
U?^r.
Then 0 = !«! • • • a,| - (2r>/ * M - < > & > / ^ ,
(18)
277 334
WANG YUAN
where
(19) in which do = Oy= i Il!| = i
A = ^ + a r § a i " (1 ^ 7 < *, 1 < ? < 2r)
and M £ B, = D,( 1 < i ^ 2r).
Then
7=1
7=1
7=1
= DlQ)[^ + ••• + Drools),
l^q^2r,
and
<»->/=l
7=1 9=1
r
where c?0 = Oj= i Yl q = i dQjq, and (W) denotes the domain O^vjc/^ \*j\ME+k, - J t < ^ < n (l
ME+k
32s
ME+k
lbs
(H;)
l^/l<^ (K/<2r) is contained in (W). The volume of (w) is ^>M<£+*:)r(-s~2). In
fact,
for any given
i) ll7 e 1 ' e "+ ••• +vs_liqe'e'-l"=Veie.
vjq, O^il^j^s—l)
in (w), we let
Then M £ + V l 6 < F < (5ME E k
^ and 0,, satisfy Kvsq-V<£l and Qsq-Q4M- - . follows. The integrand of the integral W in (w) is
+k
)/16, and
The assertion
278
DIOPHANTINE INEQUALITIES
335
Hence ip ^ ]tf(E + k)r{s - 2) + (£ + k)rs(2/k - 1) ^ ]tf2r{s - k - E) + 2rEs/k
and the lemma follows by (16)—(19). LEMMA
3. If U\\ ^ M9/1°~k, then ^
E(SXk)=\
E(^k)dy
+ O{M2r-ilw).
Proof, Expressing an integer A in terms of the o>, (1 ^ / < 2r), we obtain X = gl(Ol.+
•••
+g2rU>2r,
where the g, (I < i^2r) are rational integers. Let G(/.) denote the cube (yu-,y2r)-ri=y1(ol+
••• +y2ro}2r,
gi**yi
l^i^2r.
Then ||^*-«A*H||5|| ||f ? -;.||(|| >7 r- 1 + ||/||*- 1 )«M 9 / 1 0 -* + * - 1 ^ M - 1 / 1 0 and so E(£Xk)=\
E(Zi]k)dy + O(M-1/i0).
Since the volume of the area belonging to exactly one of \J;_EP{M) G(X) and P(M) is dominated by O(M2r~l), we have
£
£(£l*) ^ = [
and the lemma is proved. LEMMA
4.
We have
See, e.g., Siegel [ 6 ] , p. 335.
f
^ ^ ^ r f y + O^ 2 '- 1 ' 1 0 )
£(^*)rfy + O(M2r-1/10),
279 336
WANG YUAN
LEMMA
5. We have f
J
IKII«A^/10-*
S(£)K(x)dxpM2r(s-fc-2E\
(20)
Proof. By Lemma 4, we have for any q,
f
HZ)K(x)dx < M~4rE f J
(?)
k
\(M\>MV">- j=l
f] min(Ms, |£ u) | ~s'k) dx.
1
Let £ = w^e'* ' (1 < q < r). The Jacobian of *,- (1 ^ i < 2r) with respect to uq,
«M- 4 r £ ff°°
f
u-l2"Vk+1dudq>)
xff 00 )" 1 min(M2s, w^(2j)/*) wrfwrfe) •^ M ~ 4 r £ +
<9/1
° ~ k)( ~(2s)lk
^ Jrf2rU -k-2E)-
+ 2)+ 2 ( r
" ' ) U ~ k)
(9s)H5k) + 9/5 ^ J^X* - * - 2£) - 1
if s is sufficiently large, i.e., s > 2k. Therefore it follows by Lemma 2 that f
I{0K(x)dxpMMs~k-2E).
(21)
It remains to compare the integral (21) with the one in (20). By Lemma 3 we have for U\\^M9/1°-k,
|S(O-/(S)I= ft (/,(£) +O(M 2 - 1 / 1 0 ))-/(O
and there fore the left-hand sides of (20), (21) have a difference J + M~4rE\
mm(M2is-l\u'ms-im)ududcp)
M«2r-l/l0)dx
a D1OPHANTINE INEQUALITIES
U ~ (^ " ' W* + ' du Y
' M2° ~ 2U du + T
M
<M-4rE+2r-1/wfr
+ M2r(s~k~2E)~s/w
337
+ (9r)/5
<^M2r(s~k~2)~ino if s is large, i.e., 5 > 20r. The lemma follows. 6. We have for any q
LEMMA
S(Z)K(x)dx<M2ns-k-2E)-i.
f
P r o o / I t f o l l o w s f r o m \^q)\> Mrk + lr+1)E+1 that a t least o n e of t h e x , i n t h e e x p r e s s i o n £ = xlp]+ ••• +x2rp2r satisfies \x,\>Mrk
+ ir +
l)E+1
.
Since |^(x)l^min(M- £ ,7i- 1 |x|- 1 ) 2 , we have
f
S(Z)K(x)dx 2rs
dx\2f
/ rx
^
<M {\
r-s-
\2r-2
min(M-2E,x-2)dx)
\ J M r k ~ t , + l)E+l X J \ J Q <^ ] ^ p - r s - 2 r k - l { r ^ l ) £ - 2 - 2 ( r - l ) E
J
The lemma is proved. For 1 ^q^r, let (Uq) denote the domain U\\^Mrk
+ lr+1)E+
\
\^\>M9/i0-k.
Suppose for a moment that the r integrals satisfy f
\S(i)\dx^M2rls-k)-\
l^q^r.
(22)
281 338
WANG YUAN
Then it follows from Lemmas 5 and 6 that f S(Z)K(x)dx=\ J
S(^)K(x)dx + J
E2r
O(M2r{^k-2E)-1)
\\i\\
and in view of (14) it follows that Z^M2r(s^£)>l.
4. THE PROOF OF PROPOSITION 2
We may thus suppose (22) is false, i.e., there is a (Uq) such that f
J
(t/,)
\S{O\dx>M2ris~k)-i,
(23)
l^q^r.
Let <x(i) be a transformation such that
where \ = (iu ..., ir) is a permutation of (1,..., r). Since S(£) is invariant under the group {ff(i)}, (23) is true for any q. In particular, it holds for g= 1, i.e.,
f
\S(Z)\dx>M2rU-k)-\
(24)
There is a £(= £(1>) satisfying |{|a
r t +|r+1|£+1
|£|>M9/10^
,
(25)
and \S{£)\ ^M2r{s-{r
+ 1){E+k) 1) 2
(26)
- '.
Otherwise, we have
[
\S(i)\dx^M2rU'ir+1){E+k)-l)-2
J((y,)
f J | | 4 | | < A / r t + (r+l)£+l
<M2Hs-k)-2
which leads to a contradiction with (24) if M is large.
dx
282 339
DIOPHANTINE INEQUALITIES
We may suppose without loss of generality that
1^(01^ ••• >\SAl)\. The left-hand side of (26) is
<\Sh(Z)\'-h
+i
lrf«h-l\
and thus we have by (11) \Si(£)\^M2r-(2Hr+1HE+k)
+ 2r + 2Ws h
-
+ i)
^M2r-'1,
l^i^h.
(27)
7. Suppose that n>0, M> cn{k, K, n), and C^ M2r-l/G + \ where G = 2k~1. If |£;. e /> (M) E{t^kk)\ ^ C, then there are two integers a, fi of K such that LEMMA
\w-n<\^r\ M"-k and 2r G
(M \ 0<||a||«(— J M\ See, e.g., [ 7 ] . In view of (10) and (27) we can apply Lemma 7 with C = M2r~n and C = £oe, (l^i^h). We obtain integers au...,<jh and f}u...,ph of K with 0<||(7/HM2G" Setting
and
||a,ff,$-/J,HA/-*
and (O-J5,)/O-, =
T,
+ 2c
l^i^h.
(1 < / < / I ) we have
| | a , c r ^ - T , . H M ' ' t + 2G/"),
and
',
l^i^h.
(28)
Set
Then 11
|a(2)---a(>)|
and by (10), (25), (28) we have ly/Kla^"1
M-k
+ 2Gh
*4Mk-9/w
+ 4rGh
"~k<M-4/s
(29)
283 340
WANG YUAN
if M is large. So with X = (/Lu ..., Xs) = {nu ..., jxh, 0,..., 0) = (fi, 0) we have A(X)=\a^rlB()i) + C(ii), where £(H) = T 1 /4+
•••+Xhflkh
is a form with coefficients in / and C(\i)
= y l f i k 1 + •••
+yhnl
From (25), (28) we obtain ||T,||
<Mrk
+ (r+l)E+1
+2Gh
",
l^i^h,
and therefore ||5||<Mr/t + (r+1)£ +2
(30)
by (10), if M i s large. (i)
First, suppose that 0 < E^%. In view of Proposition 1, and since h = mn = n = c7(k, r, 9)
by (V), (8), (9), there is a nonzero vector fieJh with fi(fi) = 0
and
| | n | | « m a x ( l , \\B\\e)<Mirk
+ ir+l)E
+
2)e
<Ml/i*k)
by (6) a n d (30). With X = (\i, 0) we have for large M, \\X\\ «£ M a n d
\A(l)\ = \C(\i)\^h\C\ ||nf <M~4/5M1/4^M-E by (29). (ii) Next, suppose that Proposition 2 holds for E — \ in place of E. We have h = mn by (9). Write H=(|ii,...,|i m ),
S(>i) = fi1(n1)+ •••
+BJ11J,
C(n) = C 1 ( j i 1 ) + - - - + C m ( j i m ) , where each n, has n components. Since n = c-,{k,r,6) by (8), there are nonzero vectors ]iu ..., ]im in J" with 5,(11,) = 0
and
|||i,||«max(l, \\B\\B)<Mirk «min(M 1/(4/c) , Mm5E)),
+ {r +
l)E+2)e
l^i^m.
(31)
284 DIOPHANTINE INEQUALITIES S e t t i n g X = vl\il ^,11,+
+ ••• + vm\im ••• +vmliJ
we have = C1(fi1)V1+
say. Since m = cs{k, r, E—\)
341
••• +Cm(]iJvkm
= D(x),
and
|£>| <max !C,.(n,)|
and \D(v)\ « M ~ ( 1 ~ » / f 4 £ ) ) ' £ - W \ D \ ^ M " £ + 1 / 2 - i / ( i 6 « - 1 / 2 < M - E if M is l a r g e . C o n s e q u e n t l y , i n view of X = vl]il
+ ••• + v m ( i m w e h a v e
\A(X)\ = \D(v)\<M~E and by (31) ||X|| < ||V|| llfiH « M 1 - l/<4£)+l/(5£) <
M
if M is large, i.e., Proposition 2 holds for E for forms with (3), and thus the proposition is proved. 5. THE PROOF OF THEOREM 1
Theorem 1 will be proved by induction on the values of k = max{kl,..., kh). The case k = 1 is proved by the box principle. We may suppose that |fj|= ... =\F,,\ = l. Given A/>2, consider the points leJs with li€P{M/2) (l^i^s). Then there are cl2(K) M2rs such points X. (See, e.g., [7, Lemma 11].) Given such a X, the point p(X) = (F{(X),...,Fh(X)) lies in the domain D: (pu ...,ph), where p; -Xj + yjt x,, y}£ U, \xj\ < (sM)/2 and \y}\ ^ {sM)/2 (1 ^j^h). Let v be the rational integer in ( C l 2 M 2 ") 1 / ( 2 A ) -lO<(c 1 2 M 2 ") I / ( 2 A )
285 342
WANG YUAN
and divide each region of pj in D into v2 subsquares of side (sM)/v. Since v2h < c12M2rs, there are two points p(X) and p(X/) such that for j= 1,..., h, Fj(X) and Fj{X') will lie in the same subsquare. Then \ = X — X' has
0<||AK||M| + ||M<M and for j= 1,..., h,
lFJ(A)\ = \FJ(X)-FJ(r)\^yJ(-vj
1/sMV
TsMV 2sM __ E£ +{—) < — « M
if s^zcn(h,
r, £ ) = c 5 (l,..., l;r, \,E) = u,
say. So Theorem 1 is true for k = m = 1. Let c 5 (l,..., I; r, m, E) = mu. Replace the indices 1 < / < mu by double indices 1 < / ^ m, 1
1 s£ i ^ m.
They are linearly independent and satisfy \Fj(X(i)\4M-E,
||3L(I)KM,
1<7
So Theorem 1 is true for k= 1. If F=F(l) = F(A,,..., A,) and G = G(p) = G(n1,...,/i,)
l<»<m. are forms, write
if there are / linearly independent points X-j,..., X, in /•" with GOi,,..., /x,) = F(^, > . ! + • • • + |x,Xr).
(32)
Put >MF,G) = minmax(||M,..., ll>-f||), where the minimum is over 'kl,..., X, with (32). Put \)/{F, G) = oo if F-h G. We use s{F) to denote the number of variables of F. Suppose that k > 1 and that Theorem 1 has already been proved for forms of degrees less than k. First we treat the case of a single form F of degree k.
286 DIOPHANTINE INEQUALITIES
343
LEMMA 8. Suppose k^l, / > 1, £ > 0 . If F is a form of degree k with s(F) > cl4(k, r, I, E), and if M^l, then there is a form G with F-*G and i]/(F, G)^M, and where G is a form in / + 1 variables, of the type
G =
+ H(v,vl,...,vl)
(33)
with \H\<$M~E\F\. Proof. Let e(l),..., e(/+ 1) be the first / + 1 unit vectors in Es. Consider the forms KPh...,Pk-u{y.) = HK .... K e(/»,),.-, e(pk-u)), <
M
(34)
•
where u takes all the values from 1 to &— 1, and plt -,pk^u all the values from 1 to / + 1. The total number of the forms (34) is less than k(l+ l)k, and each is of degree ^k— 1 in X. Each form (34) has \Kpi_ptJX)\^\F\. So by the part of Theorem 1 which we already know, we see that there exists c14(fe, r, /, E) such that if s ^ c14 there is a point Xo ^ 0 in Js with
IIXoKM and
\Kpt
ptJl0)\<M-
E
(35)
\F\
for all the forms (34). We may suppose without loss of generality that k0, e(l),..., e(/) are linearly independent. Writing G{n, v,,..., v/) = F(/iX0 + v I e ( l ) + ••• +v,e(/)), we have F^G and t(F, G) ^max(||J.o||,
||e(l)||,..., ||e(/)||)^M.
G is of the type (33) with a = F(k0),
F 1 (v 1) ...,v / ) = F ( v 1 e ( l ) + - - - + v / e ( / ) )
and H{n,vi,...,v,) =
Y (k)F(nk0,...,fiX0,v1e^)+
H fi
V"/
*—"—>
*
••• + v / e ( / ) , . . . , v , e ( l ) + ••• + v , e ( / » .
*-"
y
287 344
WANG YUAN
It follows from (35) that \H\<M~E\F\, and the lemma is proved. We omit the remaining part of the proof, since it is parallel to the corresponding part of the proof of Theorem A. ACKNOWLEDGMENT I am grateful to Professor W. M. Schmidt for his suggestion to consider the present problem and for all of his help.
REFERENCES
1. R. BRAUER, A note on systems of homogeneous algebraic equations, Bull. Amer. Math. Soc. 51 (1945), 749-755. 2. H. DAVENPORT, "Analytic Methods for Diophantine Equations and Diophantine Inequalities," Lecture Notes, University of Michigan, 1962. 3. L. G. PECK, Diophantine equations in algebraic number fields, Amer. J. Math. 71 (1949), 387^M)2. 4. W. M. SCHMIDT, Small zeros of additive forms in many variables II, Ada Math. 143 (1979), 219-232. 5. W. M. SCHMIDT, Diophantine inequalities for forms of odd degree, Adv. in Math. 38 (1980), 128-151. 6. C. L. SIEGEL, Sums of m-th powers of algebraic integers, Ann. of Math. 46 (1945), 313-339. 7. WANG YUAN, Bounds for solutions of additive equations in an algebraic number field I, Ada Arith. 48 (1987), 21^8. 8. WANG YUAN, Bounds for solutions of additive equations in an algebraic number field II, Ada Arith. 48 (1987), to appear.
a Vol. 32 No. 5
SCIENCE
IN
CHINA (Series A)
May 1989
ON HOMOGENEOUS ADDITIVE CONGRUENCES WANG (Institute
YUAN
( £ xO
of Mathematics, Academia Sinica,
Beijing)
Received August 26, 198S. ABSTRACT In this paper, the additive equations of the type a,A,* -f- ••• + cttX$ = 0 are studied, ajs being integers of an algebraic number field K of degree n. The main result is as follows: If J ^ ( 2 ^ ) " + I (or s^cl^nlogk. for 2 + ^ ) , the equation is solved nontrivially in any ^3-adic field, where ^5 is a prime ideal of K. Key words: additive equation, prime ideal, congruence, singular series.
I.
INTRODUCTION
Let K be an algebraic number field of degree «. For any X € K, we use /l ( ; ) (l ^= / ^ r ) to denote the real conjugates and Xim>{r + 1 ^ m =?S n) the complex conjugates of X. Let \ be a rational integer Js 1 and suppose « i , • • • , « , is a set of integers in K. Consider the additive equation 0 « , i f + ••• + nr^* = 0 .
(1)
One can apply SiegeFs generalized circle method15'65 on Waring's problem in algebraic number fields to prove that if s ^ cx(\, n) (hereafter we use
\X'im>\ < P . l < / < / .
(2)
The main term in the asymptotic formula is essentially a power of P multiplied by the so-called singular series connected to « , , • • • , « , . Ler ^3 denote a prime ideal of K and r be a rational integer the congruence
2& 1.
ff^f + • • • + axX) ss 0(mod?)3r). A set of numbers /l15 • • • , X, of K satisfying ( 3 ) is called a nontrivial ( 3 ) if Xt, •••, X, are integers, not all divisible by ^ .
Consider (3) solution of
1) We suppose t h a t the coefficients of additive equations and iofms a r e nonzero i n t e g e r s in K. t h r o u g h o u t this p a p e r .
(289) a No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
525
In order to derive from the asymptotic formula for the number of solutions to Eq. (1) in (2) that (1) either has infinitely many solutions or has a small solution in (2) with P depending on \, K, al} • • • , as (cf. [ 8 , 9 ] ) , we need to know that the value of singular series is positive. This is equivalent to the congruence condition: For any prime ideal power $% the congruence (3) has a nontrivial solution. Let r * ( ^ , K, S)3) be the least number such that if s > T*(^, X,^3r) and «!,•••, as are any given integers in K, the congruence (3) has a nontrivial solution. Write
r*a, K) = maxr*U, K,V). Peckt4] first established that T*(k, * O < *k2n+i + L However for the case of rational field Q, Davenport and Lewis[2] proved that T*(^, 0 ) ^ /^2 + 1, with equality whenever ^ + 1 is a prime. Chowla and Shimulacu showed that F*(^, Q) <1 c^log^ if \ is odd, which is best possible apart from some possible improvements on the constant c. Their methods can be generalized to treat the problem for the estimation of r * ( ^ , K ) , and we shall prove the following Theorem 1. We have
r*(k r>
if
* " odd'
~" 1(2^)" +1 , if -^ is an integer > 1. II.
PRELIMINARY LEMMAS n
For r 6 K, we denote 5 ( r ) = _^ rU) and E(r) = e ( 5 ( r ) ) , where e(x~) = e2*ix. i=l
Let d be the different of K. Suppose that a € K and aS = ^ / ^ 5 , where
s(«a*. v) = _Z £(«!*)» I (modfs)
-where X(mod'ip) denotes X running over a complete residue system. Lemma 1. Let d = U , N(^5) — 1).
Then
|S(«i*, ? ) | < (^ - lViVC^)". Proof. Choose JJ to be a primitive root mod^5. Then ^ = 7)ind'"(mod^5) for any ^t with ^P-f"^. The necessary and sufficient condition for the solubility of the congruence i* == ^(mod^3) is ^ind^, = ind^(modiV (^5) — 1) or d\indfi. If the congruence is soluble, it has d incongruent solutions mod^3. Suppose d = 1.
Then M(mod¥)
(see H e c k e [ 3 ] , p . 1 9 7 . )
N o w suppose t h a t d > \ .
Then
5(«A*. V) = 1 + E * E(«A«) 2 - ( ™ ^ Y M(mod1!)
m=0
\
d
'
290 526
SCIENCE IN CHINA (Series A)
Vol. ?2
where 2 * denotes a sum in which ft runs over a reduced residue system mod^B. Since
?, E(ctfi) = — 1 , we have M(mod$)
and by the Schwarz inequality we admit
|s(«a*,*)|'
|5(«l«,?)|J<(rf-l)S S* S* ,(^)£(«Cr-l)^)
- o* - 0 s (wcw -1 + 5T* * ( ^ - ) OT=1 ^
i*x (mod P)
(Tmodp)
\
d
'
'
= w -1) S (w(W -1 - £**' f^-))«i=l ^
T(modp)
X
d
/J
where 2 * * denotes the sum 2 * with T = 1 deleted. Since **ry** / windr \ __ > , -"c-** /mindr \ T(modp)
\
d
r(modp)
J
\
d J
-l+^)-'tt(=l)-l, we have |S(ol*,qs)| < ( r f - D \/iVC?). The lemma is proved. Let * be an integer of K such that sp||jir. If 5 is a set of complete residue sys tem modsp, then any integer a of K has a unique ^3-adic representation CO
<=o In fact, ,K0 is uniquely determined by ^0 = a(mod^5), /*, is then determined by a — ^O(mod^52) and so on. Consider two additive forms:
JT^I—
^
291 No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
527
A = 2 «/*? and S = 2 /W* <= 1
i= 1
with integer coefficients. We shall say that A is ^p-adically equivalent to B if A can be changed into A' by a transformation ^,- = r,-^,(l ^ * ^ s) such that A' = y 5 (modspr) for any r > 1, where r,-(l < i < s) are nonzero integers of K. It is easily seen that the relationship is reflexive and transitive. Now we proceed to prove that the relationship is symmetrical. In fact, suppose that
2 <%(*/*)* = r SftA*?(mod?')
(4)
holds for any r ^ 1. Then set ^,- = rt,- • •r,_ir/+1' • •tsli{\ ^ < < s). f
We have
f
2 ftr*(ii. • -r^r,-^- • -tsyx} = r^ 1 2 " ^ ( ' r - •r,_1r,+1- • -r,)*i? *= !
«= t
If the congruence (3) has a nontrivial solution for every r, then it is said that the equation A = 0 is solved nontrivially in sp-adic field or that the form A represents zero ^J3-adically. We may prove that if A and B are ^5-adically equivalent, then they can or cannot represent zero simultaneously in the "Sp-adic field. In fact, from (4) the solubility of A = 0(mod^3r) is found to follow from the solubility of B = 0 (mod^J5r') for some sufficiently large r'. Lemma 2. Any additive form A is equivalent ty-adically to a form of the type F = pw + xpM +
1- w «-iF ( <-»,
(5)
where Z7''' is an additive form in Vj variables {the variables in distinct forms Fiiy being distinct) with all coefficients ^ 0 (mod^3), and where va^$l\. Proof. Represent every a,- by a series of it. By a substitution A,- = ^'fi,- with suitable r , ( l =£~/ s/\. Put A,- «= Tt/z,- for the variables in Fm. Then F is equivalent sp-adically to the form Hence we can choose a cyclic permutation of F ( o ) , • • • , F(*~i:> to ensure that the number of variables in F (o) is ~^ s\\. The lemma is proved. III.
THE PROOF OF THEOREM 1 (ODD DEGREE
K)
We use the notations: II = J J a,-, e means any pre-assigned positive number <= i
and \ means an odd integer ^ c ( s ) .
Lemma 3. // *$\Tt, then
292 52S
SCIENCE IN CHINA (Series A)
Vol. 32
r*tt,K,qO<(-2-+s)log*. V log 2
/
Proof. 1) Suppose iV(sp) < k * . Consider the 2s — 1 sums 2+ n
«,-(1 < i < f ) , a,- + a,( 1 < i < ; < * ) , • • • , « ! + • • • + a^. If 2'— 1 >2V(?P), then at least two of the sums are congruent mod^3. Since —1 is a ^th power residue mod^P, the congruence A = 0(mod5p) has a nontrivial solution if 2' > * 2+£/2 (l + kT1-*'1) or Hog2 > (2 + —^log^ + log(l 4The lemma follows. 2) Suppose N(ty) > ^2+E/2.
k'2'en).
We shall prove the following stronger inequality
r*u,
K, ?) <
[!•] + 4.
Let M(^5) denote the number of solutions of the congruence ail\
+ ••• + «,_,!*_! = — a,(mod?P), ^,(mod^), 1 < /' < s — 1.
Then
M » ) = ^ S "V-Py
c
2 ••• S JjCmodp)
£(*(«.*?+---+«,-itf-i+ «,)),
l._i(modt)
where jt runs over a complete residue system of (^P^)"1, mod 8~l. Therefore
W(?) = W(?)''! + W(?)-'S' £(fw,) X *(/«/^» ¥). By Lemma 1, we have
Consequently, if
(^ - i y - w ( ? ) ~ r < zv(qsy-2,
^
y
then
MOP) > 0. If ^ satisfies
N($) > k^ •= V+T^I, t h e n ( 6 ) h o l d s . ( 7 ) follows from A T ( ? ) > * + 4 , w e can get a nontrivial
2+e/2
if s — 3 > 8 / e . H e n c e if
(7) s^[S/e]
solution
of t h e congruence A = O(mod^P).
T h e l e m m a is p r o v e d .
Lemma 4. Suppose that ^Tl^'^p
and pb\\ki where p is a rational
prime,
293
No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
^ ^ 1 and £ > 1.
529
Then if w > (b + 2)e, we have
\ log 2 Proof. Suppose u> = {Jb + 2)e. 2
/
Let j be an integer such that 2
2' — 1 > ATU) > NO) * > 2V(?)2*e > iV(^3)(*+I)'.
(8)
Then at least two of the sums «,-(1 ^ / ^ s), a,- + «,-(1 =^ /
J)
, • • •, a t + • • • + as
( +I)
^re congruent moctf)3 * % i.e. the congruence ^ = 0(modq3(*+1)e) l a s a nontrivial solution. From (8) it follows that the condition of .y is H o g 2 > l o g ( ^ » + 1) or
The lemma holds for the case w = (3 + 2)e. the congruence
Suppose that w ^ {b + 2)e and that
y* = 0(mod (?*"') has a nontrivial solution 215 •••, ^ . Without loss of generality, we may assume that ^Pl^i. We now proceed to prove that A = 0(mod SP"O also has a nontrivial solution. Set Pi = lt + v.it"-1"-*, K
/ < s.
We start to show that
2 am1} = 2 «A* + ^"'~*5""': 2 «/»'/^"1(mod?"'). <= 1
i= 1
i= 1
In fact, consider the (h + l)-th term ( ) ifi.Viit"'1"'')'' \h / of
(9)
in the binomial expansion
^ - (1/ + v,**-*'-')*, where A > 2.
Suppose /> a p.
Since (
\h i
) = -f ( ,
)> the (A + l)-th term is
h \h — 1 /
divisible by SJ3*, where g = h(w — be — ) + be — ae.
To prove (9) it suffices to show that g ^ w or (A — l ) ^ — £ 0 ^ A e + oe. Since w ^ (b + 2)e, it suffices to show that
294 530
SCIENCE IN CHINA (Series A)
Vol. 32
2(A— l ) e Ss (/»•+• a)e, i. e.,
(10)
h^a+2.
Since 2 ^ and p\\, we have 3 " < f ' ' < A , and therefore (10) follows by 3° = (1 + 2)" ^ l + 2 a ^ a + 2 for the case a ^ 1. If a — 0, (10) follows immediately from h > 2. Write
/t = **> and 2 «>•*.*
=
"^"'^
<= i
in their ^3-adic representations, where ^ q o .
Then from ( 9 ) , we have
Since (qoa^i" 1 , ^5) = 1, the congruence (/> + cpa^-'Vi = 0(mod^O has a unique solution v1(mod^3'0. A*IJ
••••>!**
P u t "/ = 0(2 ^ « ^ i ) .
Then we have a solution
of
2 «••*•? = OCmod?"), i-l
where ^Pi.
The lemma follows by induction.
Proof of Theorem 1 (odd degree ^ ) . the forms F of the type ( 5 ) .
By Lemma 2, it suffices to consider only
1) Suppose ?P|^. Then it follows by Lemma 4 that the equation FC0) = 0 can be solved nontrivially in ^3-adic field if [ 2 \ v<,> [+ s nlog^, \ log 2 / and therefore F = 0 can be solved if V log 2
/
The theorem follows. 2) Suppose ^ \ \ and ¥>\TL. If * > (
\ log 2
+ ellog^ and w > 2, then we may /
assume that F = 0(mod<)3"/-1) has a nontrivial solution with ^Plili. Now we proceed to show that also has a nontrivial solution. Set
fii = Xi + Vi*f»-\ K
/ < s.
F = 0(mod^ K ')
295 No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
531
Then
s
Since 2 «/*? i s divided by (^"^f"" 1 , ?"0 = ^w~l, the congruence x
2
«,•!? + V " 1 ^ " 1 ^ = 0(mod'?5"')
i= l
has a unique solution i>l(mod'$5). Put Vj •= 0(2 ^ z ' ^ . f ) . We have a solution of F = 0 (mod^P"') with ^ ^ O(mod^P). The theorem follows by induction. 3) Suprose SP-I1^ and ^3|II. It follows by 2) that Fm = 0 is solved nontrivially \ / 2 in ^(3-adic field if v0 ^ ( + e) log^, and therefore F = 0 is solved if \ log 2 / \log2
'
The theorem is proved. IV.
THE PROOF OF THEOREM 1 (ARBITRARY DEGREE ^)
Let p denote a rational prime and w{a) the exponent with which ^3 enters into the canonical factorization of a, i.e. ^3w<;'')||o! and
l
(11)
>~[jz-i\ + be + l>
where pb\\\ and ^||/>. Lemma 5. The series
±4-
•=it\
are convergent provided to(a) >
and ±{-iy°-
P— 1
<=i
, and they are denoted
log(l + a) respectively. See Ref. [ 7 ] . Lemma 6. Suppose ^3^/?.
i
// the congruence ftk = a(mod$'°)
Aoi a nontrivial solution, then so has the congruence / V = a(mod^5') for any I > /„. Proof. Since *P-f(?, there exists ^ such that /?^= I(modq3').
by exp a and
296 532
SCIENCE IN CHINA (Series A)
Set r = ap and 7 — f* = Sp'°.g>, where ^ l
follows from £* (— — \\=^> o^ Vj* /
Vol. 32
is an integral ideal.
that
Since (f, ^3) = 1, it
Therefore by Lemma 5, there
exists
lDB 1 +
(
^-1))"l0gF-
Since
" (| l 0 g ^) -
U
( l0g ^) ~ »W >U-be->
-f_,
there exists also exp( — l o g ^ ) = A, say, by Lemma 5. Then
r = U£)* and therefore /4f is an integer.
Choose an integer IJ such that
»Uf
-n)>l.
Then M(IJ*-?)-«(IJ*-UI)*)>/,
i. e. JJ* = y(mod^'). The lemma follows. Lemma 7.
Le» (/ = (^,N(sp) — 0 . Suppose that <*i---(*d+i^ 0(mod^3).
Then «^{ + • • • + ad+ll%+1 = 0(mod^3) has a solution Proof.
with Xt ^ 0 (mod^5).
It is well known that the congruences y* = m (mod^5) and yd = m (mod'p)
are soluble or not soluble simultaneously. Hence if the conclusion of the lemma does not hold, then for any X2, •••, %d+i> we have r- ad+l lkd+L H 0 ( m o d $ ) ,
«i + CHX\ + i.e.,
( a , + cnli + ••• + ad+1Xi^Ym~l
= 1 (modq3),
which should be an identity. But the expansion of the left-hand side contains a term ffv.^2
^d+i)
d
—ayt>2
Ad+1)
297 No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
533
where ^>\a, and every other term contains at least one of the variables X2, •••,Xd+l with a power less than AT(^3) — 1, which leads to a contradiction, and the lemma follows. To prove the theorem it is sufficient to consider only the forms F of the type ( 5 ) . First we define an operation of contraction as follows. Consider a sum of d + 1 terms in F (0) .
Since at- • -ad+l^
ayl\ + • • - + ai+lXi+i 0 (mod^p), the congruence
(12)
«ii«* + • • • + ad+lfid+1 = 0 (mod^P) has a solution with (ii ^ O(mod^p) by Lemma 7. We can assume that the left-hand side of the congruence is equal to a nonzero number a, or otherwise it follows directly that F = 0 is solved nontrivially in the ^3-adic field if s ^ d + 1. Set A,- = nil (1 < i < d + 1). Then there holds M ? + • • • + aJ+lXd+l = (oti^f + • • • + ad+1fj.d+l)\*- = a^*> where sp''||as, / ^ 1.
(13)
Thus a has a $p-adic representation a = VV,+ • • • , Wvi.
(14)
Therefore the operation of contraction consists in replacing the sum (12) by a single term (13). Notice that X^O (modsp) implies 1 , ^ 0 (mod^5), where 1, is called the distinguished variable in (12). Operations of contraction are applied to groups of d + 1 terms in Fw and here any one of the variables can be chosen as the distinguished variable. The number of remaining variables in F (o) is t h e n ^ d , and we put them to be equal to zero. Hence there results a form of the type
*Gia + ^G(» + • • •, where G<;) contains the original Vj terms of Fw together possibly with some additional terms, each arising in the form (13) from one of the contractions. The variables in these additional terms are called the derived variables. If i ^ \ , we define #,- = 0. The next step is to apply contractions to groups of d + 1 terms in G(1), subject to the condition that each group contains at least one term with a derived variable; such a variable is chosen the distinguished variable in the contraction. The process is continued, and at each stage we take care that at least one of the variables in a group is derived, either directly or indirectly, from a variable in Fm. Suppose that, after a series of permissible contraction, we get a form H such that H = 0 (modsp'o) is soluble with at least one of the derived variables in H, not divisible by ty. This implies a solution of F = 0(modsp'°), and on tracing back the derived variable to its ancester in F(0>, we see that the solution is nontrivial. Finally, if we get a form H = 7t^HM +
W «+IH<«+»
+
•••
(15)
298 534
SCIENCE IN CHINA (Series A)
Vol. 32
in which any one of the forms HW|)), H u ° + 1 ) , • • • contains a derived variable, then we take the derived variable to be 1 and all the other variables equal to zero.
Thus a
nontrivial solution of F = 0(mod^)3'») is derived. Lemma 8. We can obtain a form H of the type (15) from a form of the type ( 5 ) by repeated contractions, where H U ) j Hiu+i>, • • • are additive forms in distinct variables with all coefficients ^ 0 (mod'ip). For i^k.— 1» the form H (j) includes the terms of F{'\ and possibly some additional terms contain derived variables; for j ^ \ the form H^ can contain derived variables only. Further, if Su denote the total number of derived variables in H, then
We divide the v0 terms of Fm into m sets
. Proof. Suppose first that « = 1. of d + 1 terms, where m
= I" v" 1 ;=> _ i ^ ld+
1i
d
d+ 1
> _^>
d+ 1
1
d+ 1
The lemma holds. Suppose that u ^ 1 and the lemma is true for «, We proceed to show that the lemma holds for « + 1. Let w denote the number of derived variables in H, — is Su — w, We divide the vu -r* w terms in H(<0 into as many sets of d + 1 terms as possible, subject to he condition that each set contains at least one of the w derived variables. The number of sets formed is allowed to be if vu ^
(w,
\\*z±JL\t
dw,
MvH
(L d + l J The remaining variables in Hiu) are equal to zero. contracted into a single term xsalk,
£>»4-l,
Each set of d + 1 terms can be
a^5=0 ( m o d ^ ) .
Adding such a term to the corresponding form itgH{g}, we obtain a form of the type ^.a+ipCB+O +
x«+2pl.u+2)
+
. . .,
where each Pw> contains the variables in HC'J and derived new variables of the form a?al', ^\a. The total number of derived variables in P(a+I>, • • • is expressed as
1
u>,
if vu ^
dw,
[^t«L], if Vu
In the first case, we find c A
-+
i
c --> *"^(d+
In the second case, we find
v
"
i)«
— 1 •>
v
° — 1 (d+iy+i
299 No. 5
HOMOGENEOUS ADDITIVE CONGRUENCES
535
1-4 + 1 J ^ 5B — #/ + — 4+1 Since w^Su,
-— 4+ 1
it follows that
58+I >
5
" + dw ~w <£+l ^+1 i
Su
f«
4+1 •->
+ v"+w 4+ 1 4
4 + 1
^
! _ 4+1 4
Su
4 + 1" 4 + 1
fo
1
4
(4+l)«+1
4+1
4+1
=
4 + 1 ^0
j
(4+l)»+1
and the lemma follows by induction. Lemma 9. If s ^ (2^)" +1 , the congruence F = 0 (mod
0
.
If 2V(
d = (^, iV(?) - 1) = (*, /»' - 1) = (it,, />' - 1), d + 1 < min(2^0, pO and (4 + 1)'« < (4 + l)-^.+*»+i
< (.P^W • (2/t.) < 2» + l (V*) / e < 2»+^». Therefore, Lemmas 2 and 8 lead to '•
(4+l)'»
/^(4+l)'o
^(2«"+1
The lemma is proved. Proo/ o/ Theorem 1 (arbitrary degree /^). Suppose that lt, •• • ,XS is a solution of a^f + Avith sp|i,.
r- eg,* = 0 (mod'ip'o)
Let / > /0 and (1.1 = l i + 7tl"v,
2 < i < j ,
where v runs over a complete residue system mod ^5;"'«. ence a^
By Lemma 6, the congru-
= — a2fi2 — • • • — asfi^ (mod ^5;)
-has a nontrivial solution X for any given fi,,--',
fis, i.e., the congruence
a 536
SCIENCE IN CHINA (Series A)
+ • • • + a,X) = 0 (modsp')
aiX* u 7|)><
has no less then JV(sp) ~
Vol. 32
'~I) nontrivial solutions.
The theorem is proved.
EEFEEENCES [ 1] [2] [3] [4] [5] [6] [7] [8] [9]
Chowla, S. & Shimula, G., On the representation of zero by a linear combination of £-th powers, Norsfa Vid. Sets. Fork., 36(1963), 169—176. Davenport, H. & Lewis, D. J., Homogeneous additive equations, Proc. Roy. Soc, A 274 (1963) 443—460. Hecke, E., Lectures on Theory of Algebraic Numbers, Springer-Verlag, 1980. Peck, L. G., Diophantine equations in algebraic number fields, Amer. ]. Math., 71 (1949), 387— 402. Siegel, C. L., Generalization of Wiring's problem to algebraic number fields, Amer. ]. Math., 66 (1944), 122—136. , Sums of m-th powers of algebraic integers, Ann. of Math., 46 (1945), 313—339. Tatuzawa, T., On Waring's problem in algebraic number fields, Ada Arith., 24(1973), 37—60, Wang Yuan, Bounds for solutions of additive equations in an algebraic number field I, Acta Arith., 48(1987), 117—144. • , Bonuds for soluitons of additive equations in an algebraic number field II, ibid., 48(1987), 307—323.
301 Reprinted from JOURNAL OF NUMBER THEORY
Vol. 45, No. 3, November 1993
All Rights Reserved by Academic Press, New York and London with permission from Elsevier
Small Solutions of Congruences WANG YUAN Institute of Mathematics, Academia Sinica, Beijing 100 080, China Communicated by Alan C. Woods Received June 10, 1990; revised February 28, 1992
be a system of quadratic forms with Let Qj(k) = Ql(ll,..., Xs) (l^j^h) coefficients in integers of an algebraic number field K of degree n, and let a be an integral ideal of K. The purpose of the paper is to prove that the system of congruences Qj(k) = 0 (mod a) (l^j^h) has a nonzero solution X satisfying max,j. |A]''| <£N(a)1/2 + i provided that s^c(h,n,s). This improves a result of T. Cochrane (1987, Illinois J. Math. 31, 618-625) and also gives a generalisation of a result of R. C. Baker (1980, Mathematika 27, 30-45). The small solutions of additive congruences are also considered. © 1993 Academic Press, Inc.
1. INTRODUCTION
Let K be an algebraic number field of degree n over Q with a ring of integers J. Let a ^ H E . ^ K . ^ O l U K,(/> = °%0), 1 ^j^h) be a system of h quadratic forms in k = (A,,..., 2.s) with coefficients in J. Using a generalised geometrical method of Schinzel, Schlickewei, and Schmidt [5] on the small solutions of quadratic congruences, Cochrane [3] proved that if a is a nonzero integral ideal of K and h < s/2, then the system of congruences Qj{-k) = Q
(modo),
l^j^h
(1)
has a solution X in J with 0 < max \N(X,)\ ^ c, (K) N(a)s,
(2)
where a + 3/2(s-l), \h/(h+l) + h/(h+l)(s-r),
if h = 1,2, if h>2.
c(f, -., g) denotes hereafter a positive constant depending on /,..., g, N(X;) 261 Copyright © 1993 by Academic Press, Inc. All rights of reproduction in any form reserved.
_ ^ _ _ _
302
262
WANG YUAN
and N{a) are norms of A, and a, and r is the remainder on dividing s-h by h + l. However, in the rational case, Baker [1] has given a result in which d -> \ rather than h/{h + 1), as s -> oo. Baker [2] proved also that for any given £ > 0 and integers k, q^2, if s^ c2(k, h, e), then the system of h congruences s
X a,y** = 0
(mod?), U / ^ A
./= i
with coefficients in Z has a solution in nonnegative integers satisfying 0 < m a x x , ^ 9 1 / A r + £.
xl,...,xs (3)
We may use the form xk + ••• +xks (k^2) to show that the limiting exponents \ and \/k in (2) and (3) are best possible, even when K= Q and h=\. The proof of Baker's results is based on a discrete version of Schmidt's method on small solutions of additive equations in many variables [6]. In Baker's argument, the relation «
>
„_,
exp
/
,au\
fl,
if
q\a,
q)
10,
if
q\a,
2TT/— = <
V
is used instead of the integral over [0, 1) in the circle method, and the case h— 1 of Baker's estimation (3) is derived immediately from the following Schmidt theorem: Let au ..., as, bu ..., bs be natural numbers. Then there is a constant c3(k, e) such that if s^c3(k, E), the equation a , x ? + •••+asxks=b1y\+
•••+bsyk
has a solution in nonnegative integers x { ,..., x s , y l t . . . , y
0 < max (xh yj) < max (a,, bj)[/k i.j
s
with
+e
.
i,j
(See Schmidt [6].) Since Schmidt's theorem has been generalised to algebraic numer fields by the combination of his method and Siegel's version of the circle method [7, 8], we could generalise the above Baker theorems to algebraic number fields by a similar discrete method. Let K{l) ( K / ^ r J be the real conjugate of K, and K{m) and K(m + r2) (rt + 1 ^ m < rx + r2) the complex conjugates of K, where rt + 2r2 = n is the degree of K. Throughout this paper, the indices / and m are over the sets of integers cited above. For yeK we denote by y(l> (l^i^n) the
3ra SMALL SOLUTIONS OF CONGRUENCES
263
conjugates of y. A number y of K is called totally nonnegative if y ( / | ^ 0 , and we denote by P the set of all totally nonnegative integers of J. We use a, q,... to denote the nonzero integral ideals, p, px,... the prime ideals, <5 the different (ground ideal) of K, and e any pre-assigned positive number. The constants implicit in the symbols <^ and 0 may depend on k, h, K, e,... but not on a, q,.... THEOREM 1.
Let
F ( W=iv;,
Ui<*
(4)
7=1
be f o r m s with that
coefficients
i f s ^ c 4 ( k , h , n , e ) , there
in J . Then
(mod a),
Fi(k) = 0
is a X e P s
1
such (5)
and 0<maxN(Xj)<$N(a)l/k j
+e
.
THEOREM 2. Suppose s~^cs{h,n,z). Then the system congruences (1) has a solution X in Js with
0 < m a x \N(A.j)\
+e
of quadratic
.
We prove Theorem 1 first and then derive Theorem 2 from Theorem 1 by the method of algebraic diagonalization with the aid of the box principle. Since the conclusions of Theorems 1 and 2 can be improved to N(a)s if K is a totally complex algebraic number field, we assume in the following that r, is positive. See Wang [8, Chap. 11].
2. LEMMAS
Let co1;..., con be a basis of / and D the absolute value of the discriminant of K; i.e., D = |det(wj' ) )| 2 (1 < / , . / < « ) . Let y, (1 ^j^n) be numbers of K and Xj (l^j^n) be real numbers. We set £ = Z"=i xj"?j a n d define w x Z, = Tj-\ jy? (1 < ' ^ « ) - W e u s e t h e notations
ll^maxl^'l,
S(£)=t
Z W>
E(Z) = exp(2niS(Z)),
and P{T) the set of integers in P satisfying ||A||< T.
304
264 LEMMA
WANG YUAN
1. Suppose a eJ. Then
Z£K«)={^(0)' ^
(.0,
V"; otherwise,
where t; runs over a complete residue system of (ad)~\
m o d <5~'.
See, e.g., Wang Yuan [8, Chap. 2]. LEMMA 2. Le? T, (1 < / < « ) be positive numbers such that Tm + n= Tm. Let fieJ and N(a, T) denote the number v of P satisfying
vsju(moda),
|v (m) |^r m .
0^v{l)^T,,
Then
where To = max(Af(a) 1/n , (Ty • • • Tn)l/"). See, e.g., Wang Yuan [ 8 , Chap. 3 ] . Remark. Take Ti = c6(K) N(a)l/" (1 < / < « ) , where c6(K) is sufficiently large. Then it follows from Lemma 2 that N(a, T ) $> 1; i.e., there is a veP satisfying v = ju (mod a) a n d 0 < ||v|| ^ ^ ( a ) 1 7 " . Therefore we may choose a complete residue system R(a), modulo a, such that yeP and
0<||y||
3. Let /(A) = akXk + • • • + a, A be a polynomial with coefficients in J and a^/O and let S(f,T) = YjieP(T)E(fW€)> where A runs over all integers in P(T). Suppose that T^c7(k,K,e), C^T"~l/r~l + \ and \S(f, T)\ ** C. Then there exist aeP and fieJ such that LEMMA
II««*£-0M(^-J
T'k^
and
O
T\
See, e.g., Wang Yuan [8, Chap. 3]. LEMMA
4. Let F(X) = £ J = i a, Af be an additive form with nonzero integer
a
SMALL SOLUTIONS OF CONGRUENCES
265
coefficients in J. Suppose that s^cg(k,n) and that a-" ( 1 ^ / ^ s ) have different signs for each I. Then the equation F{X) = 0 has a solution "kePs with
0<max m.-Mmax ||a,-|]C9(*'") See, e.g., Wang Yuan [8, Chap. 8]. LEMMA 5. Let c = c%{k,n) and r be a natural number. Then there is a matrix Gr=(gij) (l^i^r, l^j^c1") whose entries are + 1 having the following property. Given integers /?,-, with ||jS,y||^5, there is a k in Pc' satisfying
(6) .7=1
and
0<max m,-||«5fl0(*'r''1).
(7)
Proof. We take c > 2r t , and for each j , 1 ^ j < r ls we choose ^I J2 _/- i and gU2J such that gt.2,-1, P[%-i and gi,yPluv h a v e different signs. Note that if there is a Ptj = 0, then the assertion of the lemma is obvious for r=\. So the case r = 1 of the lemma follows from Lemma 4 by taking clo(fc, 1, n) = cg(k, n). Now suppose that r^-2 and that the lemma is true for r— 1. Let Gr be formed by Gr , as follows:
0,The vertical lines here divide Gr into c blocks. The variables / ; ( U j < c ' ) are also divided into c blocks with indices Bl = {1,..., cr~'},..., Bc = {(c— 1) c r x + 1,..., cr}. By induction we can choose gtJ ( l < / < r — 1 , jeBv) such that there are ^7 (je Bv) in /" satisfying
£ g,jPvrf = O,
i^i^r-l
(8)
ye i^-
and 0<max||^.||«5 cl0( * r - r - 1 -" ) .
(9)
306 266
WANG YUAN
For 1 < v < c, let aD be the integers given by « , = I PrjHkJ. JeBr
T h e n w e m a y c h o o s e grj=gr(Bv)
s u c h t h a t g,(BL)
(jeBv)
a[n
(\^v^c)
have different signs for each /. Consider the equation gr(Bl)xlvkl+
acvkc=0.
•••+gr(Br)
(10)
It follows from Lemma 4 that (10) has a solution v in Pc satisfying 0 < m a x ||v,-Hmax \\a.\\'^k-"^
B(]+k'mik-r-l-"))c''(k-").
(11)
Define A,- = vvn, (ieBv). It follows from (8) that (6) holds for / = 1,.., r- 1. From (10), we deduce that (6) also holds fory'=r. Equation (7) follows from (9) and (11) and by taking
cl0(k, n, r) = (1 + (k +l)cw(k,r-l,
n)) cg(k, n).
The lemma is proved. Remark.
Lemma 5 was established by Baker [2] for K= Q and j8,y>0.
LEMMA 6. equation
For any given 2s nonzero integers a l 5 ..., as, jS l5 ..., fis in P, the
has a solution in integers ll,..., Xs, nl, ..., ns of P, not all zero, such that
max (JV(A,), AT(^))«max (JV(a,), 7V(^))1//r + £
provided that
s^cn(k,n,e).
See Wang Yuan [7, 8]. LEMMA 7 (The case /J = 1 of Theorem 1). Suppose that s^cA(k, am/ a , e / (1 ^ / < ^ ) . 77;en //;e congruence
£ a,A* = 0 i=
(mod a)
1, n, e)
(12)
I
Ziai1 a solution l.ePs such that 0<msixN{li)
+e
.
(13)
307
SMALL SOLUTIONS OF CONGRUENCES
267
Proof. B y t h e r e m a r k of L e m m a 2, w e m a y s u p p o s e t h a t u,eP a n d N(oLj)<$N(a) ( l ^ K s ) . Take a e a such that aeP and N(a)^N(a.)
(14)
Take c4(k,l,n,e) = cn(k,n,e). Then it follows from Lemma 6 that Eq. (14) has a solution in integers A,, ..., Xs, ^ l 5 ..., (is in P, not all zero, such that max (N(A,), N{nj)) < max(max N(«,), N(a))l/k
+s
4 N(a)1/k
+
\
It is clear that >. # 0 , since r, > 0 . Hence from (14) we have a solution X of (12) satisfying (13). The lemma is proved.
3. REDUCTION PROPOSITION 1. Let l/k^x^l and s^ci2{k, h, n, x, e). Let FjCk) (l^j^h) be forms as in (4). Then for each ideal a, there are integers Aj,..., Xs in P satisfying (5) and
0<maxN(li)
+e
.
The case x = l/k is Theorem 1. It is obvious that Proposition 1 is true for x = 1, because we can choose by Lemma 2 an integer a satisfying aeP, a|a, and 0
N(a)^cii(k,
h, K, x, e). In fact, if N(a)
then (5) has a
solution A, = ••• = A J = a with a stated above such that
N{a)
+
'.
Let X be the set of x such that Proposition 1 holds. X contains 1, and so X is not empty. It is clear that X is a closed set. Hence the proof of Proposition 1 is reduced to proving that if 1 > x > l/k and x e X, then there exists an x' e X with x' < x. We assume that Theorem 1 holds for h— 1 forms (h^2) by the induction, since Theorem 1 is true for h = 1 by Lemma 7, and that Proposition 1 is true for a number x of X. We proceed to show that Proposition 1 is true for a number x' with x' < x. Suppose that j is a rational integer ^ 2 and that there is no prime ideal p such that pj\a. Then a is called ay-free ideal. Now we first show that
308
. 268
WANG YUAN
if Proposition 1 is true for square-free moduli in at least ct4(k, h, n, x', e) variables, then it is also true fory-free moduli, provided that s^c'M '. The rational case of this assertion was established by Baker [ 2 ] . Now we use the induction and assume that the assertion is true for (y — l)-free moduli, where y > 3, and we proceed to prove the assertion fory-free moduli. Write a ./-free ideal a as a = n ?= i P f, where 1 ^ a, ^ j - 1 (1 ^ / =$ q) and where pt, pr (i¥=r) are distinct prime ideals. Let * ; = a,if l^ai<j-\ and and 6, = a , - l otherwise. Let al = YlUiP^ a2 = Y\Ui PT~h'- T h e n 0 = 0 ^ 2 , where ay is (j— l)-free and a 2 is square-free. We may choose an integer nu) such that (nli), a) = fp, (i=\,...,q). See, e.g., Hecke [4, Theorem 74]. Set n^ = Y\Ui ^i)b' and n2 = Y\t=\^U)"'~hl- Then a, j TI,, a217r2 and n2\iti. Any a in K which is a p,-adic integer for all / has a unique representation « = Z Pit'i' ;=0
M,e^(
where Ria^ is a given set of complete residue systems mod a,. In fact, there is a unique fi0 such that a = /i 0 (mod a j by the Chinese Remainder Theorem, and nx is then determined by 7 1 , ^ =a — pL0 (mod a\), and so on. Set M = C 1 4 2 , i> = c 1 4 , and s = uv. Rewrite the forms (4) by F , ( A n , ...,*„,)= t i=
( a i l ( ; ) A * 1 + ••• +aiu(j)Xl),
l^j^h.
I
By the assumption of induction, we may choose integers X'n,..., X'iu in P such that «« U) A/i* + • • • + a,B (;) A;* = 0
(mod a), 1 < j ^ h
and 0<maxJSr(A;,)«JV(o,)JC' + *. Write a, (;) = «/i (y) A;,* + • • • + «,„ (y) A;B*.
Expand a,(y) in a power series of nlt
where 1=0
I
< / < v, 1 < j < A.
309 SMALL SOLUTIONS OF CONGRUENCES
269
Since it2\n1, /?,(./) is also a power series of n2, that is,
j8/(7)=f v}JV2J
vfeR(a2).
1=0
Since a2 is square-free, we derive by the inductive hypothesis that the congruences
t PiU)rf= t v ^ N «
1=1
(moda2), 1
i=l
have a solution in P" satisfying
0<m!nN([ii)
l^t^u).
Fj(kn,...,kvu)
+s
.
Then we have =0
(modo),
l^j^h
and 0<maxN(Xil)
+e
.
This completes the proof of the induction step. In particular, Proposition 1 holds for x' if s ^ c\^y and a is fc-free. Now we may write any ideal a as a = 93*(£, where £ is A>free. So if we set s = ckl4i, we have integers k\,..., A^ in P such that F , ( r ) = Fy(Ai,...,A;) = 0
(modK), 1 < ; < A
and 0<maxiV(A,')<|A r (e) v ' + e. We take an integer ^ by Lemma 2 such that PeP, Af(/9) <^iV(»). Then X = 0k' = {pX\,..., fik's) satisfies
Fj(X) = pkFj(X') = 0
(mod a),
5B/j8, and ./V(2$)«S
l^j^h
and 0 <max N(Xf) = 7V(/S) max N(X-) < (N{®)k N(<S,))X' + B < N{a)x' i
i
Therefore we may assume that a is square-free in Proposition 1.
+
*.
310 270
WANG YUAN 4. DIVISION INTO TWO CASES
Set y = (x-^\cio(k,h,n)-l(2(h z = (x-l-\y(2h
+ 6)n)-\
+ 6)-[
(15) (16) (17)
x' = x-z. We have - + cl0{k,h,n)2y(h
+ 5)n
= ^+(x-^\2(h
+ 5)n(2(h
+
6)n)-1
=-j;+ (*-£) (/i+ 5)(/! + 6r 1 = x-(x-^\(h
+ 6)-1<x-z = x'.
(18)
Write a , = (<xu,..., aht) (l^i^s) for the coefficients of A* in (4). For any two vectors a = (au ..., ah) and P = (/?i,...,fih),we denote by aP = X''= i a,-)?,• the inner product of a and p. A vector y = (y,,..., yh)eJh is said to be prime to an ideal q, if the greatest common divisor (y 1; ..., yh, q ) = 1, where y, is regarded as the principal ideal generated by y,. Condition D(k, h, t, a, y). For any t coefficient vectors, say a,,..., a,, any divisor q of a, and any y in Jh prime to q such that ya, = 0
(modq), 1 «£/=%/,
we have N(q)^N(ay. PROPOSITION 2. Let t be an integer ^ 1. Let the forms Fj(k) (l^j^h) have the property D(k, h, t, a, y). Then if s^cl5{k, h, n, x, t), the system of congruences
FjCk) = Hj
(mod a),
l^j^h,
m SMALL SOLUTIONS OF CONGRUENCES
has a s o l u t i o n k l t . . . , ks, [ i x , . . . , \i h in P s + h 0 < m a x | | A ( M ^ ( a ) ( 1 / * + -v)(J/'" i
271
satisfying max \\^\\
and
+ 4)
.
i
Let d=c4{k, h — l,n, z), w = cl2(k, h,n, x, z), and t-dw. We proceed to show that Proposition 1 is true if F, (1 ^j^h) satisfy the condition D(k, h, t, a, y). Write c — cg, u = cl5,
and s = chu. After
a change of
notation, (4) becomes < • *
I
(«rlU)X-krl+-~+"n.U)*kJ = O
(mod 0 ), 1 < j ^ h.
(19)
r= 1
For each r, 1 ^ r < ch, consider the system of h forms gjr(*riU)*k1+
••• +«™a)A*J
(l^j^h)
in u variables. These forms satisfy the condition D(k, h, t, a, y). Note that the introduction of gJr ( = ± 1) does not affect the condition (7,,..., yh, q) = 1. We choose gjr (1 ^j^h, i^r^ch) for the case such that f}jr are all totally nonnegative in Lemma 5. It follows from Proposition 2 that the system of congruences «>(«MU) K1+ •••+ OLruU) Ku) = vrj
(mod a), 1 < y < A,
(20)
has a solution X'rl,..., X'ru, v rl ,..., vrh in pu + h satisfying 0<max||A;,.HAf(a) <1/ * + -v)(1/"), i
max \\vrJ\\
+4
\
(21)
j
By Lemma 5, the system of equations X gJrvrjlikr=0,
(22)
l^j^h
r= 1
has a solution /xr (1 ^ r ^ c * ) satisfying 0<max\\fir\\^N(a)E,
(23)
r
where £=ciO()fc, h, n) 2y{h + 4). By (18), (20)-(23), we see that kri = nrk'ri (l^r^ck, solution of (19) satisfying krieP and 0<maxN(krl)
I^r^c\
l^i^u)
is a
l<«.
We are left with the case where the condition D(ky h, t, a, y) fails; i.e.,
312 272
WANG YUAN
there is a divisor q of a, / coefficient vectors a,..., a, (say), and an integral vector y = (y,,..., yh) such that N(q)>N(a)v,
(24)
(y,,..., y , , q ) = l
(25)
and ya, = 0
(modq), 1 < / ^ r .
(26)
We set all the variables, except the first t = dw, equal to zero, and so Fj(V=
I
+ ••• +<xmr(j)XkmX
(*uAJ)til
K
i
a
(27)
u= 1
A consequence of (26) is that the congruence y.fiW+-+y»f»W =0 (modq) (28) holds for every integer vector k. Now we show that there is a divisor q' of q such that N(q)>N(q)l/\ and some j , 1 ^j^h,
(29)
for which (y,,q') = i-
(30)
In fact, since q is square-free, we write q = pl • • • pa, where pt are distinct prime ideals. Because of (25), no pj divides every element of yu...,yh, hence
Thus N((yj,q))^N{q)l-l/h for s o m e ; in l^jKh, and (29) and (30) follow by taking q' = q/(y/, q). We may suppose without loss of generality thaty in (30) is j= 1. From (28), we deduce that if F2(X)=---=Fh(l) = 0
(modq'),
(31)
then Fl(X) = 0
(modq').
(32)
313
SMALL SOLUTIONS OF CONGRUENCES
273
For each u ^d, it follows by the definition of w = cl2(k, h, n, x, z) that the system of congruences ««i(y)^+"-+a W B .(7)A' H *. = 0
(m°d^), U
M
(33)
has a solution l'ul,..., X'un, in Pw such that
0<max7V(AL,)«^fA)
+
( 34 )
•
We denote by au(j) the expression on the left-hand side of (33). Since d=cA(k,h — l,n,z) and Theorem 1 is assumed to be true for h — 1 forms by induction, i.e., the system of congruences a,(./)Ai?+-"+arf(;)/i*s0
(mod <,'), 2 < j ^ / * ,
(35)
has a solution /<j,..., \id in P d satisfying 0<max^(/x,)«Af(q') 1/Ar + -".
(36)
I
Write kui = ixuX'ui (l^u^d, l^i^w). (31) holds. So by (32), we have
From (27) and (35), it follows that
Fl^) = F2{X)=--=Fh^) = 0
(modq')
(37)
(mod^j.
(38)
and by (33), we have
Fl(X) = F2(X)=--=Fh(k) = 0
By the combination of (37) and (38), we deduce that Ft^^FAV^
•••^Fh(X)
=0
(mod a),
since a is square-free. And by (34) and (36), we have / Ma ) \
x + :
0<maxtf(A,y)«JV(q')>/* + -- ( j ^ j «JV(a)-v + z Ar(q')- < *- 1/ * ) .
(39)
Now Af(q')^Af(q)1/A and iV(q)> AT(o)-v' from (24) and (29). Therefore the right-hand side of (39) is < N(a)x + z-lx~1/k)y/h
« N(a)x + Z~2z < N{a)x'
by (16), and Proposition 1 is proved for x'.
314 274
WANG YUAN 5. PROOF OF PROPOSITION 2
Let
T=N{a)Wk
+ y)Wn
\
Z = N(a)2yih
+4
s>t\\ +z-12*(/* + 2)). (40)
\
Let W denote the number of solutions of the congruences (mod a),
Fj(k) = nj
l ^ A ,
and HjeP(Z), l^j^h, where Fj{X) satisfying ^.,-ePiT), l^i^s, (1 < 7 < A ) are forms stated in (4). By Lemma 1, it follows that
»,.,-i«w-,,»«-{i;
l^"'^
where /? runs over a complete residue system of (ad)~ ', mod <5~'. Hence
W=N(a)-h
I
I
I
E(Z(F,{k)-nr)fi\ ft, 1 * * /i
Ai£P(T) ft/sPiZ) 1 < I sg j 1 aS / * /i
\r=l
/
where each ^ runs over a complete residue system of (ad)~\ l^q^h. We may write W as
fr=^V(a)-" X
1
; . , £ / > ( r ) /ijeP(Z) 1 « i sS s 1 sS.; «
1
mod<5~',
VE
q|n y, fc He/*''
x(^X ( F r ( » . ) - / i r ) y r ^ where X!* denotes a sum such that each yq runs over a complete residue and satisfies ((q<5) yu ..., {qS) yh, q) = 1. system of (q<5)"', mod 5~\ l^q^h, We write #(a) A
W = X S(q), q|a
where
S(q)= Z
I
>.ieP{T) njeP(Z) K/SSJ
ISSJSS/I
I* £ y, l^?«/i
x ( i (Fr(>.)-Air)yA
(41)
315 SMALL SOLUTIONS OF CONGRUENCES
275
By Lemma 2, it follows that £
l ={-^-T"+ O(T'-1),
and so S{l)>TmZh".
(42)
Now suppose that N(q)> 1. By Lemma 1 we have X
£(-|iy) = 0,
fi (mod q)
where fi runs over a complete residue system, mod q, and where ye(qi)" 1 , 7^(5"'. By Lemma 2 we see that the number of integers fi satisfying H G P(Z) and )i = v (mod q) is equal to
y/DNM
Km*)1-1'")'
Hence if the domain \i e P(Z) is split up into a union of a complete residue system, mod q, plus a few other, remaining elements, say R elements, then
Therefore S{(\)
£ q|a i<«(q)a(«)!'
X
2
^(q)* +1/B
l
+ i)
4Ts"ZhnN(a)--\
(43)
We claim that \S(q)\4r"Zh"N(a)-1.
Y 2 1
/V(q)>/V(a) >
(44)
316 276
WANG YUAN
Otherwise there is some q satisfying q | a and N(q)>N(a)2y
such that
\S(q)\>TmZ'mN(a)-2. Then we have I
^ ( Z y / y W ) >TmN(a)-2N(q)-h
>.ieP(T) \=l 1 « i: ss i
)
f o r s o m e y w i t h ( ( q ^ ) y 1 , . . . , (qS)yh,
q ) = 1, t h a t i s ,
fl |5,|>r"W(a)-27V(q)-",
(45)
/= i
where
=
X
£(YO,A*).
;.EP(D
We may suppose without loss of generality that \SA>
•••>\ss\.
Then the left-hand side of (45) is •4Tu-l)n\S,\{s+l~').
It follows that for
i=\,...,t, \Si\^\Sl\>T"{N(a)2N{q)h)-llu
+ l
-').
Take t sufficiently large. We have by (40), (N{a)2 N(q)h)[/is+l
"]< N(aY>' + ms+l""
< N(a):"'-2k
Set C = 7"W(a)-z/'22*. We have C ^ T" 1/2*-' + --/'-2*_ Hence by Lemma 3, we have ff,6? and T,-E/ ( l < / < / ) such that ||(ya,.)(J,-T,.|| «Af(a) z/2 ' ; j - * + --/2'--
UK/.
317 SMALL SOLUTIONS OF CONGRUENCES
277
Therefore ^((ya,)^—T,)«iV(a)- I -*' + " /|2 <(7)Ar(a))- i ^(DN(q))'1,
because N{a)^cn{k,
l^i^t,
h, K, x', e). This means that (ya,)cr,= T,,
ls=/
Since ((qS) y 1; ..., (qS)yh, q)= 1, we may choose fieqS such that (/Jy 1 ,..,/?y*,q)=l. Since qK/Jya.-Jff,,
K i « ,
we have q'|/Jyo,,
1
where q' =
5 ( q , °i
. •••<*,)
Therefore we have N(q')>-~^~> N{al--al)
N(q) N(a)'"z"> N(a)2"-nz"> N(aV.
This gives a contradiction, and we have proved (44). By (41)-(44), we have W>N(ayhTsnZhn>\. Thus Proposition 2 and also Theorem 1 are proved.
6. PROOF OF THEOREM 2
With a quadratic form 2(M= we associate the bilinear form
£
ay-M./
(<Xy = a,v)
318 278
WANG YUAN
Then £>(>., H) = 0
and
Q(X,X) = Q(k).
By the remark of Lemma 2, we may take R{a) as a complete residue system, mod a, such that for any aeR{a), we have 0<||a||=$ cl6{K) N(a)l/". We assume that the coefficients of Q,-(X) (1 < / ^ / i ) belong to R{a). Set u = c 4 (2, h, n, e/2), v = cl7(h, n, e), and 5 = uv. Let
(l-I)D
(M-l)t'
Now we define ^.l,..., fiu by induction such that (1) (2) (3)
Hy (l^i^u, 1 ^ 7 < u ) are integers in / , ll^-ll <^V(a)e/2" (1 < i s s « , 1 < y < p ) , <5y(|lr,|l,) = 0 ( 1 <_/<*, l < r < ^ < « ) .
We define H! by /i,, = ••• = ^ i u = 1, which satisfies conditions (1), (2), and (3). Suppose now that (i t ,..., | i , _ i have been defined. Consider the h(q- 1)(/-] +r2) linear forms
Consider the points | i e ? " with components [i,eP(N(aY/2"/2), l^i^v. Then by Lemma 2 it follows that there are clg(K) Nvc/2 such points. Given such a ji, the point
x(fi)=(e(1i)(m,n),-,eiri)(^-.^),e
. . . , / A ( , _ i ) r i , g i , - , g/,(<,-i)r2). where
-c 1 6 A^(a) 1 / " + e / 2 " t ; < / > < c 1 6 A r ( a ) 1 / " + £/2"f, gj = Xj + iyj, l/
\Xj\^cl6N(a) "
1 <j
+ e/2
"v,
\yJ\^c16N{a)1"' + '/2"v,
l^j^h(q-l)
r2.
Let t be the rational integer in
(clsN(ar/2)m"-l)"-l^t<(clsN(a)^2)l/"("-l)" and divide each interval of /} in D into / subintervals of length
319
SMALL SOLUTIONS OF CONGRUENCES
2cl6N(a)l/" 2cl6N(a)1/n
279
+ F /2n
-
+ e/2
vt~l and each square gj in D into t2 subsquares of side "vt-\ Since th("-l)n
it follows by the Box principle that there are two distinct points x(n') and X(n") such that Qjl)(]ir, \i') and Qj'\pr, V") will lie in the same subinterval for each/, r, I and Qjm\\ir, |i') and 2j m) (fi r , Ji") in the same subsquare for each j , r, m. Set
m, =»»' - n" Then O
Kj^A, U r < ? ,
if we take u = c17 sufficiently large. Hence \N(Qj(nr, p,))| < 1,
l
Since g7-(|ir, n , ) e / , we have ^(H r ,|i,) = 0,
U;<*,Ur.
So \iq is well defined, and thus we obtain |ij,..., ]iu by induction. Set k = Vl]ll+
••• + V u J l M .
Then
= I QA^,^)^,
i
By Theorem 1 it follows that the diagonal congruences
£ &(l»,.|i,K = 0
(mod a),
1^7
320
280
WANG YUAN
has a solution v in P" satisfying 0 < max N(v,) < N(a)l/2
+ E/2
,
and therefore the system of quadratic congruences
Qj(X) = 0 has a solution 'k = vlfil+ 0 < m a x \N{Xi)\=max
(mod a), 1 ^j^h,
••• + vu\iu satisfying |Ar(v,Ai,,)| «7V(a) 1 / 2 + £/2 + £ / 2 « N ( a ) ] / 2
+ i:
.
Theorem 2 is proved
ACKNOWLEDGMENTS
I am grateful to the referee for his useful suggestions and help, and to the NSF of the People's Republic of China and a Glorious Sun Fellowship through the Committee for Educational Exchange with China for financial support.
REFERENCES 1. R. C. BAKER, Small solutions of quadratic and quartic congruences, Mathemalika 27 (1980), 30-45. 2. R. C. BAKER, "Diophantine Inequalities," Oxford Sci. Pub., Oxford, 1986. 3. T. COCHRANE, Small solutions of congruences over algebraic number fields, Illinois J. Math. 31 (1987), 618-625. 4. E. HECKE, "Lectures on Theory of Algebraic Numbers," Springer-Verlag, New York/Berlin, 1980. 5. A. SCHINZEL, H.-P. SCHLICKEWEI, AND W. M. SCHMIDT, Small solutions of quadratic
congruences and small fractional parts of quadratic forms, Ada Arith. 37 (1980), 241-248. 6. W. M. SCHMIDT, Small zeros of additive forms in many variables, Trans. Amur. Math. Soc. 248 (1979), 121-133. 7. WANG YUAN, Bounds for solutions of additive equations in an algebraic number field, I, Ada Arith. 48 (1987), 21^18. 8. WANG YUAN, "Diophantine Equations and Inequalities in Algebraic Number Fields," Springer-Verlag, New York/Berlin, 1992.
321
wB^\
Acta Mathematics Sinica, New Series 1993, Vol.9, No.4, pp.382-389
>*^
^ ^ ^ ^ ^ ^
ii
On Small Zeros of Quadratic Forms over Finite Fields (II) Wang Yuan C£ 7C) Institute of Mathematics, Academia Sinica, Beijing, China Received October 24, 1991
Abstract. Let Q(x) — Q(xi,'-- ,xn) be a quadratic form with integer coefficients and let p denote a prime. CochraneM proved that if n > 4 then Q(x) = O(modp) has a solution x ^ 0 satisfying |x| <| ^/p, where |x| = max |x,|. The aim of the present paper is to generalize the above result to finite fields.
§1. Introduction Let 1F(= Fq) be a finite field of order q = pm, where p is an odd prime. Let 7Z9 = Z/pZZ = JO, ±1, • • • ,±^—j— j- be a complete residue system modulo p. Let a»i, • • • ,wm be a basis of P . The elements of 2F can be represented by z = a1w1 + --- + a m w m ,
ajG^p,
1 < i < m.
Set |x| = max|o,-|.
(1)
If x = (xi, • • •, xn) is a vector with components in W , then we define \g\ = ma.x\xi\.
(2)
Note that |x| and |x| depend on the basis of IF . A quadratic form over JF is a polynomial in W[x\ of the type,
where qij = qji,g— (xi, • • •, xn) and Q = (?ij)(l < i,j < n) is the matrix associated with Q(l).
322 Wang Yuan
On Small Zeros of Quadratic Forms over Finite Fields (II)
383
For the Case F = 2Zp, Heath-Brown!2' first established by his celebrated method based on Fourier analysis that if n is an even integer > 4, then the congruence Q(x) = O(modp) has a solution satisfying 0 < \g\ < Vplogp. (3) The right hand side of (3) is of best possible apart from a possible improvement on the second order log p. CochraneM proved that
III < VP
(4)
under the same condition by the use of finite Fourier analysis. Wang Yuan'3' has generalized Heath-Brown's result to all finite fields with the norms defined by (