𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the ternary goldbach problem with primes in independent arithmetic progressions

✍ Scribed by K. Halupczok

Publisher
Akadmiai Kiad
Year
2008
Tongue
English
Weight
578 KB
Volume
120
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The binary Goldbach problem with one pri
The binary Goldbach problem with one prime of the form
✍ Kaisa MatomΓ€ki πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

We prove that almost all integers n ≑ 0 or 4 (mod 6) can be written in the form n = p 1 + p 2 , where The proof is an application of the half-dimensional and linear sieves with arithmetic information coming from the circle method and the Bombieri-Vinogradov prime number theorem.

On the number of representations in the
On the number of representations in the ternary Goldbach problem with one prime number in a given residue class
✍ Karin Halupczok πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 128 KB

For J 3 (n) = p 1 +p 2 +p 3 =n p 1 ≑a 1 (mod q 1 ) log p 1 log p 2 log p 3 , it is shown that for any A and any < 1/2, what improves a work of Tolev; S 3 (n) is the corresponding singular series. A special form of a sieve of Montgomery is used.

Independent Arithmetic Progressions in C
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
✍ David S. Gunderson; Imre Leader; Hans JΓΌrgen PrΓΆmel; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 179 KB

We show that if G is a K r -free graph on N, there is an independent set in G which contains an arbitrarily long arithmetic progression together with its difference. This is a common generalization of theorems of Schur, van der Waerden, and Ramsey. We also discuss various related questions regarding