Plectis

Eight Erdős problems

Read the mathematics. Find what comes next.

This site collects papers about eight mathematical questions, the results proved so far and the questions that remain open. Start with a problem below or its short paper. The longer papers describe the investigation, including attempts that failed. The GitHub repository contains the papers, proof files and programs used for calculations.

689 results from the sixteen problem papers, linked to formal statements, proof files and recorded tests of those proofs.

S=∑n≥21n!−1
#68 The factorial-denominator series

Is the series ∑n≥21/(n!−1) irrational? The question is open. Read the short paper

limn→∞anan−12=1and∑1an∈Q
#243 Reciprocal-tail rigidity near the Sylvester recurrence

Under a rapid-growth hypothesis on an integer sequence, does rationality of its reciprocal sum force the sequence to satisfy the Sylvester recurrence eventually? The question is open. Read the short paper

S=∑n≥1φ(n)2n
#249 The binary totient series

Is the binary Lambert series ∑φ(n)/2n irrational? The question is open. Read the short paper

Π=∑n≥0pn2n+1
#251 The prime-gap dyadic series

Is the dyadic series of consecutive primes irrational? Equivalently, is the corresponding consecutive-prime-gap dyadic series irrational? The question is open. Read the short paper

XA(b)=∑a∈A1ba−1
#257 Reciprocal sums over infinite exponent supports

Is the sum of 1/(2n−1) over every infinite set of positive exponents irrational? The question is open. Read the short paper

RP=∑u∈SP1L⁡(u)
#269 Three-prime running least common multiples

For a finite set of at least two primes, is the sum of reciprocals of the running least common multiples of the smooth numbers irrational? The question is open. Read the short paper

Ωf={z:|f(z)|<1}
#1041 Short connections inside polynomial lemniscates

Must two roots of a monic polynomial in the open unit disc be joined by a sub-two-length curve inside its unit lemniscate? Status: formal statement refuted. Read the short paper

F(t)=∑n≥1(tn−1)−1
#1049 Lambert-type series at rational bases

For which rational bases is the corresponding series irrational? The question is open. Read the short paper

Problems

Each problem page separates statements with Lean proofs from unanswered questions. Lean is software that verifies formal proofs against their statements and assumptions.

Reading the eight together

Read the papers and Lean corpus together to find connections, reusable constructions and new questions beyond the original targets. This paper develops that work, keeping each result’s proof and remaining limits visible.

Map of results

Every result in the papers, drawn with its problem

689 results from the problem papers, in a ring round the problems and their claims. The colours distinguish results stated in Lean, a language for computer-verified proofs, from results whose proofs Comparator has also tested against separate theorem statements. Hover to read a title; select a result to read its statement, assumptions and proof records.

Open the full map

The papers

Every programme above opens its own papers: sixteen problem papers, a short paper and a longer record for each, and one expository paper. The papers catalogue lists all 22 current papers with their lengths and PDFs, and keeps the retired manuscripts apart.

Open the papers catalogue

Method and the research system

Reading and checking the work

Technical reference and history

Develop what comes next

  • Explore with your AI. One reading file, no clone: an introduction, a short research instruction and the opening of each paper.
  • Work in the repository. Download a working copy, name a question, or ask your coding agent to read the papers and proof files and propose further work.
  • Choose an unanswered question. One GitHub issue lists an unanswered research question for each of the eight problems.

You can contribute an insight before writing a formal proof. Will can work with you to develop and formalise it, with credit for the insight and the subsequent work kept distinct. The whole collection is also material for new mathematics: connections, reusable methods and questions across problems.

Will Cook built and directs this AI-assisted research environment and maintains its public release. AI agents did most of the research and drafting. The papers name earlier sources and contributors to particular results, including ani’s #1041 construction. For a result, cite its paper and relevant earlier sources; for software, use the release citation and give the commit used. Contact Will with questions or corrections.

About this edition

8 problems, 22 paper records in the source snapshot, 18 guides and 2,907 mapped objects.

Papers and maps are generated together from one source snapshot. GitHub links open the current source. Edition b0ebeb9add157584.