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.

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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

Open exact source location