A modular arithmetic analysis of the Sierpinski Number Problem

In this paper, we prove theorems that simplify the famous Sierpinski Number Problem. We also develop a method for prime numbers that would aid the current sequential searching techniques.