Charlatan

To find the double mersene primes, you need to find the prime numbers that follow in sequence relating to mersene prime numbers.

To find prime numbers, we need to first of all make sure they are odd or two. Seeing as how every odd number that does not go into another odd number equals a prime number, i suggest that prime numbers that subscribe to the mersene conjecture, and i have also noticed that M always equals something else.

If m always equals something else, then it must be that m is not constant, and using a symbol to refer to something that is not constant means the symbol is not the same thing each time. If the symbol is not constant, then it means that the symbol simply doesn't work.

http://en.wikipedia.org/wiki/Catalan...ersenne_number

As you can see, M equals 2 at first, then times by 3 it equals 7. Then it comes to be times by 7, and that leaves it at 127. This means nothing to the power of three equals seven, unless it is broken down into decimals. But,

Back to the double mersene prime numbers.

If you have mm2 equals 7, then m equals 3 and you add all the munbers.

If you have mm3 equals 27, then m equals 12 and you add all the numbers.

Here i have presented a formula for calculating prime conjectures, basically by breaking the ruths of math. Let's see if it works for the next number?

127 equals mm5, so, 127 minus 5 = 122, and 122 divided by something that goes into each m once, [so halving it], would mean that it is 61.

The rest is not too hard to do, but i don't really have the 'resources' to do them. I hope someone can put my theory to the test!

0 Thanks, 0 Likes, 0 Dislikes