ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture Define a 2×n2 \times n array of positive integers where the first row consists of some distinct positive integers arranged in increasing order, and the second row consists of any positive integers in any order. Create a new array where the first row consists of all the integers that occur in the first array, arranged in increasing order, and the second row consists of their multiplicities. Repeat the process. For example, starting with the array [1;1][1; 1], the sequence is: [1;1][1; 1]-> [1;2][1; 2]-> [1,2;1,1][1, 2; 1, 1]-> [1,2;3,1][1, 2; 3, 1]-> [1,2,3;2,1,1][1, 2, 3; 2, 1, 1]-> [1,2,3;3,2,1][1, 2, 3; 3, 2, 1]-> [1,2,3;2,2,2][1, 2, 3; 2, 2, 2]-> [1,2,3;1,4,1][1, 2, 3; 1, 4, 1]-> [1,2,3,4;3,1,1,1][1, 2, 3, 4; 3, 1, 1, 1]-> [1,2,3,4;4,1,2,1][1, 2, 3, 4; 4, 1, 2, 1]-> [1,2,3,4;3,2,1,2][1, 2, 3, 4; 3, 2, 1, 2]-> [1,2,3,4;2,3,2,1][1, 2, 3, 4; 2, 3, 2, 1], and we now have a fixed point (loop of one array).

The process always results in a loop of 1, 2, or 3 arrays.

Record

Added
Links

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.