Erdős Problem #121 — Avoiding an odd number of factors with square product
Statement
Let be the largest size of a subset containing no distinct elements whose product is a square. For odd , is ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.