(adsbygoogle = window.adsbygoogle || []).push({}); Chinese Remainder Theorem!!!

I'm pretty sure that the following is in fact the Chinese remainder Theorem:

If n= (m1)(m2)...(mk) [basically, product of m's (k of them)]

where each m is relatively prime in pairs, then there is an isomorphism from Zn to ( Zm1 X Zm2 X ... X Zmk). Zn is the integers modulo n.

All the proofs of the chinese remainder theorem I found searching online, are either the ones that focus on modulo, or focus more on ideals (and proving a certain mapping is an isomorphism). How do I go about proving the statement up there?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Chinese Remainder Theorem

Loading...

Similar Threads - Chinese Remainder Theorem | Date |
---|---|

Generalization of Chinese Remainder Theorem | Apr 1, 2013 |

Find and Test Primes using the Chinese Remainder Theorem and Binary Search | Sep 20, 2010 |

Chinese Remainder Theorem, Solving For Multiplicative Inverses | Mar 10, 2010 |

Chinese remainder theorem (Gaussian ints) | Nov 23, 2009 |

The Chinese Remainder Theorem for moduli that aren't relatively prime | Nov 22, 2009 |

**Physics Forums - The Fusion of Science and Community**