For a large odd integer N and a positive integer r, define b = (b₁,b₂,b₃) and $𝓑(N,r) = {b∈ ℕ³ : 1 ≤ b_j ≤ r, (b_j, r) = 1$ and b₁+b₂+b₃ ≡ N (mod r)}. It is known that $#𝓑(N,r) = r² ∏_{p|r}_{p|N} ((p-1)(p-2)/p²) ∏_{p|r}_{p∤N} ((p²-3p+3)/p²)$. Let ε > 0 be arbitrary and $R = N^{1/8-ε}$. We prove that for all positive integers r ≤ R, with at most $O(Rlog^{-A}N)$ exceptions, the Diophantine equation ⎧N = p₁+p₂+p₃, ⎨ $p_j ≡ b_j (mod r),$ j = 1,2,3,$ ⎩ with prime variables is solvable whenever b ∈ 𝓑(N,r), where A > 0 is arbitrary.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW