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 is a prime power , a solution may be found ( ) and "lifted" to a solution ( ) using Hensel's lemma or an algorithm of Gauss." ( Gauss, DA, art. 101)
Does anyone know what algorithm of Gauss they are referring to? I don't have the book. Thanks.