Abstract

In 1993 Watkins and Zeitlin published a method [1] to simply compute the minimal polynomial of \(\cos (2\pi /n)\), based on the Chebyshev polynomials of the first kind. For the work presented in this paper we have implemented a small augmentation, based on Watkins an Zeitlin’s work, to the dynamic mathematics tool GeoGebra. We show that this improves GeoGebra’s capability to discover and automatically prove various non-trivial properties of regular n-gons.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call