Let $\{\epsilon_i\}_{n \in \mathbb{N}}$ be a sequence of negligible functions and $q(n)$ be a polynomial in $n$. Then $f(n) = \sum_{i = 1}^{q(n)} \epsilon_i(n)$ need not be a negligible function.


A typical negligible function is $2^{-n}$. Maybe we can expand it to the family $2^{-(n+i)}$ and set $q(n)$ to something that will give a sufficient large sum [didn't work]


Consider the negligible functions $$\epsilon_i(n) = \begin{cases} 1 & \text{if } n \le i \\ 0 & \text{if } n > i \\ \end{cases}$$

and $q(n) = n$

It should be easy to show that each $\epsilon_i$ function is, in fact, negligible, but the sum $f(n)$ is not...

  • $\begingroup$ I would like to add that, using the limit definition will fail, since not all time, the summation of the limit is equal to limit of the sum. $\endgroup$
    – kelalaka
    Nov 17 '18 at 14:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.