Question: Exercise 9 . 8 ( Logarithmic bound ) : Show that T ( n ) = lg ( 1 0 2 4 n ) -

Exercise 9.8(Logarithmic bound): Show that T(n)= lg(1024 n)-13 is (lg n) by showing that __c1__|lg n|<=|T(n)|<=__c2__|lg n| for all n >___.(Please fill in where I left the "_____", thnak you)
T(n)= lg(1024 n)-13= lg(_____)+ lg(n)-13= lg(n)-_____
lg(n)<=______for n >0
+_______<=0 for n >0
==================
So, T(n)<=______for n >0. Also, T(n)>=0 for all n >________
(Enter smallest integer for which this is true) so that |T(n)|= T(n) for all such n. Also, lg(n)>=0 for all n >______(Enter smallest integer for which this is true.) so that |lg(n)|= lg(n) for all such n. Thus:
|T(n)|<=______|lg n| for all n >_____(Use the smallest integer in the first blank for which this inequality can be satisfied for all n greater than a certain number. Then in the second blank, substitute either the smallest integer for which it will be true, or the smallest integer that "obviously" results from this proof. Both will be accepted as correct.)
So, we showed that T(n) is Big _____(lg n)(Fill in the blank with O or Omega).
Using the above equality from log laws, we could break up T(n) into a sum of two terms. Comparing each one individually and then taking the sum, we'd have the following:
lg(n)>=_____for n >0
+________>=-1/4 lg(n) for n >_____(Enter smallest integer for which this is true.)
==================
So, T(n)>=______for n >______ and for all such n, we have already shown T(n)>=0 and |lg(n)|>=0, so |T(n)|>=________|lg n| for all such n, whereby we have shown T(n) is Big _____(n lg n)(Fill in the blank with O or Omega).
Combining these results, we have shown that T(n) is (lg n) since:
_____|lg n|<=|T(n)|<=_____|lg n| for all N >______ whereby T(n) is (nlgn).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!