Erdős Problem #534 — Largest pairwise non-coprime family containing its endpoint
For a positive integer , let . Determine the maximum cardinality of a set satisfying
For the maximum is , attained by ; for this is the endpoint-containing pairwise non-coprime family problem. Erdős Problem #534
Background
Erdős and Graham posed the endpoint problem in their work on combinatorial number theory; Erdős revisited it in his 1980 survey. An initial conjecture proposed that the maximum was one of two natural quantities, but Ahlswede and Khachatrian found a counterexample and informed Erdős in 1992. Erdős then proposed a more refined formula, indexed by the initial segments of the prime factors of . Ahlswede–Khachatrian (1996) Erdős (1980)
References
P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.