Let dn = gcd(n² + 56, (n + 1)² + 56) for positive integers n. How many different values does dn take as n runs over all positive integers? | StemPy Lab