Code for testing a prime other than form 2^n-1

[MercPrime]

Hello,

I thought there was a guide to entering a line in the worktodo file, but I searched and cant seem to find it.

I have a candidate for a Sophia Prime of form 2^n +1 or there abouts (small number, nothing huge) and was looking to do a quick test.

So is there a way to specify the form, or would I have to crunch the numbers to come up with an exponent that has decimals or something. Thanks!

[TimSorbet]

http://www.mersenneforum.org/showpos...33&postcount=6 shows the worktodo line formats. If you're trying to do something that's not supported by Prime95, check out PFGW or LLR.

[Batalov]

Originally Posted by MercPrime

...I have a candidate for a Sophia Prime of form 2^n +1 ...

All 2^n+1 numbers (except n=2^m) are composite, in case you were unsure.

[MercPrime]

Thank you Mini-Geek and Batalov, been a while so I have to dust off the brain a little!

The point of the program is that there is a special method to find primes which CAN be expressed as (2^P)-1. There are definitely some prime numbers expressed as (2^P)+1 (I think for certain even P's...) but those numbers cannot use the Lucas Lehmer algorithm.

The algorithm was specially designed for Mersenne primes only. It saves an enormous amount of time over other conventional primality tests which is why all the biggest primes discovered to date are Mersenne primes. I couldn't explain the proof of the Lucas Lehmer test if I tried, but I do know it takes advantage of the fact that the binary form of a mersenne number is 111.........111, whereas your proposed candidate is 1000.........0001.

[cheesehead]

Originally Posted by Unregistered

There are definitely some prime numbers expressed as (2^P)+1 (I think for certain even P's...)

... but, as pointed out above, only if P = 2^m.