ever heard of the Chinese remainder theorem ! give it read.

the whole process is too large to explain but i will sure give the solution.

247 = 13 * 19 .clearly 13 and 19 are coprime.

let N = 25^625 + 26 it can be proved easily that :

(i)N = 12 mod(13)................

(ii) N = 11 mod(19)................

now find a number u such that 19u = 1 mod(13) => u = 11 also,find a number v such that 13v = 1 mod(19) => v = 3

now, let r = 12*(19*11) + 11*(13*3) = 2937

NOW, it can be proved that the value of N that satisfies (i) and (ii) will also satisy N = r mod(13*19) now N = 220 mod(247)

HENCE THE REMAINDER IS 220. tada ! If anyone is at all interested in number theory then there is an free book on GOOGLE BOOKS called "The elements of the theory of algebraic numbers". The general process is given on page 72. </blockquote>

well i think you application of CRM here is not proper as we are looking for reminders and not the number....

what you say RAJORSHI...

I know its coming.....and I know i can handle it the best....