0 0 votes closed as a duplicate of: Asymptotics I got that Statement 3 can be false in case we have function 1/n, then its square become 1/n^2. But I don't think statement 2 is true either. Please prove whether I'm correct or wrong. Question No. 20 Marks : 0.33 Find the False Statement \[ O\left(2^{a}\right)=O\left(3^{n}\right) \] $O\left(\log n^{2}\right)=O(\log n)$ \[ f(n)=0\left(f(n)^{2}\right) \] \[ \left(2^{2 \operatorname{cog}}(\log n)\right)=O\left(n^{2} \log n\right) \] Solution: consider a case when \[ f(n)=c-\frac{1}{n} \] Algorithms test-series testbook-test-series algorithms time-complexity + – Akash Kanase 627 views comment Share Follow Print See 1 comment 1 1 comment reply Riya Roy(Arayana) commented Jan 15, 2016 reply Follow flag O(logn^2) = O (2logn ) = O(logn) we do not consider constants in case of asymtotic notations. 1 1 replyShare Please log in or register to add a comment.