by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)
(II)\nSimilar to the solution posted above for (I), we can break this up into two parts, 333+77mod4 and 333+77mod25 .\n\n 333+77mod4≡(−1)33+1mod4≡−1+1mod4≡0mod4 .\nUsing Euler's Totient Theorem, 320≡1mod25 . It is easy to see that 33≡2mod25 as well.\n\nWe can now write the second equation as (320)(33)4(31)+77mod25≡(1)(2)4(3)+77mod25≡48+77mod25≡125mod25≡0mod25.\n\nBecause this is congruent to 0 mod 25 and 4, it is congruent to 0 mod 100.