Solution Found!
Give a polynomial-time algorithm for computing abcmod p, given a, b, c, and prime p
Chapter 1, Problem 1.39(choose chapter or problem)
QUESTION:
Give a polynomial-time algorithm for computing abcmod p, given a, b, c, and prime p.
Questions & Answers
QUESTION:
Give a polynomial-time algorithm for computing abcmod p, given a, b, c, and prime p.
ANSWER:Step 1 of 2
According to fermat’s little theorem and 1 is equal to and if is equal to 0 then . Instead of 0 put so , therefore the is equal to .