Problemcore
Modular linear equation
Given a, b and n, find all integers x with a x congruent to b modulo n, or decide none exist.
Given a, b and n, find all integers x with a x congruent to b modulo n, or decide none exist.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 9A70GQ Edit this page History Report an error