FA-14769 / Numerics / Member archive
Rational generating recurrence: requested coefficient length · case 04
The exact rational generating recurrence result violates the stated contract at requested coefficient length.
Case contract
Input [P,Q,k] integer ascending arrays with Q[0]=1 and k>=0; return first k coefficients of formal series P/Q.
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 | [-1, -3] | [-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 ↗