Article ID Journal Published Year Pages File Type
434788 Theoretical Computer Science 2012 5 Pages PDF
Abstract

We deal with small size balanced subsets of Zp when p is prime. In a balanced set S, each element x∈S is a midpoint between two other elements from S, i.e. , y,z∈S∖{x}. We denote the minimum cardinality of a balanced set modulo p by α(p).We prove a new lower bound for α(p). Thus we demonstrate that for every prime p>2, α(p)≥log2p+1.41.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics