The Gateway to Computer Science Excellence
0 votes
89 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 by Boss (29k points) | 89 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.

by (25 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,045 comments
104,671 users