Let dn=gcd(n2+56, (n+1)2+56)d_n = \gcd(n^2 + 56,\ (n + 1)^2 + 56)dn=gcd(n2+56, (n+1)2+56) for positive integers nnn. How many different values does dnd_ndn take as nnn runs over all positive integers?
Log in to join the discussion.
Loading…