Solving the Gompert Equation: Can You Help?

  • Thread starter Thread starter Gogsey
  • Start date Start date
  • Tags Tags
    Stuck
Gogsey
Messages
153
Reaction score
0
Can you help me solve this equation? Its the Gompert equation, dp/dt=cln(K/p)p.

I used substution to get -ln(u) = ct+b, where c is a constant, and bi s a constant of integration.

Next we have -ln(ln(k/p)) evaluated from pt to po = ct+b

Then ln(k/p) from pt to po = Bexp(-ct).

This is where I am stuck and don't know how to evaluate the rest of this to get an expression for pt.
 
Physics news on Phys.org
Just exponentiate again and solve for p, right?
 
Then I get k/pt - k/po = exp(bexp(-ct), right? and then solving for pt i get

pt = k/exp(bexp(-ct) + po. But this is different from what my buddy got, and his is correct. We have to enter it online in the space provided, and it tells us if its correct once we submit it.

He got Kexp((ln(b))exp(-ct)) before he solved for b. I want to understand how he got this, not just plug the answer in without knowing.
 
I would say you get k/p(t)=exp(B*exp(-ct)), or p(t)=k/exp(B*exp(-ct)), which you can also write as p(t)=k*exp(-B*exp(-ct)). That's p as a function of t. I'm not very sure what p0 and pt are supposed to be.
 
Don't worry about it. This was initially what I had, but chaged it for some reason, thinking I had to evaluate the integral between pt and po, instead of pt and 0, lol. po is the IVP.

So I actually had the same answer as you got except I left the exp function in the denominator, and left is a a positive exp.

Thanks
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top