{"paper":{"title":"A Cameron and Erd\\\"os conjecture on counting primitive sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rodrigo Angelo","submitted_at":"2017-11-22T02:10:32Z","abstract_excerpt":"Let $f(n)$ count the number of subsets of $\\{1,...,n\\}$ without an element dividing another. In this paper I show that $f(n)$ grows like the $n$-th power of some real number, in the sense that $\\lim_{n\\rightarrow \\infty}f(n)^{1/n}$ exists. This confirms a conjecture of Cameron and Erd\\\"os, proposed in a paper where they studied a number of similar problems, including the well known \"Cameron-Erd\\\"os os Conjecture\" on counting sum-free subsets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08107","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}