A mapping that is amusingly called the Ruritanian exists when re-indexed data generated from this result is used in the Good-Thomas version of the Fast Fourier Transform.
A mapping that is amusingly called the Ruritanian exists when re-indexed data generated from this result is used in the Good-Thomas version of the Fast Fourier Transform. A corollary to this result states that for a collection of positive integers, and an integer k, a ring isomorphism exists over the ring of integers defined by k. This theorem forms the basis of quickly computing a public key in multiword cryptography. (*) Diophantine equations that can be solved using Euclid's algorithm may be equivalently solved by use of this result. One of the requirements for this theorem is that all of the moduli be pairwise coprime. This theorem guarantees the existence of a solution to a system of linear congruences. For 10 points, name this theorem first proved by Sun Tzu.
A mapping that is amusingly called the Ruritanian exists when re-indexed data generated from this result is used in the Good-Thomas version of the Fast Fourier Transform.
Chinese Remainder Theorem