scientific article; zbMATH DE number 3340379

From MaRDI portal
Publication:5616962





[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\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616962)