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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:6b256e1ed889b2bad0b14163f9c5b0eebf683325614f52fe0eaa496787270b97
Metadata
sha256:413caaba351fd4434554729f3d8f589a12a93bf88ddc24ffdc017647d0a3798f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:dd0f713bc413af51ba4b2e6fe85beaf6f713723e5792a28fd3f09122d585a93d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb