Tag Archives: forbidding divisibility

Another Cameron–Erdős problem solved

In 1990, Paul Erdős and I published a paper on the topic of counting subsets of the first n natural numbers satisfying some restriction. The case we worked hardest on, and which attracted the most interest (it has its own … Continue reading

Posted in doing mathematics, Uncategorized | Tagged , | Leave a comment