Solve Modular Arithmetic

Solve modular arithmetic problems including congruences, systems via the Chinese Remainder Theorem, modular inverses, and Euler's theorem applications. Covers both manual and computational approaches. Use when solving linear congruences, computing modular inverses, evaluating large modular exponentiations, working with simultaneous congruences (CRT), or operating in cyclic groups and discrete logarithm contexts.

pjt222 Updated 44 repo stars

File contents

pjt222/agent-almanac commit f91d30b451

Frequently asked questions

npx get-skill add pjt222/solve-modular-arithmetic-9