Skip to content

Problem

erdos: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,bAa,b\in A) achieved by taking those n7(mod25)n\equiv 7\pmod{25}? Resolved for all sufficiently large NN: any near-maximal AA is contained in {n7(mod25)}\{n\equiv 7\pmod{25}\} or {n18(mod25)}\{n\equiv 18\pmod{25}\}, leaving only a finite check.

Declared status
decidable
Formalization
formalized
OEIS
N/A

Matching claims

0
No direct claims
This problem has no directly related claim record.

Search problems.science

Find a Problem, Result, source, or page