Olson's theorem for cyclic groups
Number Theory
2007-05-23 v1 Combinatorics
Abstract
Let be a large number. A subset of is complete if , where is the collection of the subset sums of . Olson proved that if is a prime and , then is complete. We show that a similar result for the case when is a composite number, using a different approach.
Cite
@article{arxiv.math/0506483,
title = {Olson's theorem for cyclic groups},
author = {V. Vu},
journal= {arXiv preprint arXiv:math/0506483},
year = {2007}
}