Erdős Problem #390: the second-order constant for f(n)-2n
Statement
Let be the least for which can be written as with - the smallest possible largest factor in a factorization of into distinct integers all exceeding . Erdős, Guy and Selfridge proved . Erdős asked whether there is a constant with and what it is.
This preprint answers yes and names the constant:
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.