Skip to content

Erdős problem 481

Let a1,…,ar,b1,…,br∈Na_1,\ldots,a_r,b_1,\ldots,b_r\in \mathbb{N} such that ∑i1ai>1\sum_{i}\frac{1}{a_i}>1. For any finite sequence of nn (not necessarily distinct) integers A=(x1,…,xn)A=(x_1,\ldots,x_n) let T(A)T(A) denote the sequence of length rnrn given by (aixj+bi)1≤j≤n,1≤i≤r.(a_ix_j+b_i)_{1\leq j\leq n, 1\leq i\leq r}. Prove that, if A1=(1)A_1=(1) and Ai+1=T(Ai)A_{i+1}=T(A_i), then there must be some AkA_k with repeated elements.

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.