Greedy Calvinosaurus Dinosaur

Number Theory Level 5

Greedy Calvinosaurus Dinosaur is threatening to gobble you up, unless you can tell him what is the largest possible value of gcd⁡(122+n2,122+(n+1)2), \gcd (122 + n^2, 122 + (n+1)^2 ) , as nn ranges over all positive integers.

Quick, to save your life, what is the answer?

Calvin Lin by Calvin Lin
×

Problem Loading...

Note Loading...

Set Loading...