A Cameron and Erd\"os conjecture on counting primitive sets
Number Theory
2017-11-23 v1
Abstract
Let count the number of subsets of without an element dividing another. In this paper I show that grows like the -th power of some real number, in the sense that 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.
Cite
@article{arxiv.1711.08107,
title = {A Cameron and Erd\"os conjecture on counting primitive sets},
author = {Rodrigo Angelo},
journal= {arXiv preprint arXiv:1711.08107},
year = {2017}
}