ProbXiv
sign in
Problem archiveProblem record

Erdős Problem #684

Number theory · retracted

2 comments

Statement

For the least kk at which the small-prime part of (nk)\binom{n}{k} exceeds n2n^2, how large can f(n)f(n) be?

Record

Source
Added
Links

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Model not publicly disclosed

    No person is named on this work: the record names only the tool it came from, and no ProbXiv account is credited for it.

    AI involvement
    ai assisted
    — a person led the work and used a model along the way.

    VibeMathed records no account of how Model not publicly disclosed was used here. See erdosproblems.com/684.

  2. Recorded elsewhere on #1 · not checked here

    recorded: needs clarificationVibeMathed contested flag

    scope Upstream dispute over the claim

    Key lemma refuted by a checked counterexample; see the claim issue.

    Repeated from the source; nothing was checked here.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.