scientific article; zbMATH DE number 3075873
The theorem: \(\binom{2^{n+1}}{2^n}\) is for \(n = 1,2, \dots\) divisible by \(2^{2n}\) of Viggo Brun (1934) is the starting point of the authors. They collect here some generalizations and sharper results on this theme, which are partly also published in the Norwegian mathematical periodicals. \textit{J. O. Stubban} gives a simple proof that it is divisible by \(2^{2n+1}\) and \textit{J. E. Fjeldstad} proves the conjecture of Jacobsthal that the difference contains exactly \(3n\) factors \(2\) when \(n>1\). His proof is somewhat complicated and makes besides the formulas of Stubban use of special expressions for the Legendre polynomials. \textit{R. Tambs Lyche} gives two relations between the number of factors \(2\) in a binomial coefficient and those in the elementary symmetric function of degree \(k\) of the first \(n\) odd integers. The proof is omitted. \textit{K. E. Aubert} remarks, that \(\binom{2^m}{2^{m-1}} = 2^{3n+k+\lambda-1}H\), where \(m>n>1\), \(k\geq 1\) and \(H\) is still an odd integer, while \(2^\lambda\) is the highest power of \(2\) dividing \(k\). The proof is unexpectedly simple. \textit{W. Ljunggren} proves that \(\binom{p^{n+1}}{p^n} - \binom{p^n}{p^{n-1}}\) for \(n=2, 3,\dots\) is divisible by \(p^{3n+\varepsilon}\), where \(\varepsilon = 0\) if \(p = 2\), \(\varepsilon = 1\) if \(p = 3\) and \(\varepsilon = 2\) if \(p>3\). The proof is due to \(\binom{p^{n+1}}{p^n} = \binom{p^n}{p^{n-1}} \frac{F(p^{n+1})}{F(p^n)}\), where \(F(y) = \displaystyle \prod_{_{\substack{ \lambda=1 \\ (\lambda,p)=1}}}^{p^n}(y-\lambda)\). The number of factors \(p\) of \(F(p^{n+1}) - F(p^n)\) is computed with the help of the theorem of Leudesdorf, and then the proof is easily completed. \textit{E. Jacobsthal} considers the difference \(\binom{pm}{pn} - \binom{m}{n}\), where \(m\) and \(n\) are positive integers \((m\geq n)\) and \(p\) is prime. He gives a very complicated congruence in terms of Bernoulli numbers while the modulus is a power of \(p\). There is only an outline of the proof.
- On two supercongruences of truncated hypergeometric series \({}_4 F_3\)
- A note on the congruence \({np^k\choose mp^k} \equiv {n\choose m} \pmod {p^r}\).
- scientific article; zbMATH DE number 4070995 (Why is no real title available?)
- scientific article; zbMATH DE number 3478889 (Why is no real title available?)
- Lucas congruences for the Apéry numbers modulo p^2
- Lucas’ Theorem Modulo p2
- scientific article; zbMATH DE number 7199606 (Why is no real title available?)
- \(q\)-congruences, with applications to supercongruences and the cyclic sieving phenomenon
- On some divisibility properties of \(\binom{2n}{n}\)
- scientific article; zbMATH DE number 7674556 (Why is no real title available?)
- New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences
- Supercongruences concerning bi\(^s\)nomial coefficients
- On Gauss and Jacobsthal congruences
- Combinatorial congruences from \(p\)-subgroups of the symmetric group
- Congruence properties for the quadrinomial coefficients
- New results on Wolstenholmes theorem and its applications
- A binomial sum related to Wolstenholme's theorem
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 Q5814877)