FA-14890 / Numerics / Member archive
Extended euclidean certificate: gcd sign normalization · case 05
The exact extended euclidean certificate result violates the stated contract at gcd sign normalization.
Case contract
Input [a,b], integers not both zero; return [g,u,v] with g>=0 and a*u+b*v=g using standard Euclidean quotient recurrence. Bounds: |a|,|b|<=1000000.
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 | [4, 1, -1] | [4, -1, 1] | 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 ↗