Sorry if this question is lame. First post!
I was going through this book
Abstract Algebra Theory and Applications Thomas W. Judson Stephen F. Austin State University
In the Chapter 16. Ring Theory the author explains about how Chinese Remainder Theorem can be used to schedule work to Multi-Processor systems in case of Large Integer Calculations.
In a particular example of calculating 2134*1531. He broke it down to this:
x≡ 9 (mod 95)
x≡ 0 (mod 97)
x≡ 30 (mod 98)
x≡ 55 (mod 99)
The result should be 3,267,154. I used two online calculators Calc 1 and Calc 2 and to solve this. Both are giving different and wrong answers 2774788984 and 111543404 respectively. Is there a short and easy way to calculate this?. What is wrong with those calculators?
Thanks in advance.