Question

1. Using the definition of Θ, prove that if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n)).

1. Using the definition of Θ, prove that if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n)).

Homework Answers

Answer #1

To prove: if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n)).

As we know that f(n) ∈ Θ(g(n)) implies that there are positive constants c1, c2, and k, such that Θ ≤ c1*g(n) ≤ f(n) ≤ c2*g(n) for all n ≥ k.
The first relation formed between f and g is:
c1*g(n) ≤ f(n) => g(n) ≤ 1/c1*f(n) ......equation(1)

The second relation between f and g is:
f(n) ≤ c2*g(n) => 1/c2*f(n) ≤ g(n) ......equation(2)

On combining both equation(1) and equation(2), we get:
1/c2*f(n) ≤ g(n) ≤ 1/c1*f(n)

let c3 = 1/c2 and c4 = 1/c1
since they exist and are positive(>=0) as c2 and c1 are positive which is true for all n>=k,
hence, we can derive that:

c3*f(n) ≤ g(n) ≤ c4*f(n), for all n ≥ k

Thus, g(n) ∈ Θ(f(n)), which is true;

Hence, if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n))

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1.)Prove that f(n) = Ω(g(n)), given: F(n) = n2 ; g(n) = n2 + n 2.)Prove...
1.)Prove that f(n) = Ω(g(n)), given: F(n) = n2 ; g(n) = n2 + n 2.)Prove that f(n) = θ(g(n)) for f(n) = n2 + n; g(n) = 5n2
Let f,g be positive real-valued functions. Use the definition of big-O to prove: If f(n) is...
Let f,g be positive real-valued functions. Use the definition of big-O to prove: If f(n) is O(g(n)), then f2(n)+f4(n) is O(g2(n)+g4(n)).
Part I) Prove that if f and g are continuous at a, then f+g is continuous...
Part I) Prove that if f and g are continuous at a, then f+g is continuous at a using the epsilon-δ definition. Part II) Let a, L ∈ R. Prove that if a ≥ L− ε for all positive, then a ≥ L.
Using the definition of the DTFT, find the DTFT of f(n) = anu[n + 1] where...
Using the definition of the DTFT, find the DTFT of f(n) = anu[n + 1] where |a| < 1
1.Let f and g be two functions such that f(n)/g(n) converges to a positive value less...
1.Let f and g be two functions such that f(n)/g(n) converges to a positive value less than 1 as n tends to infinity. Which of the following is necessarily true? Select one: a. g(n)=Ω(f(n)) b. f(n)=Ω(g(n)) c. f(n)=O(g(n)) d. g(n)=O(f(n)) e. All of the answers 2. If T(n)=n+23 log(2n) where the base of the log is 2, then which of the following is true: Select one: a. T(n)=θ(n^2) b. T(n)=θ(n) c. T(n)=θ(n^3) d. T(n)=θ(3^n) 3. Let f and g be...
Are any of the following implications always true? Prove or give a counter-example. a) f(n) =...
Are any of the following implications always true? Prove or give a counter-example. a) f(n) = Θ(g(n)) -> f(n) = cg(n) + o(g(n)), for some real constant c > 0. *(little o in here) b) f(n) = Θ(g(n)) -> f(n) = cg(n) + O(g(n)), for some real constant c > 0. *(big O in here)
For an arbitrary m x n matrix, Prove that (AT)T = A by using the definition...
For an arbitrary m x n matrix, Prove that (AT)T = A by using the definition of the transpose.
Prove the product rule for derivatives using only the following definition of derivative: [f(x) - f(a)]...
Prove the product rule for derivatives using only the following definition of derivative: [f(x) - f(a)] / (x-a)
1. (15 pts total) Prove or disprove each of the following claims, where f(n) and g(n)...
1. (15 pts total) Prove or disprove each of the following claims, where f(n) and g(n) are functions on positive values. (a) f(n) = O(g(n)) implies g(n) = Ω(f(n)) (b) f(n) = O(g(n)) implies 2^f(n) = O(2^g(n)) (c) f(n) = O((f(n))^2)
I need to prove (a + 10)^10 = Θ(a^10). I know that by the definition of...
I need to prove (a + 10)^10 = Θ(a^10). I know that by the definition of Θ I need to squeeze the function with two constants but I'm not sure how to do that.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT