Search results
Results from the WOW.Com Content Network
Ptolemy's Theorem yields as a corollary a pretty theorem [2] regarding an equilateral triangle inscribed in a circle. Given An equilateral triangle inscribed on a circle and a point on the circle. The distance from the point to the most distant vertex of the triangle is the sum of the distances from the point to the two nearer vertices.
For four points in order around a circle, Ptolemy's inequality becomes an equality, known as Ptolemy's theorem: ¯ ¯ + ¯ ¯ = ¯ ¯. In the inversion-based proof of Ptolemy's inequality, transforming four co-circular points by an inversion centered at one of them causes the other three to become collinear, so the triangle equality for these three points (from which Ptolemy's inequality may ...
Ptolemy's theorem states that the sum of the products of the lengths of opposite sides is equal to the product of the lengths of the diagonals. When those side-lengths are expressed in terms of the sin and cos values shown in the figure above, this yields the angle sum trigonometric identity for sine: sin( α + β ) = sin α cos β + cos α sin ...
Aristarchus's inequality (after the Greek astronomer and mathematician Aristarchus of Samos; c. 310 – c. 230 BCE) is a law of trigonometry which states that if α and β are acute angles (i.e. between 0 and a right angle) and β < α then
Casey's theorem and its converse can be used to prove a variety of statements in Euclidean geometry. For example, the shortest known proof [ 1 ] : 411 of Feuerbach's theorem uses the converse theorem.
It is uncertain who actually discovered the theorem; however, the oldest extant exposition appears in Spherics by Menelaus. In this book, the plane version of the theorem is used as a lemma to prove a spherical version of the theorem. [8] In Almagest, Ptolemy applies the theorem on a number of problems in spherical astronomy. [9]
TPTP (Thousands of Problems for Theorem Provers) [1] is a freely available collection of problems for automated theorem proving. It is used to evaluate the efficacy of automated reasoning algorithms. [2] [3] [4] Problems are expressed in a simple text-based format for first order logic or higher-order logic. [5]
Metamath is a formal language and an associated computer program (a proof assistant) for archiving and verifying mathematical proofs. [2] Several databases of proved theorems have been developed using Metamath covering standard results in logic, set theory, number theory, algebra, topology and analysis, among others.