Disproving Homework Statement | Homework Equations | Attempt at Solution

  • Thread starter Thread starter Melodia
  • Start date Start date
Melodia
Messages
18
Reaction score
0

Homework Statement



Thanks for the help on the last problem. Here is the final problem set I'm stuck on:


SYPzV.jpg


Homework Equations





The Attempt at a Solution



To me it seems that there will always be a positive c so that cg(n) is greater or equal to f(n). No matter how large n is, since there's no limit to how large c can be (can even be a decimal), wouldn't that always be possible?

Thanks.
 
Physics news on Phys.org
First off, g is not a polynomial, as it is not the sum of multiples of integral powers of n. It might be helpful for you to graph the two functions, because you would see that for n larger than about 20, the linear function dominates the other function. Although f(n) = 2n + 3 is a linear function and grows at only a constant rate, that rate is larger than that of the other function, for large enough n.
 
Oooh I see. Since c is fixed and chosen before the n, then there will always be an n that contradicts the statement right?

I'm guessing the same thing applies to this other problem right?

8cBSM.jpg
 
Last edited:
Yes, essentially. For the first problem, there's no fixed value of c that works because you can always make n large enough so that the inequality doesn't hold. In other words, no such c exists.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top