No label defined (Q4184902)
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 3621813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3621813 |
Statements
1978
0 references
binomial coefficients
0 references
prime factors
0 references
0.8142309188842773
0 references
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\).
0 references