FA-14988 / Numerics / Member archive
Egyptian greedy fraction: unit fraction ordering · case 03
The exact egyptian greedy fraction result violates the stated contract at unit fraction ordering.
Case contract
Input [p,q], 0<p<q<=100; return greedy unit fraction denominators whose sum is p/q. Bounds: q<=31.
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 | [15, 3] | [3, 15] | 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 ↗