scientific article; zbMATH DE number 3621813
In this paper some problems which are simple to state but probably difficult to solve are posed concerning binomial coefficients. Let \(P(m,n)\) denote the greatest prime factor of \((m,n)\). Then the authors conjecture that if \(1\le j\le n/2\) then \(P(\binom ni, \binom nj)\ge i\) with equality holding only in a few special cases (several of which are given). If \(f(n)=\min_{1< j\le n/2} (n,[\binom nj))\) it is not difficult to show that \(f(n)\geq p(n)\) is the smallest prime factor of \(n\), and that if \(n\) is not a prime power then \(f(n)\le n/P(n)\) where \(P(n)\) is the greatest prime power which divides \(n\). The authors remark that it would be of interest to characterize those \(n\) for which \(f(n)=n/P(n)\). (For example, \(f(30)=6\).) They also mention that it seems likely that \(f(n)> \sqrt n\) for infinitely many \(n\).
- Problems and results on consecutive integers and prime factors of binomial coefficients
- A decomposition of parking functions by undesired spaces
- Estimates of the Least Prime Factor of a Binomial Coefficient
- scientific article; zbMATH DE number 3859204 (Why is no real title available?)
- scientific article; zbMATH DE number 5621032 (Why is no real title available?)
- scientific article; zbMATH DE number 3946204 (Why is no real title available?)
- scientific article; zbMATH DE number 3741475 (Why is no real title available?)
- On the Prime Factors of \binom2nn
- On some arithmetical properties of middle binomial coefficients
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 Q4184902)