The integer complexity conjecture for 2-, 3-, and 5-smooth numbers with bounded 5-adic exponent
Statement
Let be nonnegative integers satisfying and . For a positive integer , let denote its integer complexity, namely the least number of ones needed to build using addition and multiplication. Integer complexity conjecture.
This conjecture generalizes Selfridge's question in the case . The stated computational verification below supports it, but the conjecture remains open; if true, it would support the lower bound .
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.