ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ∥n∥\|n\| denote the complexity of a natural number, and let p,qp,q be natural numbers. Product complexity conjecture. For each pair of natural numbers pp and qq, there exists a≥0a\ge0 such that, for j≥aj\ge a,

∥p(q3j+1)∥=3j+1+∥p∥+∥q∥.\|p(q3^j+1)\|=3j+1+\|p\|+\|q\|.

This is an eventual exact formula for a family of products whose complexity is studied through the tables in the paper; its status is based on observed cases only.

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.