Chinese Remainder Theorem - Maple Application Center
Application Center Applications Chinese Remainder Theorem

Chinese Remainder Theorem

Author
: Roland Engdahl
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!

Let m[1],m[2],...,m[n] be pairwise relatively prime integers

 Then the simultaneous congruence

x = r[1] mod m[1]

...

x = r[n] mod m[n]

has a unique solution modulo the product m[1].m[2]- -.-. .m[n]

Application Details

Publish Date: November 24, 2010
Created In: Maple 13
Language: English

More Like This

Fixed Point Iteration
Speed-up calculation of nextprime
Number Theory Integer Types
Pascal's triangle and its relationship to the Fibonacci sequence
Fermat's Little Theorem
Integer Partition Tools
Euclid's algorithm for computing greatest common divisors, with a modern improvement
First Digit Simulation