$
$u!fur
hi all. ..i know how to calculate the sum of divisors of a number as
well know how to calculate a^b mod n;
but here question is to calculate S % mod n where S = is the sum of
divisors of a ^ b.
a and b are very large...but can fit in int range..but its
multiplication can not fit...
give me a nice algo..i m stuck frm past 6 hrs...!!!
well know how to calculate a^b mod n;
but here question is to calculate S % mod n where S = is the sum of
divisors of a ^ b.
a and b are very large...but can fit in int range..but its
multiplication can not fit...
give me a nice algo..i m stuck frm past 6 hrs...!!!