On divisibility concerning binomial coefficients
Number Theory
2010-06-01 v9 Combinatorics
Abstract
Let k and n be positive integers. We mainly show that (ln+1)∣k(knkn+ln), 2(nkn)∣(n2n)C2n(k−1), (nkn)∣(2k−1)Cn(2n2kn), (n2n)∣(k+1)Cn(k−1)(kn2kn), 2k−1(n2n)∣((2k−1)n2(2k−1)n)Cn(2k−2), (6n+1)(n5n)∣(n−13n−1)C3n(4), and (n3n)∣(n−15n−1)C5n(2), where C_n denotes the Catalan number (n2n)/(n+1), and C_m^{(h)} refers to the Catalan number (m(h+1)m)/(hm+1) of order h.
Cite
@article{arxiv.1005.1054,
title = {On divisibility concerning binomial coefficients},
author = {Zhi-Wei Sun},
journal= {arXiv preprint arXiv:1005.1054},
year = {2010}
}
Comments
18 pages. The current (1.12) is new