edited by
430 views
0 votes
0 votes

Consider the two functions (logn)k  and  nϵ, where k>1 and ϵ>0. 

The solution is (logn)k= O(nϵ). 

My doubt is that if we take ϵ as0.000000000000000000000000000000.......000000000001 that is very small wont this result be wrong??

Can someone check?

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
BASANT KUMAR asked Mar 26, 2018
304 views
Show that $k \ln k = \Theta(n)$ implies $k=\Theta (n/\ln n)$
1 votes
1 votes
1 answer
2
Abhilash Mishra asked Jul 4, 2018
674 views
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inc...
2 votes
2 votes
1 answer
3
Veeplob Singh asked Jul 22, 2017
654 views
Refer Cormen 4-3 (j) Page no108Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n