On a combinatorial problem (Q2730590)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a combinatorial problem |
scientific article; zbMATH DE number 1631431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a combinatorial problem |
scientific article; zbMATH DE number 1631431 |
Statements
8 August 2001
0 references
combinatorial identity
0 references
induction
0 references
On a combinatorial problem (English)
0 references
The author gives a solution of the following problem. Let \(n\neq 2^{k}\), \(k\in\mathbb N\). Then we can reconstruct \(n\) real numbers if all their pairwise sums are given.
0 references
