The Erdos conjecture for primitive sets — mentioned by dragon96

Tue, 07 Jun 2022 00:16:33 GMT

For anyone interested in a more technical summary of the some of the main ideas: Problem Statement The Erdos conjecture that all primitive sets S satisfy f(S) <= f(PRIMES), where f(S) = sum_{s} (1/(s log s)) and PRIMES is the set of all primes. Definitions Define A_q to be a primitive set such that all elements a are divisible by prime q, but no primes less than q. * Example: A_3 contains multiples of 3, but no even numbers. Define A*_q to be the set of all integers divisible by only primes >= q. * Example: A_q is a subset of A*_q. * Example: A_q is also a subset of q \* A*_q (i.e. multiply…

Paper and discussion history. A mention is not an endorsement.

The Erdos conjecture for primitive sets · HackerPapers discussions

The Erdos conjecture for primitive sets — mentioned by dragon96