|
Henk Karssenberg on Fri, 25 Nov 2005 12:13:35 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Dear
M.,
In PARI
I try to calculate k = Mod(6682632708227277^28345232917,
72057594037927889) but this gives an overflow. Is there any option to calculate
Mod(a^m,n) or a^m % n with huge numbers ?
Thank you & kind regards.
henk.karssenberg@hu.nl
Kind regards/Met vriendelijke
groeten,
Henk Karssenberg
studieadviseur bovenbouw
Informatica
course leader international class
Software Engineering
lecturer
Cryptography
Hogeschool van Utrecht/University of
Professional Education
Nijenoord 1, (room 07.10)
3552 AS UTRECHT
Netherlands
tel. (0031)
(0)30 2308259