Binomial bound

from blog John D. Cook, | ↗ original
I recently came across an upper bound I hadn’t seen before [1]. Given a binomial coefficient C(r, k), let n = min(k, r − k) and m = r −  n. Then for any ε > 0, C(n + m, n) ≤ (1 + ε)n + m / εn. I could imagine how non-optimal choice […] The post Binomial bound first appeared on John D. Cook.