Optimizing f(p,q) with Close Proximity of p and q in (0,1): A Formal Analysis

  • Thread starter Thread starter jimholt
  • Start date Start date
  • Tags Tags
    Limits
jimholt
Messages
12
Reaction score
0

Homework Statement



I have the function f(p,q)=p(1-p)/[q(1-q)] where p and q are in (0,1). I want to say that if p is close to q, f(p,q) is 'close' to 1. What is a formal way of saying how close to p q should be?

The Attempt at a Solution



Basically I want to say f(p,q)= 1 + \epsilon(p,q) where \epsilon(p,q) is small if some condition "X" is true. Is there an obvious way of saying what "X" is? Maybe I can substitute q=p+u... but then what? Taylor series or L'hopital's or something? My calc is pretty rusty, so I'd appreciate any reminders...
 
Last edited:
Physics news on Phys.org
Substituting p = q+u sounds like a good idea. Then use
<br /> (q+u)(1-q-u) = q-q^2-2qu+u-u^2 = q(1-q)-2qu+u-u^2<br />
 
If you define a function

<br /> g(x) = x (1 - x)<br />

can you translate the question you asked in terms of it?
 
Why not just write that the limit[f(p,q)] = 1 as p \rightarrow q ?
 
Raskolnikov said:
Why not just write that the limit[f(p,q)] = 1 as p \rightarrow q ?

I agree.
The problem statement is nearly the very definition of a Limit.
You just did not use the letters epsilon and delta x.
 
\frac{p(1-p)}{q(1- q)}= \left(\frac{p}{q}\right)\left(\frac{1-p}{1-q}\right)
Does that help?
 
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