FA-5689 / Combinatorics / Member archive

Multinomial word count · case 04

Repeated symbols are treated as separately labelled.

Member previewVariant 4 · 3 implementations · 4 checks per implementation

Case contract

Nonnegative integer counts. Permutation and combination counts are zero when a requested selection exceeds the available objects. Shape sizes satisfy the preconditions stated below. counts is a list of nonnegative multiplicities of distinct symbols; count distinct words with exactly those multiplicities. Exact operational definition: math.factorial(sum(counts))//math.prod(math.factorial(c) for c in counts)

Why this case matters

Small exact fixtures expose this error without platform timing, external services, or probabilistic observations. Combinatorics results depend on the stated convention.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
fixture 1: ([2, 1],)	`6`	`3`	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.