On divisibility concerning binomial coefficients

Abstract

Let k and n be positive integers. We mainly show that (ln+1) | kkn+lnkn, 2knn | 2nnC2n(k-1), knn | (2k-1)Cn2kn2n, 2nn | (k+1)Cn(k-1)2knkn, 2k-12nn | 2(2k-1)n(2k-1)nCn(2k-2), (6n+1)5nn | 3n-1n-1C3n(4), and 3nn | 5n-1n-1C5n(2), where Cn denotes the Catalan number 2nn/(n+1), and Cm(h) refers to the Catalan number (h+1)mm/(hm+1) of order h.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…