Carl Swenson, André L. Yandl
Abstract
SummaryInside any Pythagorean right triangle, it is possible to find a point M so that drawing segments from M to each vertex of the triangle yields angles whose sines and cosines are all rational. This article describes an algorithm that generates an infinite number of such points.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
SummaryInside any Pythagorean right triangle, it is possible to find a point M so that drawing segments from M to each vertex of the triangle yields angles whose sines and cosines are all rational. This article describes an algorithm that generates an infinite number of such points.
Key concepts: Pythagorean theorem, Pythagorean triple, Mathematics, Pythagorean trigonometric identity, Incircle and excircles of a triangle, Combinatorics, Point (geometry), Vertex (graph theory)