Erdős Problem a Daythe open tracker

Erdős Problem #1116

SOLVEDdatabase updated 2025-12-29

Resolved in some way other than a straight proof or disproof — usual for open-ended questions, or for multi-part problems whose parts went different ways.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

\(n(r,a)\) for \(f\): the number of roots of \(f(z)=a\) in the open disc \(\lvert z\rvert<r\), counted with multiplicity, as on erdosproblems.com. [To76, p. 565] and [HaLi18, Chapter 1, Notation] count roots in the closed disc \(\lvert z\rvert\le r\); this does not change the \(\limsup\) below, since the open-disc count at \(r\) equals the closed-disc count at some slightly smaller radius. The count is the sum, over the disc, of the positive part of the divisor of \(f-a\). For an entire \(f\) the divisor has fini

Division-free form of \(\limsup_{r\to\infty} n(r,a)/n(r,b)=\infty\). For every \(M\) and \(R\) there is \(r>R\) with \(n(r,b)>0\) and \(n(r,a)>M\,n(r,b)\). In particular, \(f\) takes the value \(b\), so the ratio is never \(x/0\).

For a meromorphic function \(f\) let \(n(r,a)\) count the number of roots of \(f(z)=a\) in the disc \(\lvert z\rvert <r\). Does there exist a meromorphic (or entire) \(f\) such that for every \(a\neq b\) \[\limsup_{r\to \infty}\frac{n(r,a)}{n(r,b)}=\infty?\] This is Problem 1.25 in [Ha74], where it is attributed to Erdős. Gol'dberg [Go78] and Toppila [To76, Theorem 3] constructed such entire functions. We state this case, for finite \(a\neq b\), using `UnboundedCountRatio`.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/1116.
Prizenone
Topicsanalysis
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1116
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.