Minimal size balanced sets mod p

Abstract

A nonempty set S of residues modulo N is said to be balanced if for each x∈S, there is a d with 01. Thus, the sequence simplifies to cm=2m+13 with m odd. Finally, we prove that if 2p+13 is prime, then p must be a prime.

Keywords

• Minimal size
• Balanced sets
• Mod p
• Polynomial algorithm
• Lucky primes
• Balanced set modulo