No label defined (Q5814877)
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 3075873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3075873 |
Statements
1952
0 references
divisibility
0 references
difference between two binomial coefficients
0 references
0.791904866695404
0 references
0.7756100296974182
0 references
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.
0 references