Triangular Triples from Ceilings to Floors
Using known expressions for the number of partitions of \(n\) into 3 and 2 parts, \textit{G. E. Andrews} [Am. Math. Mon. 86, 477-478 (1979; Zbl 0416.10010)] gave a 3-line proof that the number of incongruent triangles with integer sides that have perimeter \(n\) (i.e., triples \((i,j,k)\) of integers satisfying \(1\leq i\leq j\leq k< i+j\), \(n=i+j+k\)) is \(\{{n^2\over 12}\} -\lfloor{n\over 4}\rfloor\lfloor{n+2\over 4}\rfloor\). In the present paper the authors establish this and similar counts (e.g., \(n=i+j+k\), \(0\leq i\leq j\leq k\leq i+j\)) by strictly elementary methods.
- A counting formula for triangles
- On triangle-partitions. I
- On the enumeration of integer tetrahedra
- Triangles with Integer Sides, Revisited
- Finite sums of the Alcuin numbers
- Communal partitions of integers
- Partitions of n and connected triangles
- The triangle with integer sides and a kind of partition number
- A remark on partitions and triangles
- scientific article; zbMATH DE number 464782 (Why is no real title available?)
- INTEGER POLYGONS OF GIVEN PERIMETER
- Integer triangles of given perimeter: a new approach via group theory
- On the perimeter of integral triangles
- Perfect Triangles
This page was built for publication: Triangular Triples from Ceilings to Floors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757499)
