FA-15269 / Numerics / Member archive
Integer partition enumeration: partition candidate order · case 04
The exact integer partition enumeration result violates the stated contract at partition candidate order.
Case contract
Input [n,L], n>=0 and L>=1; return partitions of n in descending part order, reverse lexicographic, each part<=L.
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, 1], [2]] | [[2], [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 ↗