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^2/12$} -[n/4][(n+2)/4]

Shalosh B. Ekhad

arxiv: 1202.1156 · v1 · pith:YBDDOSJLnew · submitted 2012-02-06 · 🧮 math.CO

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]

Shalosh B. Ekhad This is my paper

classification 🧮 math.CO

keywords proofandrewsanothercasescheckingequalsexamplefinitely

0 comments

read the original 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!

This paper has not been read by Pith yet.

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]

discussion (0)