论文标题
Fermat的两个正方形定理的quixotic证明
A Quixotic Proof of Fermat's Two Squares Theorem for Prime Numbers
论文作者
论文摘要
每个奇数p可以精确地写入（p + 1）/2作为两个有序产品AB和CD的AB + CD，以使最小（a，b）> max（c，d）。简单的推论是Fermat定理以1 + 4n表示的素数为两个正方形的总和。
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two squares.
