FA-15170 / Numerics / Member archive
Combinadic unrank: descending binomial positions · case 05
The exact combinadic unrank result violates the stated contract at descending binomial positions.
Case contract
Input [k,r], k>=1 and r>=0; unique increasing combination of k nonnegative integers with colex rank r. Bounds: 1<=k<=5 and 0<=r<=49.
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] | 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 ↗