ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer n>1n>1, let ∥n∥\|n\| denote its integer complexity, the least number of ones needed to construct nn using addition and multiplication. Then

The 1439 extremal conjecture. For all n>1n>1, one has

∥n∥log⁡n≤26log⁡1439,\frac{\|n\|}{\log n} \leq \frac{26}{\log 1439},

with equality obtained only at n=1439n=1439.

The statement is presented as the obvious conjecture for primes other than 22 or 33, but the source explicitly notes that it is false; the conjecture is therefore refuted.

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.