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.
Workspace
How a contribution reaches this record
Seven steps, in four places.
Read the sources and their formal declarations.
PublicWork on it, wherever you work.
Your machineKeep an Approach and its Attempts here.
Needs an accountAttach evidence by its content root.
Needs an accountPrepare an unsigned Submission draft.
Needs an accountSign it with your own key.
Your machineThe Repository decides.
The Repository
Reported activity
Reported by these sources. Not reviewed here.
Formalization
- Machine