Skip to content

Home
Problems
Updates

Add a contribution

Privacy Terms Accessibility Contact

Choose a Problem

Open its Work view to check prior approaches, attach evidence, and prepare a Result.

Find a Problem to contribute to

Published collections

Starting points

Browse all Problems

Erdős Problems

View collection

Suppose $n$ points in $\mathbb{R}^2$ determine a convex polygon and the set of distances between them is $\{u_1,\ldots,u_t\}$ . Suppose $u_i$

Formal Conjectures

View collection

For every integer $x \ge 2$

Already have work?

Connect a GitHub repository or exact public commit, then attach it to a Problem.

Problems keeps the draft and handoff visible. Source files, local tools, credentials, and execution stay in GitHub or your local workspace.

appears as the distance between

f(u_i)

many pairs of points. Then

\sum_i f(u_i)^2 \ll n^3.

Source says proved (Lean)4 formal declarations1 reviewed Resultvia Formal Conjectures

Open Work

What is the largest

A\subseteq\{1,\dots,N\}

such that all subset sums

\sum_{n\in S}1/n

S\subseteq A

) are distinct?

Source says solved6 formal declarations1 reviewed Resultvia Erdős Problems

A\subseteq\{1, ..., N\}

|A| = n

is such that the subset sums

\sum_{a\in S}a

are distinct for all

S\subseteq A

N \gg 2 ^ n.

Source says open8 formal declarationsvia Formal Conjectures

there exists a prime between

x(x-1)

and

x^2

.

Wikipediaresearch open

Open Work