Erdős Problem #121 — Avoiding an odd number of factors with square product
For positive integers and , let be the maximum cardinality of a set such that no distinct elements of have a product that is a square. Thus the forbidden product uses distinct elements, and “square” means a perfect square of an integer. For each fixed odd integer , the question is whether
equivalently, whether . The case is included; the general question asks this for every fixed odd . Tao (2025)
Background
Erdős, Sárközy, and Sós initiated the systematic study of these extremal quantities and conjectured that the near-full-density behavior for odd continues beyond . They proved and , and obtained asymptotics for even . Earlier, Erdős had shown , using the fact that any subset of of size much larger than contains a nontrivial solution of . Erdős Problems #121 Tao (2025)
A related problem asks for the largest set containing no odd number of distinct elements whose product is a square. Its extremal function has an asymptotic density strictly below , established by Granville and Soundararajan; this is a different condition from forbidding one specified odd number of factors. In particular, a result for that broader prohibition does not by itself give an upper bound on : a set avoiding every odd number of factors also avoids factors, so its maximum size is at most . Erdős Problems #121 Tao (2025)
References
T. Tao, On product representations of squares, arXiv:2405.11610 (2024).
Source: T. Tao, On product representations of squares, arXiv:2405.11610 (2024).
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.