Goldbach numbers in sparse sequences (Q1266217): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2049798301 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250381 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4213353 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3900124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3135215 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimates for trigonometric sums by Vinogradov's method, and some applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A pair correlation hypothesis and the exceptional set in Goldbach's problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The exceptional set of Goldbach's problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Goldbach numbers represented by polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698772 / rank | |||
Normal rank |
Latest revision as of 16:07, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Goldbach numbers in sparse sequences |
scientific article |
Statements
Goldbach numbers in sparse sequences (English)
0 references
14 September 1998
0 references
It was shown by \textit{H. L. Montgomery} and \textit{R. C. Vaughan} [Acta Arith. 27, 353-370 (1975; Zbl 0301.10043)] that the number of even \(n\leq N\) which are not representable as a sum of two primes is \(O(N^{1-\delta})\) with some (small) \(\delta>0\). One may ask for which ``sparse'' sequence of even numbers it is possible to show that almost all elements are Goldbach numbers (i.e. \(=p_1 +p_2)\). It was proved by \textit{A. Perelli} that this is true for the sequence of values of a fixed integer polynomial, satisfying some natural conditions [Rev. Mat. Iberoam. 12, 477-490 (1996; Zbl 0874.11069)]. In the present paper the authors consider the much sparser set of even numbers \(k\) next to the real numbers \(F(n)= \exp ((\log n)^\gamma)\) \((1< \gamma <3/2)\). They can show that the number of these \(k\)'s \((k\leq N)\) which are not Goldbach is \(\ll N\exp (-c(\log N)^{3-2 \gamma})\). The proof, which uses the Hardy-Littlewood method, requires several delicate exponential sum considerations.
0 references
sparse sequence of even numbers
0 references
exponential sums
0 references
Goldbach numbers
0 references
Hardy-Littlewood method
0 references
Goldbach's problem
0 references