A counterexample to a conjecture of Erdős, Graham and Spencer (Q1010704)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counterexample to a conjecture of Erdős, Graham and Spencer |
scientific article; zbMATH DE number 5540905 |
Statements
A counterexample to a conjecture of Erdős, Graham and Spencer (English)
0 references
7 April 2009
0 references
Summary: It is conjectured by Erdős, Graham and Spencer that if \(1 \leq a_1 \leq a_2 \leq \dots \leq a_s\) with \(\sum_{i=1}^s 1/a_i < n - 1/30\), then this sum can be decomposed into \(n\) parts so that all partial sums are \(\leq 1\). In this note we propose a counterexample which gives a negative answer to this conjecture.
0 references
Erdős-Graham-Spencer conjecture
0 references
Erdős problem
0 references
partition
0 references
0.9316926598548888
0 references
0.92348051071167
0 references
0.9104756116867064
0 references
0.9046443104743958
0 references
0.8018707633018494
0 references
