I have a problem that I solved, but I'm unsure if my answers are correct or not. I've never seen the implementation of time complexities as elements of others.
f(n) element of O(log(n)) g(n) element of theta(n)
Prove if the below are true are false, provide a counter example if it's false.
1) g(n) element of omega(f(n)) 2) f(n)g(n) element of O(nlog(n)) 3) f(n)g(n) element of theta(nlog(n))
Below are my attempts, which was just because I thought it was the logical solution. Any ideas on how I can go about solving these types of questions?
1) False, g(n) has a tight bound at (n). If it had a lower bound of f(n), then g(n) should allow log(n), but that's too high of a complexity.
3) False, f(n) having an upper bound of log(n) implies it could be even faster. Setting a tight bound contradicts that wherein it cant go faster.