Related papers: Counting Triangles in Triangles
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
We count the number of subsets of $\{1,2,\cdots,n\}$ under different conditions and study the sequence obtained as we let $n$ increase.
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
Triangular numbers that are multiple of other triangular numbers are investigated. It is known that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers which are triangular numbers. If the…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
We continue the work begun in OEIS sequence A332636 which presents recursive sequences that have triangles that appear embedded in them. This paper i) generalizes the main result presented in A332636, ii) provides a complete set of…
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.
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
The paper is devoted to the description of family of scalene triangles for which the triangle formed by the intersection points of bisectors with opposite sides is isosceles. We call them Sharygin triangles. It turns out that they are…
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…
In 1994, Dhar and Sinha provided a graphic representation in $\mathbb{R}^{2}$ of the classification of triangles based on similarity. In this article, we briefly recall their treatment and offer a generalization by providing a graphic…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if $p \geq…