Erdős Problem #728: a factorial-divisibility problem (resolved after clarifying an ambiguous formulation).
Resolution reported — pending verification
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Assessment
Renown 2/5
Erdos Problem #728, factorial divisibility.
Attackability 2/5
Partially witnessable per-instance, but the resolved form was a general proof after clarifying the statement.
- finite witness
- 3/5
- oracle cost
- 3/5
- freshness
- 2/5
- seedability
- 1/5
Reported resolution
proof by See tracker link (pending primary source) on .
Per the community tracker: resolves the intended nontrivial problem; important but specialized. Primary reference attached.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.