Number of prime divisors in a product of consecutive integers (Q4811258)
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 2092490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Number of prime divisors in a product of consecutive integers |
scientific article; zbMATH DE number 2092490 |
Statements
Number of prime divisors in a product of consecutive integers (English)
0 references
18 August 2004
0 references
0.9897517
0 references
0.95338887
0 references
0.93480563
0 references
0.9195478
0 references
0.91440254
0 references
0 references
0 references
0 references
Let \(\Delta = \Delta(n,k) = n^{\overline{k}} = n(n+1) \cdots (n+k-1)\). Then \(k! \;| \;\Delta\) and thus \(\omega(\Delta) \geq \pi(k)\). The problem investigated by this paper is the one of establishing tight lower bounds for \(\omega(\Delta)\). This is done by a combination of new and old combinatorial arguments, supported by machine computations which reveal relatively small exceptional sets for the theorems proved. The main theorem states that \[ \omega(\Delta) \geq \pi(k) + \bigl[\tfrac{3}{4} \pi(k) \bigr] - 1 + \delta(k), \] where \(0 \leq \delta(k) \leq 3\) is a precisely defined correction term and the pair \((n,k)\) is not in an explicitly enumerated exceptional set.
0 references