Math -> Chinese Remainder And Linear Congruences

Congruence systems, gcd-consistent residue merges, and the extended-Euclid doorway from linear congruences to one merged class modulo lcm.

• Topic slug: math/chinese-remainder
• Tutorial page: Open tutorial
• Ladder page: Open ladder
• Repo problems currently tagged here: 1
• Repo companion pages: 3
• Curated external problems: 2

Microtopics

• crt-merge
• non-coprime-moduli
• gcd-consistency
• linear-congruence
• bezout-inverse
• lcm-reconstruction

Learning Sources

Source	Type
cp-algorithms Chinese remainder theorem	Reference
cp-algorithms linear congruence equation	Reference
Competitive Programmer's Handbook	Reference

Practice Sources

Source	Type
Kattis General Chinese Remainder	Practice
Library Checker System of Linear Congruence	Practice

Repo Companion Material

Material	Type
Chinese Remainder hot sheet	quick reference
General Chinese Remainder	flagship note
Template Library exact starter route	starter route

Curated External Problems

Core

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
General Chinese Remainder	Kattis	Medium	Congruence Systems	Math; Implementation	GCD; Extended Euclid; Modular Arithmetic	Chinese Remainder Theorem; Extended Euclid; Non-Coprime Moduli	The cleanest first rep for non-coprime congruence merges with an explicit no-solution branch.

Stretch

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
System of Linear Congruence	Library Checker	Medium	Congruence Systems	Math; Implementation	Extended Euclid; Congruence Merging	Chinese Remainder Theorem; Linear Congruence; Extended Euclid	A direct benchmark for solving and merging full congruence systems after the two-modulus route is trusted.

Repo Problems

Code	Title	Fit	Difficulty	Pattern	Note	Solution
GENERALCHINESEREMAINDER	Chinese Remainder Theorem (non-relatively prime moduli)	primary	medium	-	Note	Code

Regeneration

python3 scripts/generate_problem_catalog.py