Chinese Remainder Theorem - Maple Application Center

Chinese Remainder Theorem - Maple Application Center

Contact Maplesoft Request Quote

Submit your work

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

Share

Copy URL

This app is not in any Collections

More Like This

Prime Number ASCII Art

Maplesoft Author Dr. John May

Fixed Point Iteration

Prof. Josef Betten

Speed-up calculation of nextprime

Giulio Bonfissuto

Number Theory Integer Types

Pascal's triangle and its relationship to the Fibonacci sequence

Maplesoft Author Maplesoft

Sn1b Primes

Czeslaw Koscielny

Car Talk Puzzler

Maplesoft Author Dr. Robert Lopez

Psedudoprimes

Hollywood Math 2

Maplesoft Author Maplesoft

Fermat's Little Theorem

Euclid's algorithm for computing greatest common divisors, with a modern improvement

Michael Monagan

Number of iterations in Collatz's problem

Michael Monagan