The 2-complexity conjecture for powers of 6 and 10
Statement
Let denote the -complexity of an even positive integer , namely the minimal number of 's needed to express using addition, multiplication, and parentheses.
2-complexity conjecture. For and ,
and
The conjecture extends the preceding theorem, which proves these equalities only for bounded values of and gives partial bounds in two additional cases. The paper explicitly cautions that the claim may fail for large , and the supplied text gives no resolution.
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.