What is pigeonhole principle? Show that \(\binom{n+1}{k} = \binom{n}{k-1} + \binom{n}{k}\) where \(n\) and \(k\) are positive integers with \(n \geq…
BIT Discrete Structure · 2080 · Solved Question with Answer
What is pigeonhole principle? Show that \(\binom{n+1}{k} = \binom{n}{k-1} + \binom{n}{k}\) where \(n\) and \(k\) are positive integers with \(n \geq k\).