Computationally efficient bounds for the sum of Catalan numbers
K Topley - arXiv preprint arXiv:1601.04223, 2016 - arxiv.org
K Topley
arXiv preprint arXiv:1601.04223, 2016•arxiv.orgEasily computable lower and upper bounds are found for the sum of Catalan numbers. The
lower bound is proven to be tighter than the upper bound, which previously was declared to
be only an asymptotic. The average of these bounds is proven to be also an upper bound,
and empirically it is shown that the average is superior to the previous upper bound by a
factor greater than (9/2).
lower bound is proven to be tighter than the upper bound, which previously was declared to
be only an asymptotic. The average of these bounds is proven to be also an upper bound,
and empirically it is shown that the average is superior to the previous upper bound by a
factor greater than (9/2).
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven to be also an upper bound, and empirically it is shown that the average is superior to the previous upper bound by a factor greater than (9/2).
arxiv.org