Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Precalculus Mathematics Homework Help
Determine Big O of a function (Discrete math)
Reply to thread
Message
[QUOTE="Miike012, post: 4532509, member: 265497"] Question: Determine whether the function log(n[SUP]2[/SUP]+1) is O(logn). Definition in paint document if needed. Solution: n[SUP]2[/SUP] + 1 < 2n[SUP]2[/SUP] whenever n>1 log(n[SUP]2[/SUP] + 1) < log( 2n[SUP]2[/SUP] ) = log(2) + 2log(n). Now, log(n)>log(2) whenever n>2. Therefore log(2) + 2log(n)<3log(n). log(n[SUP]2[/SUP] + 1) ≤ 3log(n) whenever n>2. ∴Because there exists constants C and k such that log(n[SUP]2[/SUP] + 1)≤Clog(n) whenever n>k we can conclude log(n[SUP]2[/SUP] + 1) is O(logn). Is this correct? The book says that log(n[SUP]2[/SUP] + 1) is not O(logn). [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Precalculus Mathematics Homework Help
Determine Big O of a function (Discrete math)
Back
Top