科研之友
微信
新浪微博
Facebook
分享链接
摘要
A Sidon set S is a set of integers where the number of solutions to any integer k = k(1) + k(2) with k(1), k(2) is an element of S is at most g = 2. If g %26gt;= 3, the set S is a generalised Sidon set. We consider the Sidon sets modulo n, where the solutions to addition of elements are considered under a given modulus. In this note, we give a construction of a generalised Sidon set modulo n from any known Sidon set.
- 出版日期2014-4
