The integer-complexity conjecture for powers of 2 and 3
Statement
Let denote the integer complexity of a positive integer , namely the minimal number of 's needed to express using addition, multiplication, and parentheses.
Integer-complexity conjecture. For and ,
This conjecture incorporates Selfridge's question of whether some power of has complexity less than . It asserts that products of powers of and attain the expected complexity, but the supplied text does not indicate whether the conjecture has been resolved.
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.