Although there does not exist closed formula for the partial sum of binomial coefficient, $\sum_{i=0}^k \left( \begin{array}{c} n \\ i \end{array} \right)$
, is it possible to calculate this faster than $O(k)$?
Although there does not exist closed formula for the partial sum of binomial coefficient, $\sum_{i=0}^k \left( \begin{array}{c} n \\ i \end{array} \right)$
, is it possible to calculate this faster than $O(k)$?
Copyright © 2021 JogjaFile Inc.