Abstract

This article presents a generalization of the concurrency of the maltitudes of a cyclic quadrilateral, as well as a generalization of the Euler line to cyclic n-gons. The role of computer exploration and proof in this discovery is also briefly discussed.

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