The cardinality of some symmetric differences
Open Access
- 23 October 2009
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 138 (3) , 787-797
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.Keywords
This publication has 3 references indexed in Scilit:
- On Chebyshev-Type Inequalities for PrimesThe American Mathematical Monthly, 1982
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de nActa Arithmetica, 1982
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962