Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I have added the negative terms. I had forgotten to. Is there some way to give a better bound like $O(n^{-k + \frac{1}{\log(n)}})$ I want to show that the decay of $f^p(x)$ is slower.
