Question reads:
$$\forall n \in \mathbb{N}, \forall m \in \mathbb{N}, (n^4 + n^2 + 1 \ne m^2)$$
In english, this reads: for every n and m in the set of natural numbers, $n^4 + n^2 + 1$ does not equal a perfect square.
I would like to prove by contradiction because it seems like the most obvious route, but have gotten stuck and need help. My goal is to negate the implication above and either prove or disprove: $$n^4 + n^2 + 1 = m^2$$ As follows:
$$\sim(\forall n \in \mathbb{N}, \forall m \in \mathbb{N} ,(n^4 + n^2 + 1 \ne m^2)) = \exists n \in \mathbb{N}, \sim(\forall m \in \mathbb{N}, (n^4 + n^2 + 1 \ne m^2))$$ $$\exists n \in \mathbb{N}, \sim(\forall m \in \mathbb{N}, (n^4 + n^2 + 1 \ne m^2)) = \exists n \in \mathbb{N}, \exists m \in \mathbb{N}, \sim(n^4 + n^2 + 1 \ne m^2)$$ $$\exists n \in \mathbb{N}, \exists m \in \mathbb{N}, \sim(n^4 + n^2 + 1 \ne m^2) = \exists n \in \mathbb{N}, \exists m \in \mathbb{N}, (n^4 + n^2 + 1 = m^2)$$ My goal is now to prove or disprove: $$n^4 + n^2 + 1 = m^2$$ By factoring: $$n^2(n^2 + 1) + 1 = m^2$$ $$n^2(n^2 + 1) = m^2 - 1$$ Clearly, both of the the items on the left of the equation can divide the right hand side, but I'm not sure where to go from here. Any help would be appreciated.
$$(n^2)^2<n^4+n^2+1<(n^2+1)^2$$ so that $n^4+n^2+1$ is between two consecutive squares.