Number Theory
Linear Diophantine equations (ax + by = c)
Integer solutions to ax + by = c: solvable iff gcd(a,b) | c; general solution parameterized by one integer k using the Extended Euclidean algorithm.
0
Contest appearances
100
Practice problems
1–10
Difficulty levels
Drill this topic
Sign in and tell the coach to drill this knowledge point — it picks questions matched to your current level.