0
$\begingroup$

Let $P\in\mathbb{R}[x, y]$ be a polynomial such that there are exactly $n$ pairs $(x, y)$ in $\mathbb{R}^2$ such that $P(x, y)=0$. Is it possible for $P$ to have degree less than $2n$?

$\endgroup$
2
  • 8
    $\begingroup$ Yes. Factor n into rs, and pick interesting polynomials P and Q with r and s real roots. Use P(x)^2 + Q(y)^2 to get your n pairs at cost max (2r , 2s) <= n for composite n. $\endgroup$ May 2, 2014 at 22:43
  • $\begingroup$ There are also versions for n a large prime that allow you to reduce the degree to slightly below n. I leave that to you. $\endgroup$ May 2, 2014 at 22:49

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.