Congruence Of Convex Polygons
Main Article Content
Abstract
The study aimed to determine the conditions for the congruence of convex polygons by using direct proof, specifically the two-column proof under Euclidean geometry. Patterns of the existing postulates and theorems on triangles and convex quadrilaterals were discovered. Moreover, another proof of the theorems on the congruence of convex quadrilaterals were formulated by establishing Nth Angle Theorem. Furthermore, since the patterns on the congruence of triangles and convex quadrilaterals are perfectly correlated, conjectures were derived from these arrays. That is, two convex n-gons are congruent if and only if their corresponding: n-2 consecutive sides and n-1 angles are respectively congruent; n-1 sides and n-2 included angles are respectively congruent; and n sides and n-3 angles are respectively congruent. In addition, to verify the conjectures theorems on the congruence of convex pentagons and convex hexagons were proven. Since there is strong evidence that holds for the conjectures of the congruence of convex polygons, it opens portal for other researchers to exactly predict and prove the congruence of other convex n-gons, where n >6.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.