A Combinatorial Proof for Partitions of Pythagorean Triples Into Three Parts
Abstract
Any Pythagorean triple \a,b,c\ such that a2+b2=c2 satisfies an elegant relation between its partitions into three parts, namely p(a,3)+p(b,3)=p(c,3). While this property follows from elementary analytic methods, we give the first combinatorial proof of this relation.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.