MathCastle
Proof WritingChallengeWhat a Proof Is

What a Proof Is · Challenge problem

A proof claims gcd⁡(n2+1, n+1)=1\gcd(n^2 + 1,\ n + 1) = 1 for every positive integer nn. The claim is false. What is the largest value this gcd can take?