Question

Sometimes, division by 648 is actually multiplication by 12. Answer the following about modular arithmetic, for 10 points each.
[10m] This theorem ensures that for a system of integer congruences each of the form “x is congruent to a-sub-i mod n-sub-i,” there is always an integer solution.
ANSWER: Chinese remainder theorem [accept CRT]
[10h] The Chinese remainder theorem generalizes to rings by replacing the moduli with these sets and coprimality with comaximality. Two of these things are comaximal if 1 can be written as a sum of elements chosen from them.
ANSWER: ideals [accept pairwise comaximal ideals]
[10e] To actually solve a system of integer congruences, one uses repeated division in Euclid’s algorithm for computing this function. Two integers are coprime if this function returns 1 when applied to them.
ANSWER: greatest common divisor [accept greatest common factor or gcd or gcf]
<RA, Other Science: Math>

Back to bonuses

Summary

Data

Berkeley CBerkeley B1001020
Stanford ABerkeley A10101030
McDouble West-CarletonOttawa C001010
Ottawa AOttawa B001010
Toronto Ray of Sun in the SkyWaterloo0101020
ClaremontAuxiliary CLU1001020
Illinois AIndiana10101030
Notre Dame APurdue A10101030
Purdue BIllinois B001010
VanderbiltNotre Dame B0000
Cornell RCornell MATLAB1001020
Chicago AChicago B1001020
RITSyracuse+Rochester10101030
WUSTL H2OSquidward Community College0000
WUSTL XYZMissouri A001010
SIUEMissouri B0000