search
Log In
0 votes
188 views
Let $f(n)$ and $g(n)$ be asymptotically positive functions. Prove or disprove below fact

(h) $f(n)+o(f(n))=\Theta(f(n))$

is it true?
in Algorithms 188 views
0
what is h?
0
where is h?
0
ok sorry,

it is not correct I think

$f(n)+o(f(n))=O(f(n))$
0

@srestha

why ? 

1
difference between small-o and Big-O is a '='

f(n) is exact value here

and it brings '=' sign in the equation

so it converted to big-O
1

Let f(n) be n, then o(f(n)) is > f(n). So let it be n2.

f(n) + o(f(n)) = c1*n + c2*n2 = ⊝(n2) ≠ ⊝(n) i.e. ⊝(f(n))

So I think it should be false.

0

@srestha, @MiNiPanda,

Your Explanations satisfies me....

1 Answer

0 votes

I Think this statement is true, we can prove this using properties of asymptotic notation

Let me know if am wrong.

Related questions

0 votes
2 answers
1
103 views
F(n)=O{ [ f(n)]^2} This statement is true or false With reason..
asked Sep 22, 2019 in Algorithms shubhamkks1005 103 views
1 vote
2 answers
2
350 views
If $T1(n) = \Theta(f(n))$ & $T2(n) = \Theta(f(n))$ Then, Is $T1(n) + T2(n) = O(f(n))$ If yes, then how?
asked May 26, 2019 in Algorithms shubhojit1412 350 views
1 vote
0 answers
3
142 views
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)
asked Jan 12, 2019 in Algorithms bts1jimin 142 views
2 votes
1 answer
4
282 views
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
asked Jan 21, 2018 in Algorithms hacker16 282 views
...