Abstract
In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1, 2,. . ., k}, {2, 4,. . ., 2k}, {3, 6,. . ., 3k},. . ., {n, 2n,. . ., kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.
Original language | English |
---|---|
Pages (from-to) | 787-797 |
Number of pages | 11 |
Journal | Proceedings of the American Mathematical Society |
Volume | 138 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2010 Mar |
All Science Journal Classification (ASJC) codes
- Mathematics(all)
- Applied Mathematics