# Computing square roots modulo prime powers

I'm writing a program that will do this. I was looking on Wikipedia for methods to do this and I got this sentence: "If the modulus $n$ is a prime power $n^{pe}$, a solution may be found ( $\mod p$) and "lifted" to a solution ( $\mod n$) using Hensel's lemma or an algorithm of Gauss.[8]" ([8] Gauss, DA, art. 101)