Pith. sign in

REVIEW 1 cited by

On a conjecture of ErdH{o}s about sets without k pairwise coprime integers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.05730 v1 pith:Y5TMX7RA submitted 2017-05-16 math.NT

On a conjecture of ErdH{o}s about sets without k pairwise coprime integers

classification math.NT
keywords integersconjecturechencoprimedenotemathbbnumberpairwise
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) = \text{max}_{A \in C_{k}(n)}|A|$, where $|A|$ denotes the number of elements of the set $A$. Let $E_k(n)$ be the set of positive integers not exceeding $n$ which are divisible by at least one of the primes $p_{1}, \dots{}, p_{k}$, where $p_{i}$ denote the $i$th prime number. In 1962, Erd\H{o}s conjectured that $f(n, k) = |E(n,k)|$ for every $n \ge p_{k}$. 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Prime Certificates for Exact Vertex-Coprime Ramsey Numbers

    math.CO 2026-05 unverdicted novelty 7.0

    The vertex-coloring coprime Ramsey number R_cop(k1,...,kc) equals the prime p indexed by sum(ki-1).