KIT | KIT-Bibliothek | Impressum | Datenschutz

Lower and upper bounds for (sums of) binomial coefficients

Worsch, Thomas


Apparently there is no closed form for the partial sum of a row of
Pascal's triangle. In this paper lower and upper bounds for
binomial coefficients and their sums are deduced. In the case of
single coefficients these bounds differ only by a constant factor
which is arbitrarily close to 1 for sufficiently large n. In the
case of sums the gap between lower and upper bound is larger but
still small enough to be useful in some applications. The upper
bound obtained for sums is somewhat better than that resulting
from a Chernoff bound.

Volltext §
DOI: 10.5445/IR/181894
Cover der Publikation
Zugehörige Institution(en) am KIT Fakultät für Informatik – Informatik für Ingenieure und Naturwissenschaftler (Inf. für Ing. u. Naturwiss.)
Publikationstyp Buch
Publikationsjahr 1994
Sprache Englisch
Identifikator urn:nbn:de:swb:90-AAA1818948
KITopen-ID: 181894
Erscheinungsvermerk Karlsruhe 1994. (Interner Bericht. Fakultät für Informatik, Universität Karlsruhe. 1994,31.)
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page