ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ∥n∥\|n\| denote the least number of ones needed to write the positive integer nn using addition, multiplication, and parentheses. For integers a,k≥0a,k\geq 0 with a+k≥1a+k\geq 1, consider the integer 2a⋅3k2^a\cdot 3^k. Exact integer complexity conjecture. For all a≥0a\geq 0 and all k≥0k\geq 0 with a+k≥1a+k\geq 1, one has

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

This asserts that the standard factorization gives an optimal expression for every positive integer composed only of the primes 22 and 33. The statement was supported by the exact results for several ranges of aa and by computational verification up to 101210^{12}, 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 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.