About this document
Smallest Degree for 2n-gon Polynomial by leitesebastiao07 is a document available to read on EtoBox.
The document presents a proposal for a problem regarding the smallest possible degree of a polynomial f that vanishes for points forming the vertices of a regular 2n-gon. It establishes that the minimum degree is 2n and provides a proof and construction for the polynomial. Additionally, it discusses implications for odd integers and suggests a lower bound for the degree in those cases.
- Author
- leitesebastiao07
- Language
- EN