I have figured out a seemingly revolutionary way to calculate primes. It is very simple. Let o be the number of odd digits in p, where p is a power of 2. If o is an odd number, then the sum of digits in p will be a prime number. Please, PLEASE do not hold back with commenting. I really want somebody to try to prove this wrong :P By the way, I would appreciate HUGELY if somebody with programming knowledge would make a program that calculates using this formula. Also, I need to make a proof! If anybody can help with either of these things, tell me so. Also, in some cases if you make 0 -2 while adding instead of adding 0 it gives you a twin prime to the original. Examples: 2^12 (4096) = p o for p is equal to 1. One is an odd number, so the sum of 4+0+9+6 is a prime number (19). This example works also if you follow my 0 = -2 rule (it gives you 17). 2^4 (32) = p o for p is equal to 1, so because one is an odd number the sum of 3+2 is a prime number. I have had to figure out numbers up to 2^149 by hand, so a program that does this would help! Thanks! Z.L.