Conjecture on the complexity of products of powers of 2 and 3
Statement
Let denote the smallest number of ones needed to write the positive integer using addition and multiplication. For integers , with and not both equal to , the integer under consideration is . Integer-complexity conjecture.
This combines the known equality for with the conjectured equality for . The claim was verified in the paper for and arbitrary , excluding , but remains open in general.
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.