ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,b,ca,b,c be nonnegative integers satisfying a+b+c>0a+b+c>0 and c<6c<6. For a positive integer nn, let ∥n∥\|n\| denote its integer complexity, namely the least number of ones needed to build nn using addition and multiplication. Integer complexity conjecture.

∥2a3b5c∥=2a+3b+5c.\|2^a3^b5^c\|=2a+3b+5c.

This conjecture generalizes Selfridge's question in the case c=0c=0. The stated computational verification below 101210^{12} supports it, but the conjecture remains open; if true, it would support the lower bound lim sup⁡n→∞∥n∥/log⁡n≥2/log⁡2\limsup_{n\to\infty}\|n\|/\log n\geq 2/\log 2.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.