On a conjecture of Erdos about sets without k pairwise coprime integers

Abstract

Let Z+ be the set of positive integers. Let Ck denote all subsets of Z+ such that neither of them contains k + 1 pairwise coprime integers and Ck(n)=Ck \1,2,…,n\. Let f(n, k) = maxA ∈ Ck(n)|A|, where |A| denotes the number of elements of the set A. Let Ek(n) be the set of positive integers not exceeding n which are divisible by at least one of the primes p1, …, pk, where pi denote the ith prime number. In 1962, Erdos conjectured that f(n, k) = |E(n,k)| for every n pk. Recently Chen and Zhou proved some results about this conjecture. In this paper we solve an open problem of Chen and Zhou and prove several related results about the conjecture.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…