1
$\begingroup$

If two functions $f$ and $g$ are such that:

  • $f(0) = g(0)$
  • $\forall x > 0,\ f^\prime(x) > g^\prime(x)$

is it true that $f\neq g$ for any $x>0$?

I believe so, but I don't know how to prove it. This seems simple though, there might be something I don't see quite yet.

$\endgroup$

1 Answer 1

2
$\begingroup$

Let $h(x)=f(x)-g(x)$. Then $h(0)=0$ and $h'(x)>0$ for all $x>0$. If $h(a)=0$ for some $a>0$, we get a contradiction by applying the mean value theorem on the interval $[0,a]$.

$\endgroup$
1
  • $\begingroup$ I knew it was simple :) Thanks $\endgroup$
    – Jonathan H
    Jan 29, 2013 at 23:42

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .