Twin Mersenne Primes

[ewmayer]

Originally Posted by TTn

Still waiting...

By conscious choice I don't use the internet at home, so the only time I'm online on the weekend is if I happen to stop by the office to do something work-related. I didn't have time to do more than view a few brief threads here yesterday.

But now that I've had time to understand your "algorithm," I doubt you'll like what I have to say. After weeding out all the (as it turns out) irrelevant stuff about generalized Mersennes, what your algorithm amounts to is the following trivial result:

In the interval (2^a, 2^b], with a, b natural and a < b, there are precisely (b-a) powers of 2.

Your method of factoring out the accumulated power of 2 in k whenever you hit a prime (gM or genuine Mersenne) is just a fancy way of counting the powers of 2 between Mersenne primes.

Notice that it doesn't matter whether there are any generalized Mersenne primes (i.e. Riesel primes) between genuine Mersenne primes, and even if there are and one either misses or ignores any or all of them, the result is the same. The gM's are just a red herring - whether one chooses to use them to mark the powers of 2 that one passes on the way from one M-prime to the next or not, it doesn't matter, because in the end one simply winds up with different ways of counting the powers of 2 along the way. I'm afraid there's nothing at all remarkable about it.

ewmayer

I never said that the vector fields were rational functions,
Your solution is elegant,... though on this particular occasion ultimately incorrect.(Nash)




The function of the one, in now to return to the source allowing a temporary disemination of the code I carry, re-inserting the prime program.