ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ∥n∥\|n\| denote the smallest number of ones needed to write the positive integer nn using addition and multiplication. For integers k,ℓ≥0k,\ell\geq 0, with kk and ℓ\ell not both equal to 00, the integer under consideration is 2k3ℓ2^k3^\ell. Integer-complexity conjecture.

∥2k3ℓ∥=2k+3ℓ.\|2^k3^\ell\|=2k+3\ell.

This combines the known equality ∥3ℓ∥=3ℓ\|3^\ell\|=3\ell for ℓ≥1\ell\geq 1 with the conjectured equality ∥2k∥=2k\|2^k\|=2k for k≥1k\geq 1. The claim was verified in the paper for k≤48k\leq 48 and arbitrary ℓ\ell, excluding k=ℓ=0k=\ell=0, but remains open in general.

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.