### 摘要

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.

原文 | English |
---|---|

頁（從 - 到） | 787-797 |

頁數 | 11 |

期刊 | Proceedings of the American Mathematical Society |

卷 | 138 |

發行號 | 3 |

DOIs | |

出版狀態 | Published - 2010 三月 1 |

### All Science Journal Classification (ASJC) codes

- Mathematics(all)
- Applied Mathematics

## 指紋 深入研究「The cardinality of some symmetric differences」主題。共同形成了獨特的指紋。

## 引用此

Huang, P. Y., Ke, W. F., & Pilz, G. F. (2010). The cardinality of some symmetric differences.

*Proceedings of the American Mathematical Society*,*138*(3), 787-797. https://doi.org/10.1090/S0002-9939-09-10189-2