FA-5534 / Number theory / Member archive

Trailing factorial zeroes · case 04

Only one factor of five per multiple is counted.

Member previewVariant 4 · 3 implementations · 4 checks per implementation

Case contract

Integer inputs; n is positive unless a zero or negative fixture explicitly extends that operation. A modulus is greater than one; p is prime; exponent k may be signed when an inverse exists. n>=0. Return the number of trailing base-ten zero digits in n!. Exact operational definition: sum(n//(5**i) for i in range(1,n.bit_length()+1))

Why this case matters

Small exact fixtures expose this error without platform timing, external services, or probabilistic observations. Number theory 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 3: (25,)	`5`	`6`	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.