FA-14368 / Numerics / Member archive
Linear congruence solutions: solvability · case 03
The exact linear congruence solutions result violates the stated contract at solvability.
Case contract
Input [a,b,m], m>0; sorted all x in [0,m) with a*x congruent b modulo m.
Why this case matters
Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| explicit oracle 0 | [] | [0] | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗