Question regarding solving polynomial of congruence? In my textbook, they said:
$$2x^{3} + 7x - 4 \equiv 0 \pmod{5}$$
The solution of this equation are the integers with $x \equiv 1 \pmod{5}$, as can be seen by testing $x = 0, 1, 2, 3,$ and $4.$
And I have no clue how do they had $x \equiv 1 \pmod{5}$. I tested as they suggested:
Let $y = 2x^{3} + 7x - 4$, we have:
$$x = 0: y = -4, \implies y \equiv 1 \pmod{5}$$
$$x = 1: y = 5, \implies y \equiv 0 \pmod{5}$$
$$x = 2: y = 26, \implies y \equiv 1 \pmod{5}$$
$$x = 3: y = 71, \implies y \equiv 1 \pmod{5}$$
$$x = 4: y = 152, \implies y \equiv 2 \pmod{5}$$
What I did not understand is how these five modulo equations become $x \equiv 1 \pmod{5}$? Can anyone help me explain this?  
Thanks, 

Any integer is going to be congruent to one of $0,1,2,3,4$ modulo $5$. As the testing shows, only those integers which are congruent to $1$ modulo $5$ are solutions, and any integer congruent to $1$ mod $5$ is a solution.
Those tests are using an arbitrary $x$ each time, so you shouldn't think of them as a system of congruences of a single variable $x$ but instead they imply the result described above.

Here's another thing to add which may help. Don't just check $0,1,2,3,4$. Take $x$ to be any arbitrary integer, not necessarily one of those just listed. So like I said before, this arbitrary $x$ is congruent to one of $0,1,2,3,4$ since they form a complete residue system. If $x\equiv 0\pmod{5}$, then
$$
2x^3+7x-4\equiv 2(0)^3+7(0)-4\equiv -4\equiv 1\pmod{5}
$$
so $x$ is not a solution. Likewise if $x\equiv 2,3,4\pmod{5}$. So the only choice which works is when $x\equiv 1\pmod{5}$. Hopefully that's clearer?
