Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Cameron and Erdös conjecture on counting primitive sets

Published 22 Nov 2017 in math.NT | (1711.08107v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.