ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r∈Nr\in\mathbb N and let a1,…,ar,b1,…,br∈Na_1,\ldots,a_r,b_1,\ldots,b_r\in\mathbb N satisfy

ai>0(1≤i≤r),∑i=1r1ai>1.a_i>0\quad(1\le i\le r),\qquad \sum_{i=1}^r\frac1{a_i}>1.

For a finite sequence A=(x1,…,xn)A=(x_1,\ldots,x_n), define T(A)T(A) to be the sequence of length rnrn consisting of

(aixj+bi)1≤j≤n, 1≤i≤r.(a_i x_j+b_i)_{1\le j\le n,\ 1\le i\le r}.

Starting with A1=(1)A_1=(1) and recursively setting Ak+1=T(Ak)A_{k+1}=T(A_k), must there exist some kk for which AkA_k contains a repeated element?

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.