English

A Cameron and Erd\"os conjecture on counting primitive sets

Number Theory 2017-11-23 v1

Abstract

Let f(n)f(n) count the number of subsets of {1,...,n}\{1,...,n\} without an element dividing another. In this paper I show that f(n)f(n) grows like the nn-th power of some real number, in the sense that limnf(n)1/n\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.

Keywords

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}
}
R2 v1 2026-06-22T22:53:29.909Z