ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ∥n∥2\|n\|_2 denote the 22-complexity of an even positive integer nn, namely the minimal number of 22's needed to express nn using addition, multiplication, and parentheses.

2-complexity conjecture. For m≥0m\geq0 and r≥1r\geq1,

∥2m⋅6r∥2=m+3r\|2^m\cdot 6^r\|_2=m+3r

and

∥2m⋅10r∥2=m+4r.\|2^m\cdot 10^r\|_2=m+4r.

The conjecture extends the preceding theorem, which proves these equalities only for bounded values of rr and gives partial bounds in two additional cases. The paper explicitly cautions that the claim may fail for large rr, and the supplied text gives no resolution.

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.