How can one find the factorization $a^4 + 2a^3 + 3a^2 + 2a + 1 = (a^2 + a + 1)^2$ from scratch? I want to prove $a^4 + 2a^3 + 3a^2 + 2a + 1$ always be perfect square for $a \in \mathbb{N}$. Using GeoGebra I found $a^4 + 2a^3 + 3a ² + 2a + 1 = (a^2 + a + 1)^2$ which is trivial to verify.
Since this equation has no real roots, it's not so easy to decompose it through division by $a-a_0$ where $a_0$ is a root. I don't want to use complex numbers if possible. How do find this factorization from scratch / without using a computer?
 A: The coefficients $1,2,3,2,1$ are suggestive of the following:
$$\begin{array}{c}  & 1a^4 & + & 2a^3 & + & 3a^2 & + & 2a & + & 1 \\ \hline
= & a^4 & + & a^3 & + & a^2 \\ & & + & a^3 & + & a^2 & + & a \\ & & & & + & a^2 & + & a & + & 1 \end{array} $$
$$\begin{array}{l} = & a^2(a^2+a+1)+a(a^2+a+1)+1(a^2+a+1) \\ = & (a^2+a+1)^2. \end{array}$$
A: Standard Solution:
Let $a^4+2a^3+3a^2+2a+1=(ba^2+ca+d)^2$ where $b,c,d \in \mathbb{R}$
Observe that
$$(ba^2+ca+d)^2=b^2a^4+2bca^3+(2bd+c^2)a^2+2cda+d^2$$
Comparing coefficient of like terms, we get 
$$b^2=1 \Rightarrow b=\pm 1$$
$$bc=1 \Rightarrow c=\pm 1$$
$$ \pm2d+1=3 \Rightarrow d=\pm 1$$
Thus, $$a^4+2a^3+3a^2+2a+1=[\pm(a^2+a+1)]^2$$
Note: Although it appears that this method assumes that the quartic must be the square of a polynomials, but if you end up getting no answer, it means you arrived at a contradiction and the equation is not the square of a polynomial. Moreover, the if there are 2 answers, they are additive inverses of each other.

Alternate Solution:
Let $f(a)=a^4+2a^3+3a^2+2a+1$
Observe that $f(0)=1$ and that the coefficients follow this pattern: $1,2,3,2,1$
Dividing $f(a)$ by $a^2$ to get 
$$g(a)=\frac{f(a)}{a^2}=a^2+2a+3+\frac{2}{a}+\frac{1}{a^2}=\left(a+\frac{1}{a}\right)^2+2\left(a+\frac{1}{a}\right)+1$$
Substitute $t=a+\dfrac{1}{a}$ to get 
$t^2+2t+1=(t+1)^2$
Now, back-substitute to get 
$$f(a)=a^2 \cdot \left(a+\frac{1}{a}+1\right)^2=(a^2+a+1)^2$$
But since $x^2=(-x)^2$, we get 
$$\color{blue}{\boxed{\color{red}{a^4+2a^3+3a^2+2a+1=[\pm (a^2+a+1)]^2}}}$$
A: Kronecker's polynomial factorization method may be used here. Let
$$ f(x) = x^4 + 2x^3 + 3x^2 + 2x + 1 $$
and let $ g(x) = x^2 + bx + c $ be an irreducible quadratic dividing $ f(x) $ in $ \mathbf Z[x] $ (such a quadratic must exist if the polynomial is reducible, since there are no rational roots).  We observe that $ f(0) = f(-1) = 1 $, and since $ g $ divides $ f $ in $ \mathbf Z[x] $, it follows that $ g(0), g(-1) $ divide $ f(0), f(-1) $ respectively. Therefore, there are four cases we must check for $ (c, b) $:
$$ (1, 1),\, (1, 3),\, (-1, 1),\, (-1, -1) $$
Testing the first candidate, we find that $ x^2 + x + 1 $ is indeed a divisor, and the result of the division algorithm is that $ f(x) = (x^2 + x + 1)^2 $. Thus, we don't even need to check the other cases, and we are done.
The strategy is that we can always reduce the factorization problem over a factorial ring into checking finitely many cases, and with clever choices we can cut down the number of cases considerably. Here, there were four cases to check, and performing four divisions isn't very time consuming. If none of these cases worked, we would have concluded that our original polynomial $ f(x) $ was irreducible in $ \mathbf Q[x] $.
A: In this particular case you may multiply by $(a-1)^2$ to obtain
$a^6-2a^3+1=(a^3-1)^2=(a-1)^2(a^2+a+1)^2$ but you are perhaps asking for a more general method?
Yes, I know you want to avoid using complex numbers and computers but still it may simplify life, because you calculate the complex roots, they come in complex pairs $u\pm iv$ and then $((a-u)^2 + v^2)$ is a factor. But you probably knew this.
A: One may notice that $p(x)=x^4+2x^3+3x^2+2x+1$ is a palyndromic polynomial, hence $\frac{p(x)}{x^2}$ is a polynomial in $z=x+\frac{1}{x}$:
$$ \frac{p(x)}{x^2} = \left(x^2+\frac{1}{x^2}\right)+2z+3 = (z^2-2)+2z+3 = z^2+2z+1 = \color{red}{(z+1)^2} $$
so:
$$ p(x) = x^2\left(x+\frac{1}{x}+1\right)^2 = \color{red}{(1+x+x^2)^2}. $$
