Related papers: New Proofs of Triangle Inequalities
In this paper, we show that an equilateral triangle cannot be dissected into finitely many smaller equilateral triangles, no two of which share two vertices. We do this without the use of Electrical Networks.
In this article we will represent some ideas and a lot of new theorems in Euclidean plane geometry.
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
Yet another example where "physical" (i.e. only checking finitely many special cases) gives a fully rigorous proof, notwithstanding what your "Intro To Proofs" prof told you!
We establish new and different kinds of proofs of properties that arise due to the orthogonal decomposition of the Hilbert space, including projections, over the unit interval of one dimension. We also see angles between functions,…
It is a classical fact in Euclidean geometry that the regular polygon maximizes area amongst polygons of the same perimeter and number of sides, and the analogue of this in non-Euclidean geometries has long been a folklore result. In this…
Recent interest in noncircular trigonometric proofs has underscored the need for alternative methodologies. Jackson and Johnson's 2024 study addresses a longstanding gap in the foundations of trigonometric proofs. Inspired by the work of…
By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.
Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…
For any three nonzero vectors $a,b,c$ in $\mathbb R^2$, we obtain a necessary and sufficient condition for the sum of the three pairwise angles between these vectors to equal $2\pi$. As an easy consequence of this, a proof of Euclid's…
We present a criterion when six points chosen on the sides of a triangle belong to the same conic. Using this tool we show how the two geometrical gems - celebrated Poncelet's theorem of projective geometry and incredible Morley's theorem…
In this paper, we explicitly show the various isometries of the plane under the taxicab metric. We then use these isometries to prove that Euclid's proposition I.5 for isoscelese triangles is true under certain circumstances in taxicab…
We provide a new formulation and proof of the triangle altitudes theorem in hyperbolic plane geometry, together with an easily computed discriminant to distinguish between different basic configurations of the altitudes of such a triangle.
We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…
One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…
We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…