Erdős problem 848
Is the maximum size of a set such that is never squarefree (for all ) achieved by taking those ? Resolved for all sufficiently large : any near-maximal is contained in or , leaving only a finite check.
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:2fa445056c2d4a234dc3bff5995b5aa1c1553a3e0a0bfc42fbb8d20a55b8168f
- Metadata
- sha256:74742a4acd69c2a442e20d680c1a72414af8b0537813577d08af15b6f21d2fba
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:c0314562283e1d8879c504d6261ca6224701eaaad20484faef01b619f5afa77e
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb