The Chinese remainder theorem is a mathematical concept that allows one to determine the remainder of an integer divided by the product of several integers, given the remainders of the division of the integer by each of the individual integers. It was first stated by the Chinese mathematician Sunzi in the 3rd century CE and is widely used for computing with large integers. It is also true over every principal ideal domain and has been generalized to any ring.
UC Berkeley
Fall 2022
CS 70 presents key ideas from discrete mathematics and probability theory with emphasis on their application in Electrical Engineering and Computer Sciences. It addresses a variety of topics such as logic, induction, modular arithmetic, and probability. Sophomore mathematical maturity and programming experience equivalent to an Advanced Placement Computer Science A exam are prerequisites.
No concepts data
+ 32 more concepts