solve-modular-arithmetic

star 21

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 By pjt222 schedule Updated 6/5/2026

Skill instructions (SKILL.md) could not be loaded from local cache or raw GitHub repository.

Install via CLI
npx skills add https://github.com/pjt222/agent-almanac --skill solve-modular-arithmetic
Repository Details
star Stars 21
call_split Forks 2
navigation Branch main
article Path SKILL.md
Occupations
More from Creator