Primes of the type φ(x, y)+A where φ is a quadratic form (Q5618439)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3342079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primes of the type φ(x, y)+A where φ is a quadratic form |
scientific article; zbMATH DE number 3342079 |
Statements
Primes of the type φ(x, y)+A where φ is a quadratic form (English)
0 references
1972
0 references
0.8173232078552246
0 references
0.8000428080558777
0 references
0.7939938902854919
0 references
0.7885289788246155
0 references
Let \(S(N,\varphi,B,A)\) be the number of primes \(p\le N\), which can be represented in the form \(p=B\varphi(x,y) +A\), where \(x,y,A,B\) are integers, \(A\ne 0\), \(B>0\), \((A,B) =1\) and \(\varphi\) is a primitive irreducible quadratic form, positive definite if its discriminant \(D\) is negative. The main result of the paper is the following estimation: \[ N(\log N)^{-\frac32} \ll S(N,\varphi,B,A) < N(\log N)^{-\frac32}. \] This is deduced from the inequality \[ C_1N(\log N)^{-\frac32} + O(N(\log N)^{-2}) < \mathop{{\sum}^*} S(N,\varphi,B,A) < C_2N(\log N)^{-\frac32}, \tag{*} \] where \(\mathop{{\sum}^*}\) denotes the summation over all classes of a prescribed genus and the constants \(C_1,C_2\) are given explicitly. The main idea of the proof of (*) is the following. Let \(R_\varphi\) be the genus of \(\varphi\). The number \(n\) is representable by a form in \(R_\varphi\) if and only if the prime factors of \(n\) belong to a certain subset \(P'\) of the set of primes \(P\). The Dirichlet density of \(P'\) is \(\tfrac12\). Sieving out, by an application of \(\tfrac12\)-dimensional sieve of the set \(M=\{p -A \le N - A\}\) numbers with prime factors in \(P\backslash P'\) one gets numbers representable by forms in the genus \(R_\varphi\). Bombieri's mean value theorem is used in the proof.
0 references