Explore BrainMass
Share

Explore BrainMass

    Congruence proof

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    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?

    © BrainMass Inc. brainmass.com October 9, 2019, 11:09 pm ad1c9bdddf
    https://brainmass.com/math/discrete-math/discrete-math-congruence-problem-246588

    Solution Summary

    This provides a proof for a given congruence problem.

    $2.19