The 1439 extremal conjecture for integer complexity
Statement
For each integer , let denote its integer complexity, the least number of ones needed to construct using addition and multiplication. Then
The 1439 extremal conjecture. For all , one has
with equality obtained only at .
The statement is presented as the obvious conjecture for primes other than or , but the source explicitly notes that it is false; the conjecture is therefore refuted.
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.