Über Summen von Primzahlen und Primzahlquadraten (Q2646096)
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 3030770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Über Summen von Primzahlen und Primzahlquadraten |
scientific article; zbMATH DE number 3030770 |
Statements
Über Summen von Primzahlen und Primzahlquadraten (English)
0 references
1938
0 references
Number theory
0 references
Goldbach problem
0 references
prime-pair problem
0 references
representation of integers
0 references
0.8346232175827026
0 references
0.8167238235473633
0 references
0.8167238235473633
0 references
The author considers the representation of integers \(n\) in the forms \(Kp + K'p' + \chi(x)\) and \(Kp + K'p' + \chi(p'')\) (where the \(p\)'s are primes and \(x\) a positive integer), and in the corresponding forms with \(Kp + K'p'\) replaced by \(Kp + K_1p_1^2 + K_2p_2^2\) and by \(K_1p_1^2+\cdots+ K_4p_4^2\). Here the \(K\)'s are given non-zero integers and \(\chi(x)\) is a given integer-valued polynomial (not identically 0). Two cases are distinguished according as the \(K\)'s and the coefficient of the highest power of \(x\) in \(\chi(x)\) are (I) all of the same sign (say positive) or (II) not all of the same sign; and the results take the forms (I) ``every sufficiently large \(n\) is representable'', (II) ``any given \(n\) has an infinity of representations'', subject in each case to appropriate congruence conditions on \(n\). [The cases (I) and (II) correspond, respectively, to the ``Goldbach'' and the ``prime-pair'' problems.] The problems are generalised in various ways. Thus the \(p\)'s and \(x\) may be restricted to given arithmetical progressions. And in some cases the mutual ratios of the summands can be specified approximately, subject to obvious restrictions. The proofs are based on the Hardy-Littlewood method with Vinogradov's refinements.
0 references