MathCastle
Number TheorySuperchallengeFactors & Multiples

Factors & Multiples · Superchallenge problem

Let dn=gcd⁡(n2+30, (n+1)2+30)d_n = \gcd(n^2 + 30,\ (n + 1)^2 + 30) for positive integers nn. What is the largest value dnd_n takes?