finding a solution for 2^x = c mod 10^9+7

Правка en1, от hiddentesla, 2017-05-27 16:02:30

problem:

given at most 400 values of C. for each C,find an integer X (X<=10^18) such that 2^x mod (10^9 + 7) = c

i know that a value x must exist (X<10^9 + 7).but finding X is a problem for me. is there an efficient way to find x?

Теги numbertheory, modular arithmetic

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский hiddentesla 2017-05-27 16:02:30 277 Initial revision (published)