Chinese Remainder Theorem

Nedanstående innehåll är skapat av Mimers Brunns besökare. Kommentera arbete

Chinese Remainder Theorem is used to solving problems in computing, coding and cryptography. In computing we can compute with shorter numbers instead of large numbers and this will make the computing-process faster and easier. In coding it can be used for error-searching and error-regulating. Cryptography means that we can send a coded message and that no one will be able to read it without the decode-key which is based on prim-numbers. I am writing about the history of mathematics and how the number- and decimal number-system is used in Babylon, Egypt, Greece and in China. Abacus was a very important aid to calculate advanced mathematical problems. Someone who knows how to use the Abacus can calculate faster than the calculator. Writing in cipher code was a very interesting subject a thousand years ago and it is still used even in modern time. To this day there are still some secrets, written in cipher code, that no one has been able to decode yet. A message which is coded with a public key, which is based on Chinese Remainder Theorem, is virtually impossible to solve without the private key which is based on prime numbers. If the First World War was the chemists war (chlorine gas used) and if the Second World War was the physicist war (atomic bombs used), that would suggest that the Third World War will be the mathematicians?s war, because they master the new weapon which is called information. It is the mathematicians ...