20170423, 19:51  #1 
"Anastasia"
Apr 2017
Ukraine
4_{8} Posts 
Testing my numbers
Hello everybody!
I'm new in GIMPS. I want to know if I can test prime numbers in this program? I know some prime numbers like 2^p, where p is about several hundred billion. So testing 2^p  1 is my dream :3 Hope my numbers are prime... :) Can I do it? Best regards, Anastasia 
20170423, 20:56  #2 
"Victor de Hollander"
Aug 2011
the Netherlands
49B_{16} Posts 
Welcome to the mersenneforum!
There are multiple programs available to test primality of candidate numbers. For Mersenne numbers (2^P 1, with P prime) Prime95 is the easiest to start with. You can download it from: https://www.mersenne.org/download/ You can join GIMPS if you like, a coordinated effort for finding new Mersenne primes. Testing a Mersenne candidate for primality, a so called LucasLehmer test (usually shorted to LLtest) takes a couple of days on the fastest computers, to several weeks (or even months) on older models. Testing candidates with more than 100million digits takes years on a desktop computer and is not recommended if you just started. Testing billion digit numbers is not feasible with the current hardware. 
20170423, 21:32  #3 
"Kieren"
Jul 2011
In My Own Galaxy!
2·3·1,693 Posts 
Welcome, and Happy Number Crunching!

20170423, 21:41  #4  
Einyen
Dec 2003
Denmark
19·181 Posts 
Quote:
The limit for Prime95 is around 595 million, and one such test will take 6+ months even on the fastest computers, and years on "normal" computers. Mlucas might be able to go a little higher, but no where near 100 billion. You can trial factor your number and hope to find a factor (but that will kill your dreams about the number being prime). In the "Operation Billion Digits" forum there are software like Mfactor and factor5, and I believe those can trialfactor in those ranges. Last fiddled with by ATH on 20170424 at 03:14 

20170424, 01:13  #5 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10895_{10} Posts 
If you are thinking of testing 2^{(2^1271)}1, there is no way to test it for many, many years to come.
http://mersennewiki.org/index.php/M12 
20170424, 01:23  #6  
P90 years forever!
Aug 2002
Yeehaw, FL
2^{2}·13·157 Posts 
Quote:


20170424, 01:36  #7  
"Rashid Naimi"
Oct 2015
Remote to Here/There
2^{3}·293 Posts 
Quote:
Quote:


20170424, 01:39  #8 
"Forget I exist"
Jul 2009
Dartmouth NS
20E2_{16} Posts 
think *. Also, noting that 2^11 is not 2, and that 2 is not a mersenne prime, and that 2^21 is not 7 might help.
Last fiddled with by science_man_88 on 20170424 at 01:39 
20170424, 01:44  #9  
"Rashid Naimi"
Oct 2015
Remote to Here/There
2^{3}×293 Posts 
Quote:
http://mersennewiki.org/index.php?ti...action=history 

20170424, 01:57  #10 
"Rashid Naimi"
Oct 2015
Remote to Here/There
928_{16} Posts 
A search brought Nap 1 as an iphone app with arbitrary precision up to 40k and it is free.

20170424, 02:02  #11 
"Forget I exist"
Jul 2009
Dartmouth NS
2·3·23·61 Posts 
110000T is reported as the upper k in the last posting the the operazione doppi mersenne results thread for it that I found.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Why have ECM testing for known nonprime Mersenne numbers?  sd235  Information & Answers  12  20181206 17:56 
Nvidia GPU for PRP testing proth numbers?  Angular  GPU Computing  13  20160802 12:03 
Speed of P1 testing vs. Trial Factoring testing  eepiccolo  Math  6  20060328 20:53 
newbie question  testing primality of very large numbers  NeoGen  Software  8  20060320 01:22 
testing big numbers  sagan_fan  Math  8  20021009 21:20 