Factorial ratios that are integers. (Q1805143)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Factorial ratios that are integers. |
scientific article; zbMATH DE number 753700
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Factorial ratios that are integers. |
scientific article; zbMATH DE number 753700 |
Statements
Factorial ratios that are integers. (English)
0 references
13 February 2004
0 references
Let \(m,k\) and \(j\) be integers with \(m\geq k>j\geq 0\) and let \(Q(j,m,k)=\prod^j_{i=0}\gcd(m-i, \text{lcm}(k,k-1,\cdots,k-i))\). The author gives divisibility properties of \(Q\). He proves: Theorem 1. \(Q(j,m,k)(m-j+1)!/k!(m-k)!\) is an integer. Theorem 2. For integers \(s\geq 1\), \(r\geq 0\) and \(n\geq 1\), the number \((2r+s)!/r!(s-1)!Q(r,r+s+2n,r+s+n)\) is an integer.
0 references
0.8599155
0 references
0.8493061
0 references