What a Proof Is · Hard problem

What is the largest integer that divides $n^2 + 2n + 5$ for every odd integer $n$?