How to solve bigmod where range of n,p,m where (n,p,m)<=10^18

Asked Apr 24 '17 at 17:00

Active Apr 24 '17 at 17:00

Viewed 15 times

I can solve bigmod if range of m is <=10^9. But if range more than this range my procedure overflows. How can i solve (n^p)%m where (n,m,p)<=10^18

asked Apr 24 '17 at 17:00

a_rahman

which programming languange do you use? what did you do to solve bigmod if range is <= 10^9? – Evgeny Veretennikov Apr 24 '17 at 17:35
c,c++ . I use recursion to solve bigmod. – a_rahman Apr 30 '17 at 04:38

0 Answers0