Weakly consecutive sequence generation conjecture
Statement
A weakly consecutive sequence (WCS) is a permutation of such that if an integer divides , then also divides 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 , the starting sequence and rule applications are unique up to reordering the rules. This has been verified computationally up to , while uniqueness is false for ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.