On balanced sets mod p (Q1065052)
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 balanced sets mod p |
scientific article; zbMATH DE number 3920566
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On balanced sets mod p |
scientific article; zbMATH DE number 3920566 |
Statements
On balanced sets mod p (English)
0 references
1985
0 references
Let p be a prime, and let n(p) denote the smallest value of n for which we can find \(2n+1\) integers (mod p), not all equal, such that, if any one of them is removed, the remaining ones can be divided into two sets of n elements with equal sums. It is shown that, if \(p>5\), n(p) lies between \(\frac{\log p}{2 \log \log p}\) and 3 log p.
0 references
balanced sets
0 references
two sets of integers with equal sums
0 references
0.8181823492050171
0 references
0.7940294742584229
0 references
0.7939530611038208
0 references
0.7906181216239929
0 references
