Triangles with Integer Sides, Revisited
From MaRDI portal
It is shown that the number of triangles with integer sides and perimeter \(n\) is \(p_3((n-3)/2) = \langle (n+3)^2/48 \rangle\) when \(n\) is odd and \(p_3((n-6)/2) = \langle n^2/48 \rangle\) when \(n\) is even, where \(p_3(m)\) is the number of partitions of \(m\) into at most three parts and \(\langle x \rangle\) is the integer closest to \(x\). The proof uses the fact that \(\sum_{n \geq 0} p_3(n)q^n = (1-q)^{-1}(1-q^2)^{-1}(1-q^3){-1}\) along with a clever decomposition of the right side into partial fractions.
Recommendations
Cited in
(9)- Orbits of triangles obtained by interior division of sides
- On the enumeration of integer tetrahedra
- Triangular Triples from Ceilings to Floors
- The triangle with integer sides and a kind of partition number
- Triangles with Integer Sides
- INTEGER POLYGONS OF GIVEN PERIMETER
- Integer triangles of given perimeter: a new approach via group theory
- On the perimeter of integral triangles
- A closed formula for the number of inequivalent ordered integer quadrilaterals with fixed perimeter
This page was built for publication: Triangles with Integer Sides, Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721373)
