Erdős problem 481
Let such that . For any finite sequence of (not necessarily distinct) integers let denote the sequence of length given by Prove that, if and , then there must be some with repeated elements.
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:6b256e1ed889b2bad0b14163f9c5b0eebf683325614f52fe0eaa496787270b97
- Metadata
- sha256:413caaba351fd4434554729f3d8f589a12a93bf88ddc24ffdc017647d0a3798f
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:dd0f713bc413af51ba4b2e6fe85beaf6f713723e5792a28fd3f09122d585a93d
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb