ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ∥n∥\|n\| denote the integer complexity of a positive integer nn, namely the minimal number of 11's needed to express nn using addition, multiplication, and parentheses.

Integer-complexity conjecture. For a≥1a\geq 1 and b≥0b\geq 0,

∥2a⋅3b∥=2a+3b.\|2^a\cdot 3^b\|=2a+3b.

This conjecture incorporates Selfridge's question of whether some power of 22 has complexity less than 2a2a. It asserts that products of powers of 22 and 33 attain the expected complexity, but the supplied text does not indicate whether the conjecture has been resolved.

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.