Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 3 - Section 3.2 - The Growth of Functions - Exercises - Page 216: 17

Answer

if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x)$

Work Step by Step

Given: $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ We have to prove that $f(x)$ is $O(h(x))$ Since $f(x)$ is $O(g(x))$, there exist constants $C_{1}$ and $k_{1}$ such that: $|f(x)| \leq C_{1}|g(x)|$ When $x>k_{1}$ Since $g(x)$ is $ O(h(x))$, there exist constants $C{2}$ and $k_{2}$ such that: $|g(x)| \leq C_{2}|h(x)|$ When $x>k_{2}$. For convenience sake, we choose $k={k_2}$ (which also implies $x>k_{2}$) and $C=C_{1} C_{2}$. $|f(x)| \leq C_{1}|g(x)| \leq C_{1}\left(C_{2}|h(x)|\right)=C_{1} C_{2}|h(x)|=C|h(x)|$ By the Big-O definition, we then obtained that $f(x)$ is $O(h(x))$ with constants $k=k_{2}$ and $C=C_{1} C_{2}$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.