Erdős Problem #305 — Largest denominator needed for a rational Egyptian fraction
Statement
For integers , let be the least possible largest denominator in a representation of as a sum of distinct unit fractions, and let . Is as ?
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.