Yet another Proof of an old Hat
Abstract
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .
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.