ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A weakly consecutive sequence (WCS) is a permutation σ\sigma of {1,…,k}\{1,\ldots,k\} such that if an integer dd divides σ(i)\sigma(i), then dd also divides σ(i±d)\sigma(i\pm d) wherever these terms are defined. The paper specifies four starting sequences and three rules for generating WCSs. Weakly consecutive sequence generation conjecture. Any WCS can be derived from one of the four starting sequences by applying the three rules. Moreover, for k≥12k\geq 12, the starting sequence and rule applications are unique up to reordering the rules. This has been verified computationally up to k=500k=500, while uniqueness is false for k≤11k\leq 11; the asserted sufficiency of the starting sequences and rules remains unproved.

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.