scientific article; zbMATH DE number 2124086
For integers \(0\leq t\leq n/2\), let \(g(n,t)\) the the greatest common divisor of all the numbers \[ {n\choose t},~{n\choose t+1},~\ldots,~{n\choose n-t}. \] In this paper, the authors study the prime factors of the numbers \(g(n,t)\). Clearly, \(g(n,0)=1\) since \({n\choose 0}=1\). A result of Granville says that if we denote by \(b(n)\) the minimum \(t\) such that \(g(n,t+1)>1\), then \(b(n)\) can also be characterized as the smallest nonnegative integer of the form \(n-p^{\alpha}\) where \(p^{\alpha}\) is a prime power less than or equal to \(n\). The authors complete this result by showing that \(g(n,b(n)+1)=p\) (Theorem 2). In particular, \(g(n,1)=p\) if \(n=p^{\alpha}\) is a prime and \(\alpha\) is a positive integer, and \(g(n,1)=1\) otherwise (Theorem 4). The authors also show that \(\text{ lcm}(g(n-1,t),g(n,t))\) divides \(g(n,t+1)\) whenever \(n\geq 2\) and \(0\leq t\leq n/2\). In light of this result, they define \[ h(n,t)={{g(n,t+1)}\over {\text{ lcm}(g(n-1,t),g(n,t))}} \] and study the function \(h(n,t)\). Let \(n\geq 4\) and \(1<t<\lfloor n/2\rfloor\). Then they show that \(h(n,t)=q\), a prime dividing \(t\) if and only if \(n-2t=q^{\alpha}\) and \(\alpha\) is a positive integer which does not exceed the exponent of \(q\) in the factorization of \(t\). Otherwise, \(h(n,t)=1\) (Theorem 7). The most important result of this paper is Theorem 9 which shows that \[ g(n,t+1)=\prod_{(i,j)\in T(n,t)} h(i,j), \] where \(T(n,t)\) is the right-angled isosceles triangle whose corners are \((n-t,0),~(n,0),~(n,t)\). The proofs rely on Kummer's theorem concerning the exponent at which a prime \(p\) appears in the factorization of a binomial coefficient.
- The greatest common divisor of certain sets of binomial coefficients
- On the largest prime factor of (ab+1)(ac+1)(bc+1)
- Convex equipartitions via equivariant obstruction theory
- GCD properties in Hosoya's triangle
- On the greatest common divisor of binomial coefficients
- Gcd Modulo a Primary Triangular Set of Dimension Zero
- On the greatest common divisor of 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 Q4831484)