Help with exponential congruence equation .

Revision en1, by Badry, 2017-06-17 01:15:46

Hi Codeforces, I want to know if there is an efficient way to solve a^(x) = b mod(m) where x is the unknown value and m is some prime <=10^9 thanks in advance.

Tags number theory


  Rev. Lang. By When Δ Comment
en1 English Badry 2017-06-17 01:15:46 205 Initial revision (published)