mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2013-04-18, 05:34   #1
MercPrime
 
MercPrime's Avatar
 
Jan 2009
1/n

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

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!
MercPrime is offline   Reply With Quote
Old 2013-04-18, 11:59   #2
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

10000101010112 Posts
Default

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.

Last fiddled with by Mini-Geek on 2013-04-18 at 12:00
Mini-Geek is offline   Reply With Quote
Old 2013-04-18, 17:37   #3
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100011101001102 Posts
Default

Quote:
Originally Posted by MercPrime View Post
...I have a candidate for a Sophia Prime of form 2^n +1 ...
All 2^n+1 numbers (except n=2m) are composite, in case you were unsure.
Batalov is offline   Reply With Quote
Old 2013-04-19, 03:20   #4
MercPrime
 
MercPrime's Avatar
 
Jan 2009
1/n

3×7 Posts
Default

Thank you Mini-Geek and Batalov, been a while so I have to dust off the brain a little!
MercPrime is offline   Reply With Quote
Old 2013-05-12, 18:35   #5
Unregistered
 

52×7×19 Posts
Default Mersenne Primes

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.
  Reply With Quote
Old 2013-05-12, 22:03   #6
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Quote:
Originally Posted by Unregistered View Post
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 = 2m.
cheesehead is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Smallest prime of the form a^2^m + b^2^m, m>=14 JeppeSN Math 114 2018-12-16 01:57
Probability that N is prime given each divisor of N has the form 2*k*p+1 carpetpool Miscellaneous Math 6 2017-09-01 13:59
Most Abundant form of Prime Numbers a1call Information & Answers 17 2017-02-26 22:01
Is there a prime of the form...... PawnProver44 Miscellaneous Math 9 2016-03-19 22:11
OEIS A071580: Smallest prime of the form k*a(n-1)*a(n-2)*...*a(1)+1 arbooker And now for something completely different 14 2015-05-22 23:18

All times are UTC. The time now is 17:09.

Wed Sep 23 17:09:31 UTC 2020 up 13 days, 14:20, 1 user, load averages: 1.58, 1.86, 1.95

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.