Proof of Sun's conjecture on the divisibility of certain binomial sums (Q396941)
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: Proof of Sun's conjecture on the divisibility of certain binomial sums |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of Sun's conjecture on the divisibility of certain binomial sums |
scientific article |
Statements
Proof of Sun's conjecture on the divisibility of certain binomial sums (English)
0 references
14 August 2014
0 references
Summary: In this paper, we prove the following result conjectured by \textit{Z.-W. Sun} [``Some new series for \(1/pi \) and related congruences'', preprint, \url{arXiv:1104.3856}]: \[ (2n-1){3n\choose n}|<br />\sum_{k=0}^{n}{6k\choose 3k}{3k\choose k}{6(n-k)\choose 3(n-k)}{3(n-k)\choose n-k} \] by showing that the left-hand side divides each summand on the right-hand side.
0 references
congruences
0 references
binomial coefficients
0 references
super Catalan numbers
0 references
Stirling's formula
0 references
0.905243992805481
0 references
0.8755492568016052
0 references
0.8634164333343506
0 references
0.8484912514686584
0 references