Discrete Math: Congruence Problem

Please provide a detailed solution to the following problem:

Let p be an odd prime and a such that (a, p) = 1. Show that the equation

x^2 = a (mod p^i)

has a solution for all i if it has a solution for i = 1. How many solutions are there?

© SolutionLibrary Inc. solutionlibary.com 9836dcf9d7 https://solutionlibrary.com/math/discrete-math/discrete-math-congruence-problem-7gps