Estimates of the least prime factor of a binomial coefficient
The main result of this very interesting paper (Theorem~2) establishes a sharp bound for the number of rational points with small denominators close to a smooth curve. It applies to curves whose \(r\)-th derivative is small and whose \((r+1)\)-derivative is even smaller, as usual. The core of the proof belongs to the geometry of numbers and is to be compared with the theorem of \textit{M. Filaseta} and \textit{O. Trifonov} [Proc. Lond. Math. Soc. 73, 214-278 (1996; Zbl 0867.11053)]. It should be noted that the uniformity in \(r\) is carried out. This result is then used to give a lower bound for \(g(k)\), the least integer \(n>k+1\) such that all prime factors of the binomial \(\binom{n}{k}\) are not less than \(k+1\). The author gets \(\log g(k)\gg\log^2k\), improving on \textit{A. Granville} and \textit{O. Ramaré} [Mathematika 43, 73-107 (1996; Zbl 0868.11009)].
- A New Function Associated with the Prime Factors of \binomnk
- Diophantine approximations and diophantine equations
- Estimates of the Least Prime Factor of a Binomial Coefficient
- The Difference Between Consecutive Primes
- The Distribution of Fractional Parts with Applications to Gap Results in Number Theory
- The number of integral points on arcs and ovals
- The number of lattice points on a convex curve
- The square-full numbers in an interval
This page was built for publication: Estimates of the least prime factor of a binomial coefficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494732)
