FA-15317 / Numerics / Member archive
Involution permutations: complete assignment terminal · case 02
The exact involution permutations result violates the stated contract at complete assignment terminal.
Case contract
Input 0<=n<=7; return lexicographically sorted permutations p of 0..n-1 satisfying p[p[i]]=i.
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 | [[0, -1], [1, 0]] | [[0, 1], [1, 0]] | 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 ↗