摘要
设ｋ，ｌ１，ｌ２，ｌ３是适合ｋ≥１，（ｌｊ，ｋ）＝１，１≤ｊ≤３的整数．Ｎ是满足同余条件Ｎ≡ｌ１＋ｌ２＋ｌ３（ｍｏｄｋ）的大奇数．则存在实效可计算常数０＜θ＜１使得对任何整数ｋ≤Ｎθ，方程Ｎ＝ｐ１＋ｐ２＋ｐ３对于素变数ｐｊ≡ｌｊ（ｍｏｄｋ）。
Let k≥1 be an integer,l1,l2,l3 be integers satisfying (lj,k)=1,1≤j≤3.In this paper,we proved that there exists an effective computable constant 0<θ<1 such that the equation N=p1+p2+p3 with pj≡lj(mod k) for 1≤j≤3 is solvable in primes p1,p2 and p3 for sufficiently large odd N≡l1+l2+l3(mod k) provided that k≤Nθ.
出处
《河南大学学报（自然科学版）》
CAS
1998年第2期1-14,共14页
Journal of Henan University:Natural Science
