Skip to content

Erdős problem 848

Start work

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.

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.

  • AI collaborating with humans

    Erdős AI contributions wiki · 12-15 Mar, 2026

    Machine
    Claude Opus 4.6, GPT-5.4
    People
    Malek Zribi
    Open the source record

  • AI building on literature

    Erdős AI contributions wiki · 5-23 Mar, 2026

    Machine
    Gemini 3.1 Pro, GPT-5.2 Thinking, GPT-5.4 Thinking
    Open the source record

  • AI collaborating with humans

    Erdős AI contributions wiki · 12 Oct-20 Nov, 2025

    Machine
    GPT-5
    People
    Mehtaab Sawhney, Mark Sellke
    Open the source record

  • Formalization

    Erdős AI contributions wiki · 28 Jan, 2026

    Machine
    Aristotle, Claude, GPT-5.2
    Open the source record

  • argument

    VibeMathed

    Machine
    GPT-5
    People
    Mehtaab Sawhney, Mark Sellke
    Reported outcome
    resolved
    Open the source record