Auil's conjecture that the iterative sequence enumerates the Möbius numbers
Statement
Let be the set of integers produced by the paper's iterative construction, and let
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:
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.