Proofs of Existence and Optimality · Difficult Problems in Number Theory (Optional)

Lesson 11

Nikolai Chukhin · Alexander S. Kulikov

Below is the smallest such \(n\). 

from math import gcd


def f(n):
    return n ** 17 + 9


n = 8424432925592889329288197322308900672459420460792433
print(gcd(f(n), f(n + 1)))

8936582237915716659950962253358945635793453256935559