A theorem in multiplicative number theory (Q803198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4052222 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rosser's sieve / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of solutions of \(p+h=P_ r\) / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-314x(91)90089-t / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2159502167 / rank | |||
Normal rank |
Latest revision as of 12:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A theorem in multiplicative number theory |
scientific article |
Statements
A theorem in multiplicative number theory (English)
0 references
1991
0 references
In earlier work [Math. Z. 203, 37-42 (1990; Zbl 0659.10056)], the author showed that if h is even, then the number of primes \(p<X\) such that \(p+h=P_ r\) is \(\gg {\mathfrak S}(h)X \log^{-2}X\cdot (\log \log X)^{r- 2}\). The basic idea was that {\#}\(\{\) p\(<X: p+h=P_ r\}\geq \sum_{d\in D}\#\{p<X/d:p+h=dP_ 2\}\), where D is a certain set of numbers, all of which are products of r-2 primes and all of which have greatest prime factor \(<X^{1/\log \log X}\). A uniform version of Chen's Theorem is then applied to estimate the left-hand side. The author uses the same idea to give analogs of several theorems from Chapters 9 and 10 of [\textit{H. Halberstam} and \textit{H.-E. Richert}, Sieve methods (1974; Zbl 0298.10026)]. The theorems all concern the number of solutions of \(F(n)=P_ r\), where F(n) is a polynomial.
0 references
sieve methods
0 references
distribution of almost primes
0 references
lower bounds
0 references