Papalocal
Loading…
Papalocal · Things
Work

Erdős–Turán conjecture on additive bases

Erdős–Turán conjecture on additive bases is an unsolved problem in number theory.

All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
conjecture One source
Named after
Paul Erdős One source
Pál Turán One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2568257475
Described as
unsolved problem in number theory
What it is
conjecture
Named after
Paul Erdős; Pál Turán
Wikipedias with a page
4

Wikidata item Q2993302 (wikidata.org/wiki/Q2993302), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1352587850

The Erdős–Turán conjecture is an old unsolved problem in additive number theory posed by Paul Erdős and Pál Turán in 1941.
It concerns additive bases, subsets of natural numbers with the property that every natural number can be represented as the sum of a bounded number of elements from the basis. Roughly, it states that the number of representations of this type cannot also be bounded.

From the Wikipedia article “Erdős–Turán conjecture on additive bases” (en.wikipedia.org/wiki/Erdős–Turán_conjecture_on_additive_bases), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it