No label defined (Q5616962)
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 3340379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3340379 |
Statements
1970
0 references
0.96739966
0 references
0 references
0.92999053
0 references
0 references
[For the entire collection see Zbl 0208.00201.] Several applications of graph theory to number theory are discussed mostly without proofs. The following result is proved in detail: Let \(a_1< \ldots <a_k \leq x\), \(k> \pi (x)\) be a sequence of integers. Denote by \(f(k,x)\) the smallest integer \(r\) so that there always are \(r\) primes \(p_1, \ldots ,p_r\) for which more than \(r\) \(a\)'s are of the form \(\prod ^r_{i=1}p^{\alpha_i}_i\). The author and Straus proved \[ f(\pi (x)+1,x)=(4+o(1)){x^{1/2} \over \log x}. \] A good estimate is given for \(f(k,x)\) if \(k=cx\).
0 references