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
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)).
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
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)
Prove, by finding constants that satisfy the definition of order of magnitude, that f=theta(g) if f(x)=(3x^3)-7x...
Prove, by finding constants that satisfy the definition of order of magnitude, that f=theta(g) if f(x)=(3x^3)-7x and g(x)=(x^3)/2.
Please note n's are superscripted. (a) Use mathematical induction to prove that 2n+1 + 3n+1 ≤...
Please note n's are superscripted. (a) Use mathematical induction to prove that 2n+1 + 3n+1 ≤ 2 · 4n for all integers n ≥ 3. (b) Let f(n) = 2n+1 + 3n+1 and g(n) = 4n. Using the inequality from part (a) prove that f(n) = O(g(n)). You need to give a rigorous proof derived directly from the definition of O-notation, without using any theorems from class. (First, give a complete statement of the definition. Next, show how f(n) =...
f:N->N f(1)=3 and f(2)=5 and for each n>2, f(n)=f(n-1)+f(n-2). Please prove that for each n in...
f:N->N f(1)=3 and f(2)=5 and for each n>2, f(n)=f(n-1)+f(n-2). Please prove that for each n in N, f(n)*f(n+2)=(f(n+1))^2+(-1)^(n) using induction.
Using the definition of convergence of a sequence, prove that the sequence converges to the proposed...
Using the definition of convergence of a sequence, prove that the sequence converges to the proposed limit. lim (as n goes to infinity) 1/(n^2) = 0
Prove directly from definition that the set {1/2^n | n=1, 2, 3, ...} is not compact...
Prove directly from definition that the set {1/2^n | n=1, 2, 3, ...} is not compact but {0, 1/2^n |n=1, 2, 3, ...} is compact.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT