Help with exponential congruence equation .

Правка en1, от 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.

Теги number theory

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Badry 2017-06-17 01:15:46 205 Initial revision (published)