MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Sorry for the undeveloped question---it seems it should be elementary, but I just can't find anything useful! A nudge in the direction of relevant theorems would be greatly appreciated.

Really the title says it all. I have $p(x) \neq q(x)$, both of degree $n$ and convex on $\mathbb{R}$ with $p(0) = q(0) = 0$. Is there any better lower bound on the number of intersections than just $n$?

Does this question even make sense?

share|cite|improve this question
Could you please edit your message? What's $p(x)\neq q(x)$? Do you mean $p\neq q$? The "lower bound for intersections" is clearly $1$. Namely at $0$. Example: $p(x)=x$, $q(x)=x^2$. Do you mean "upper bound"? – Alexandre Eremenko Nov 13 '12 at 1:01
Is the question about the number of intersections of graphs of $p$ and $q$? – Dima Pasechnik Nov 13 '12 at 3:49

Let $f(x)$ and $g(x)$ be two polynomials of degree $n$, for $n$ even, that intersect at $n$ points, including $0$. Clearly these exist. Let

$p(x)=f(x)+ N (x^2+x^{n})-f(0)$

$q(x)=g(x) + N (x^2+x^n) -g(0)$

for $N$ sufficiently large.

Then $p(x)$ and $q(x)$ are convex, of degree $n$, still have $n$ intersections, and $p(0)=q(0)=0$.

So $n$ is best possible.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.