This is a concept a came up with at camp. Basically you compile primes n number of times where n is prime. Then, the nth number in the list is a perfect prime. Here's 2: Compilation 0: 1,2,3,4,5,6,7,8,9,10,11.... Compilation 1: 2,3,5,7,11,13.... Compilation 2: 3,5,11,17... And thus, the 1st perfect prime of base 2 is 5. This program is set up to find the 5 perfect primes...I'm hoping to come up with a way where it can just go on forever but...it'll be difficult.
