Erdős Problem #896
Statement
Estimate the maximum of as range over all subsets of , where counts the number of such that has exactly one solution (with and ).
Record
- Source
- Added
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.