Timeline for Is it possible for P to have degree less than 2n?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2014 at 22:49 | comment | added | The Masked Avenger | 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. | |
| May 2, 2014 at 22:43 | comment | added | The Masked Avenger | 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. | |
| May 2, 2014 at 22:11 | history | asked | user50139 | CC BY-SA 3.0 |