[Math] Big O with multiple variables ($n,m$): Is $O((n+1)^m) = O(n^m)$

asymptoticscomputational complexitycomputer science

In the big O notation with multiple variables ($n,m$), is $O((n+1)^m) = O(n^m)$?


Details:

My intuition said yes, since adding a constant should neither have an effect in big O notation, even in a base. But since the exponent is also a variable and not a constant, I am not able to prove it. I tried for several definitions for Big O with multiple variables (such as the one on the wikipedia page and the one on this math.SE precious question), but did not find suitable estimates.

Best Answer

Note if $m=n^2$, then $$ \lim_{n \to \infty}\left(\frac{n^m}{(n+1)^m}\right) =\lim_{n \to \infty}\left(1+\frac{1}{n}\right)^{-n^2} = 0 $$

Related Question