MathCastle
Proof WritingSuperchallengeExistence, Uniqueness and Counterexamples

Existence, Uniqueness and Counterexamples · Superchallenge problem

Claim: n2+n+1n^2 + n + 1 is squarefree (not divisible by the square of a prime) for every positive integer nn. What is the smallest counterexample? (Hint: which primes can divide n2+n+1n^2 + n + 1 at all?)