Authors and affiliations
In this brief note, we investigate the quantity k(n), which is the smallest natural number r such that for all subsets A ℤ/nℤ satisfying A ⊆ A = ℤ/nℤ, we have rA = ℤ/nℤ.
- Difference sets
- Problem Session of the Conference in Number Theory, Carleton University, June 28, 2011, http://www.fields.utoronto.ca/programs/scientific/10-11/numtheoryconf/conferenceproblems.pdf
- Granville, A. An introduction to additive combinatorics, Additive Combinatorics (Providence, RI, USA), CRM Proceedings and Lecture Notes, American Math. Soc., Vol. 43, 2007, 1–27
Cite this paperAPA
Richardson C. J., & Spencer C. V. (2012). A note on sumsets and difference sets in ℤ/nℤ, Notes on Number Theory and Discrete Mathematics, 18(3), 45-47.Chicago
Richardson C. J., and Craig V. Spencer. “A Note on Sumsets and Difference Sets in ℤ/nℤ.” Notes on Number Theory and Discrete Mathematics 18, no. 3 (2012): 45-47.MLA
Richardson C. J., and Craig V. Spencer. “A Note on Sumsets and Difference Sets in ℤ/nℤ.” Notes on Number Theory and Discrete Mathematics 18.3 (2012): 45-47. Print.