我一直在想办法解决这个问题：
Σ(k=0,n)3 = O(3)
I've been looking through various things online but I still can't seem to solve it. I know it involves the formal definition of Big O, where
|f(x)| <= C*|g(x)|, x>=k
因为它们是相同的，所以我假设C是一个值，我必须通过归纳法找到它来证明原来的语句，而k=0。
谢谢你的帮助。
最佳答案
∑（K=0，N）3K
=30+31++3N个
=（1-3n+1）/（1-3）；几何级数之和
=（3/2）*3n-k
<=c*3n；对于c>=3/2
=O（3n）
关于algorithm - 总结归纳的大O证明，我们在Stack Overflow上找到一个类似的问题：https://stackoverflow.com/questions/21407776/