A Maple One-Line Proof of George Andrews's Formula that Says that the Number of Triangles with Integer Sides Whose Perimeter is n Equals n²/12 -[n/4][(n+2)/4]

2012/02/06 by Shalosh B. Ekhad, Ekhad, Shalosh B.
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1202.1156

2 pages

arxiv created 2012/02/06 · arxiv updated 2012/02/07

Abstract

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!

Related

• Counting Triangles in Triangles
• An Application of Ptolemy's Theorem:Integral triangles with a 120 degree angle and the bisector(of the 120degree angle)also of integral length
• On the enumeration of integer tetrahedra
• Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles
• A Proof Without Words: Triangles in the Triangular Grid