Related papers: Counting Triangles in Triangles
We characterize triples of cevians which form a triangle independent of the triangle where they are constructed. This problem is equivalent to solving a three-parameter family of inequalities which we call Ceva's triangle inequalities. Our…
In this paper we first study the isoperimetric problem in the case of integer triangles, as well as Alcuin's sequence and how it relates to the number of different integer triangles with a given perimeter. We then present and compare two…
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
We give three new proofs of the triangle inequality in Euclidean Geometry. There seems to be only one known proof at the moment. It is due to properties of triangles, but our proofs are due to circles or ellipses. We aim to prove the…
For a given triangle $T$ and a real number $\rho$ we define Ceva's triangle $\CT_\rho(T)$ to be the triangle formed by three cevians each joining a vertex of $T$ to the point which divides the opposite side in the ratio $\rho:(1-\rho)$. We…
If P is a point inside triangle ABC, then the cevians through P extended to the circumcircle of triangle ABC create a figure containing a number of curvilinear triangles. Each curvilinear triangle is bounded by an arc of the circumcircle…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
We have computed a table of the triangle sides of all congruent numbers less than 10,000, which improves and extends the existing public table. We give some background on properties of the triangle sides, and explain how we computed our…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic…
In this work, we define a triangle area number to be the area number of a triangle whose sides have integer lengths, and whose area is a rational number. In Result 3, on page 17, we prove that every triangle area number is in fact an…
In this article we will consider average angles of triangle, which share the same side with regular polygons. In particular we will count average angles in the triangle, which share the same bottom side with a square with length side $d=1$.
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important…
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these algorithms require reading the whole input graph. In many…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
If P is a point inside triangle ABC, then the cevians through P divide triangle ABC into six smaller triangles. We give theorems about the relationship between the radii of the circles inscribed in these triangles.
The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.