Find the smallest positive integer $x$ such that $x^2 \equiv 1 \pmod{p^k}$ is NOT sufficient to imply $x \equiv \pm 1 \pmod{p^k}$. For which prime $p$ does $x^2 \equiv 1 \pmod{p^k}$ have more than 2 solutions for $k \geq 2$?