I am trying to implement a program for finding the remainder on division of 2 numbers n2/n1 such that
n1 is of the order of 2^32(having a few digits)
and n2 is the order of 2^65536(having about 20000 digits)
So far I have stored them in an array digit by digit.
How to find the remainder?
Could someone suggest any quick/fast /efficient algorithm or iplementation for the same.