Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that f (x) is o(g(x)). Does it follow that log |f (x)| is o(log |g(x)|)?

Short Answer

Expert verified

Use mathematical representation of little o notation and prove thatit is 0.

Step by step solution

01

Step 1:

Our functions are a(x)=log|f(x)|and b(x)=log|g(x)|, and we also know that limxf(x)g(x)=0.

Let our old functions f(x) and g(x) be:

f(x)=x2

g(x)=x3

Then,limxf(x)g(x)=0

02

Step 2:

Determining the limit ratios of the new functions:

limxa(x)b(x)=limxlog|f(x)|log|g(x)|limxlogx2logx3=limxlog|x|2log|x|2=limx2log|x|3log|x|=230

We see that a(x) is not o(b(x)).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Describe an algorithm that locates the last occurrence of the smallest element in a finite list of integers, where the integers in the list are not necessarily distinct.

Show that if f(x)=anxn+an1xn1++a1x+a0,, where a0,a1,.....,an-1,and anare real numbers and an an0, then data-custom-editor="chemistry" f(x)is Θ(xn). Big-O, big-Theta, and big-Omega notation can be extended to functions in more than one variable. For example, the statement fx,yis O(g(x,y))means that there exist constants C, k1, and k2such that |f(x,y)|C|g(x,y)|wheneverx>k1 and x>k2.

a) Describe in detail (and in English) the steps of an algorithm that finds the maximum and minimum of a sequence of elements by examining pairs of successive elements, keeping track of a temporary maximum and a temporary minimum. Ifn is odd, both the temporary maximum and temporary minimum should initially equal the first term, and ifn is even, the temporary minimum and temporary maximum should be found by comparing the initial two elements. The temporary maximum and temporary minimum should be updated by comparing them with the maximum and minimum of the pair of elements being examined.

b) Express the algorithm described in part (a) in pseudocode.

c) How many comparisons of elements of the sequence are carried out by this algorithm? (Do not count comparisons used to determine whether the end of the sequence has been reached.) How does this compare to the number of comparisons used by the algorithm in Exercise 5?

Show that the following problem is solvable. Given two programs with their input and the knowledge that exactly one of them halts, determine which halts.

Let f1(x)and data-custom-editor="chemistry" f2(x)be functions from the set of real numbers to the set of positive real numbers. Show that if f1(x)and data-custom-editor="chemistry" f2(x)are both Θ(g(x)), where g(x) is a function from the set of real numbers to the set of positive real numbers, then f1(x)+ f2(x)is Θ(g(x)). Is this still true if f1(x)and f2(x) can take negative values?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free