Gives a complete proof for every integer n.

This part depends on a sketch or modelling judgement. Compare your work with each criterion before continuing.

• The proof covers every integer, for example by even/odd cases, residues mod 4 or contradiction.
• Every transformation is valid.
• The conclusion explicitly states that n² + 2 is never divisible by 4.