The exact integer complexity conjecture for powers of 2 and 3
Statement
Let denote the least number of ones needed to write the positive integer using addition, multiplication, and parentheses. For integers with , consider the integer . Exact integer complexity conjecture. For all and all with , one has
This asserts that the standard factorization gives an optimal expression for every positive integer composed only of the primes and . The statement was supported by the exact results for several ranges of and by computational verification up to , but its general status is open.
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.