MathDB

Erdős Problem #534 — Largest pairwise non-coprime family containing its endpoint

About 46 years old · traced to

For a positive integer NN, what is the maximum size of a set A⊆1,…,NA⊆{1,…,N} such that N∈AN∈A and gcd⁡(a,b)>1\gcd(a,b)>1 whenever a,b∈Aa,b∈A are distinct?

References

Primary source

P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

Additional references

P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

intersecting-familynumber-theory
InErdős Problems
Posted

Progress summary

Never refreshed

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.