hi, Here is a query frm my friend- I wondered if anyone knows a solution for my problem... x mod m = a x mod n = b Let's say i choose small number... m=5 n=3 a=3 b=1 then it's x mod 5 = 3 x mod 3 = 1 after trying a but you will now that x=13 but how can i solve it easier than trying all kinds of number. I mean a non-trivial solution. I think the effort gets too huge for larger numbers like: x mod 739631974298624487 = 403861151213590046; x mod 898793745643687546 = 206683840814855797; x=37658765832565679345651 And I want to use it at least with 128bit numbers. what would be a non-trivial method of solving x in the above example. Thank u Regards Data _________________________________________________ __________________________________________________ Do You Yahoo!? Yahoo! Games - play chess, backgammon, pool and more http://games.yahoo.com/
