ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K={ki}i∈N\mathbb K=\{k_i\}_{i\in\mathbb N} be the set of integers produced by the paper's iterative construction, and let

M={m∈N:μ(m)≠0}\mathbb M=\{m\in\mathbb N:\mu(m)\neq0\}

be the set of square-free, or Möbius, numbers. Auil's enumeration conjecture. The iterative construction produces every Möbius number and no others:

K=M.\mathbb K=\mathbb M.

The initial terms displayed in the source agree with the square-free numbers, and numerical evidence is reported in support of the conjecture. Its general validity remains unresolved.

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.