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]

Details 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] 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]

2012-02-06

arxiv.org/abs/1202.1156v1

Mathematics

Combinatorics

2 pages

Scientific paper

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!

Affiliated with

Also associated with

No associations

Rating

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] does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 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], we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 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] will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119615