Abstract
In this paper, we prove that for positive integers k k and n n , the cardinality of the symmetric differences of { 1 , 2 , … , k } \{1,2,\dots ,k\} , { 2 , 4 , … , 2 k } \{2,4,\dots ,2k\} , { 3 , 6 , … , 3 k } \{3,6,\dots ,3k\} , …, { n , 2 n , … , k n } \{n,2n,\dots ,kn\} is at least k k or n , n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.