The Prime Sierpinski project (PSP) is a mathematical project involved in the search of large prime numbers of a special class called proth numbers. They have the general formula k*2^n+1. We further specialize by searching for numbers where k is prime in k*2^n+1. Further more it has been proven that there exists an infinite number of prime k’s such that k*2^n+1 can never be prime. These k’s are called prime sierpinski numbers.
