![]() |
![]() |
#1 |
May 2014
18 Posts |
![]()
Hi, how can I test my probable prime number?
Thanks.. |
![]() |
![]() |
![]() |
#2 |
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
![]()
Run Prime95 on it.
![]() Since you see a probability of its being prime, don't bother with Trial Factoring or P-1 Factoring. However, unless you are actually Curtis Cooper incognito, there is probable disappointment in your future. ![]() Good Luck! ![]() |
![]() |
![]() |
![]() |
#3 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
101000001100002 Posts |
![]()
how big? test it for what?
Last fiddled with by LaurV on 2014-05-08 at 12:06 |
![]() |
![]() |
![]() |
#4 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
11×389 Posts |
![]()
We'll need more information to help you and tell you if it's even feasible (with hardware available today). How large is it? What form is it? (e.g. 2^p-1, n!-1, 2^n+b, etc.; you don't have to tell us the exact number if you don't want to, but at least give us an idea of the scale of the number(s) involved) (some numbers with special forms have fast tests, like the LL for Mersenne numbers, while others require a more difficult algorithm, ECPP, that can be run on a number of general form) If the factorization of N-1 or N+1 (where your number is N) is known, you can run a fast test.
Possibilities include Prime95, PFGW, and Primo (ECPP). (I'm assuming you're saying that you have a number that has already passed a PRP, probable prime, test, and you want to know how to prove it prime) Last fiddled with by TimSorbet on 2014-05-08 at 12:10 |
![]() |
![]() |
![]() |
#5 |
"Forget I exist"
Jul 2009
Dartmouth NS
2×52×132 Posts |
![]() |
![]() |
![]() |
![]() |
#6 | |
"Gary"
May 2007
Overland Park, KS
2·7·13·67 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
"Jane Sullivan"
Jan 2011
Beckenham, UK
1010100012 Posts |
![]()
What is the point of asking a question here, if you are going to ignore all the follow-up posts?
|
![]() |
![]() |
![]() |
#8 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
6,131 Posts |
![]() |
![]() |
![]() |
![]() |
#9 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3·37·61 Posts |
![]()
How do you know the OP ignored the replies? Perhaps the OP read them/is reading them now and is taking notice, or waiting for what he/she considers a sensible response?
|
![]() |
![]() |
![]() |
#10 |
"Bob Silverman"
Nov 2003
North of Boston
3·11·229 Posts |
![]() |
![]() |
![]() |
![]() |
#11 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3×37×61 Posts |
![]()
Yes, perhaps. Often people post to several boards at the same time. They get belittled on one board, ignored on a second board, and nanny coddled on a third. It doesn't take a genius to guess which board they direct their attention to.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Test a Specific Exponent in Prime95. When it is 100% done, does it mean I find a new prime number? | king | Information & Answers | 5 | 2018-02-21 18:15 |
probable largest prime. | sudaprime | Miscellaneous Math | 11 | 2018-02-05 08:10 |
Miller-Rabin Strong Probable Prime Test (SPRP) | fenderbender | Miscellaneous Math | 22 | 2010-11-11 01:04 |
Fourth probable prime found, one to go! | philmoore | Five or Bust - The Dual Sierpinski Problem | 22 | 2010-01-01 00:23 |
Another record probable prime found! | philmoore | Five or Bust - The Dual Sierpinski Problem | 15 | 2009-02-08 19:43 |