Erdős Problem #1196: a 1968 conjecture on primitive sets.
Resolution reported — pending verification
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Assessment
Renown 2/5
Erdos Problem #1196 (1968), primitive sets; known to Erdos-problem hunters.
Attackability 2/5
An asymptotic-bound statement without a finite counterexample witness; proof territory.
- finite witness
- 1/5
- oracle cost
- 2/5
- freshness
- 2/5
- seedability
- 2/5
Reported resolution
proof by See tracker link (pending primary source) on .
Per the community tracker: resolved with a sharp asymptotic bound; checked, extended, and formalized in Lean. 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.