No label defined (Q3852289)
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 3652455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3652455 |
Statements
1979
0 references
binomial coefficient
0 references
consecutive integers
0 references
distinct prime factors
0 references
0.8435413241386414
0 references
0.8188214898109436
0 references
Let \(m_k\) denote the smallest integer m such that \(\binom mk\) has more than \(k\) distinct prime factors. It was shown by \textit{P.Erdős, H.Gupta} and \textit{S.P.Khare} [Utilitas Math. 10, 51-60 (1976; Zbl 0339.10006)] that \(m_k> C k^2\log k\). Using deep results on the distribution of primes the present authors show that \(\log k\) can replaced by \[ (\log k)^{4/3}(\log\log k)^{-4/3}(\log\log\log k)^{-1/3}. \] Also let \(n_k\) denote the smallest integer \(n\) such that the numbers \(n+1, \dots, n+k\) all have a prime factor exceeding \(k\). It is shown by elementary means that, for sufficiently large k, \(n_k> \frac 1{16}k^{5/2}\). This bounded is probably nowhere near the best possible.
0 references