ORDINAL NUMBERS IN ARITHMETIC PROGRESSION

The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers (ß + δγ)γ<γ<>r, δ ≠ 0.     

算术级数中的奇数Goldbach问题(Ⅱ)

本文考察了几乎所有模的算术级数中的奇数Goldbach问题．证明了对几乎所有的模r≤N1/6-ε,充分大的正奇数N可表为三个素数之和,其中每个素数取在模r 的满足必要同余条件的任意剩余系中．     

Minc-Sathre不等式的再推广

给出并证明一定条件下正项单调增加数列{an}所满足的三个不等式,使得对一切正整数（相当于给定自然数列{n}）成立的Minc—Sathre不等式及另两个相关不等式成为它们的特例．     

求解奇数阶幻方的一个简单方法

运用等差数列的相关原理,给出一种构造奇数阶对称幻方的新方法——等差数列法.此方法简单、快捷、便于计算机操作,具有优越性.     

On the density of integers of the form 2 k + p in arithmetic progressions

Consider all the arithmetic progressions of odd numbers, no term of which is of the form 2^k ＋ p, where k is a positive integer and p is an odd prime. ErdSs ever asked whether all these progressions can be obtained from covering congruences. In this paper, we characterize all arithmetic progressions in which there are positive proportion natural numbers that can be expressed in the form 2^k ＋ p, and give a quantitative form of Romanoff＇s theorem on arithmetic progressions. As a corollary, we prove that the answer to the above Erdos problem is affirmative.     

On Combinatorial Cubes

A sequence of positive integers with positive lower density contains a Hilbert (or combinatorial) cube size c log log n up to n. We prove this bound is sharp for some thinner sequence.     

算术数列中的素变数丢番图逼近

证明了:设λ1,λ2,λ3是非零实数,并且不同一符号,η是实数,λ1/λ2是无理数,h是一个给定的正整数,l1,l2,l3是整数,如果广义黎曼猜想成立,那么有无穷多有序素数对p1,p2,p3(pj≡lj(mod h),j=1,2,3)使得|λ1p1 λ2p2 λ3p3 η|＜(max pj)-(1)(10)(log max pj)5.     

Small solutions of quadratic equations with prime variables in arithmetic progressions

A necessary and sufficient solvable condition for diagonal quadratic equation with prime variables in arithmetic progressions is given, and the best qualitative bound for small solutions of the equation is obtained,     

Long Arithmetic Progressions in Sum-Sets and the Number x-Sum-Free Sets

In this paper we obtain optimal bounds for the length of thelongest arithmetic progression in various kinds of sum-sets.As an application, we derive a sharp estimate for the numberof sets A of residues modulo a prime n such that no subsum ofA equals x modulo n, where x is a fixed residue modulo n. 2000Mathematics Subject Classification 05A16, 11B25, 11P32.     

Primes in arithmetic progressions with friable indices

We consider the numberπ(x,y;q,a)of primes p≤such that p≡a(mod q)and(p-a)/q is free of prime factors greater than y.Assuming a suitable form of Elliott-Halberstam conjecture,it is proved thatπ(x,y:q,a)is asymptotic to p(log(x/q)/log y)π(x)/φ(q)on average,subject to certain ranges of y and q,where p is the Dickman function.Moreover,unconditional upper bounds are also obtained via sieve methods.As a typical application,we may control more effectively the number of shifted primes with large prime factors.     

On a certain geometric mean of the values of a polynomial

The maximum of the geometric mean of the values of a polynomial in the vertices of a regularkgon inscribed into the unit circle is greater than or equal to its Mahler measure. It also tends to the Mahler measure ask tends to infinity. We give quantitative versions of this statement: the upper bounds for the ratio of these two quantities. Partially supported by the Lithuanian State Science and Studies Foundation. Published in Lietuvos Matematikos Rinkinys, Vol. 40, No. 1, pp. 17–27, January–March, 2000.     

等差项乘积的渐进估计

研究了等差项乘积∏ni=1a_i的渐进估计.首先给出了一系列关于等差项乘积的不等式,继而应用Euler-Maclaurin求和公式及Γ函数的Stirling公式:Γ(x+1)~(2πx)~(1/2)(x/e)~x(x→+∞),推导出了∏ni=1a_i的较精确的渐进式,最后,得到了精确化的Wallis公式.