Binomial coefficients: Stars and Bounds
Star of David theorem, separable functions, upper bounds
My two latest blog posts center around binomial coefficients.
The first starts with the Star of David theorem for binomial coefficients, then looks at a variation that applies to separable functions more generally, then briefly discusses separation of variables and separable coordinate systems.
The second starts with an upper bound on binomial coefficients that is easy to prove but kinda awkward. It then optimizes this bound to produce a symmetric and memorable bound and examines how tight the bound is.
Enjoy.