Skip to content

Erdős problem 848

Is the maximum size of a set A⊆{1,…,N}A\subseteq \{1,\ldots,N\} such that ab+1ab+1 is never squarefree (for all a,b∈Aa,b\in A) achieved by taking those n≡7(mod25)n\equiv 7\pmod{25}? Resolved for all sufficiently large NN: any near-maximal AA is contained in {n≡7(mod25)}\{n\equiv 7\pmod{25}\} or {n≡18(mod25)}\{n\equiv 18\pmod{25}\}, leaving only a finite check.

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:2fa445056c2d4a234dc3bff5995b5aa1c1553a3e0a0bfc42fbb8d20a55b8168f
Metadata
sha256:74742a4acd69c2a442e20d680c1a72414af8b0537813577d08af15b6f21d2fba
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:c0314562283e1d8879c504d6261ca6224701eaaad20484faef01b619f5afa77e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb