Prove that for any $n \ge 1$, $LCM _{0\le k\le n} \big \{$ $n \choose k$ $\big\} = \frac{1}{n + 1} LCM \{1, 2,3,...,n + 1\}$
Problem
Source: Indian Postal Coaching 2008 set 3 p1
Tags: number theory, least common multiple, LCM, Combinations
Source: Indian Postal Coaching 2008 set 3 p1
Tags: number theory, least common multiple, LCM, Combinations
Prove that for any $n \ge 1$, $LCM _{0\le k\le n} \big \{$ $n \choose k$ $\big\} = \frac{1}{n + 1} LCM \{1, 2,3,...,n + 1\}$