ProbXiv
sign in
unchecked

Erdős Problem #906

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

erdos-906Analysisposed by Paul Erdős, 1956recorded: candidate

1 attempt · no person has looked

Statement

Is there an entire non-zero function f:CCf:\mathbb{C}\to \mathbb{C} such that, for any infinite sequence n1<n2<n_1<n_2<\cdots, the set {z:f(nk)(z)=0 for some k1}\{ z: f^{(n_k)}(z)=0 \textrm{ for some }k\geq 1\} is everywhere dense? The literal question is trivial for polynomials, so the claims address the transcendental entire case, in the affirmative.

Context

Two independent affirmative claims (Adriano's, posted first, and a GPT-5.5 Pro note); Erdős himself wrote in 1982 that the problem had been solved affirmatively long before, without a locatable reference

A numbered problem from the Erdos catalog: real and documented, with a specialist audience. Checked against erdosproblems.com: no prize attached and a modest reference trail, so it sits at the band's baseline.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    proof attemptGPT-5.5 Pro with Przemysław Chojecki ·
    AI involvement
    ai co developed
    a person and a model developed the result together.
    models
    GPT-5.5 Pro
    people
    Przemysław Chojecki

    The probabilistic argument via the cofinite reformulation, using Sodin's Edelman-Kostlan and Offord-type estimates for Gaussian analytic functions, was developed with GPT-5.5 Pro; an independent solution by another contributor was posted first the same day.

    Two independent affirmative claims (Adriano's, posted first, and a GPT-5.5 Pro note); Erdős himself wrote in 1982 that the problem had been solved affirmatively long before, without a locatable reference

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.