2000 character limit reached
Proof of Sun's conjecture on the divisibility of certain binomial sums
Published 21 Jan 2013 in math.NT | (1301.4877v1)
Abstract: In this paper, we prove the following result conjectured by Z.-W. Sun: $$ (2n-1){3n\choose n}| \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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.