Mathematica 9 is now available
Student Support Forum
Student Support Forum: 'ProvablePrimeQ: timing on a P4' topicStudent Support Forum > General > Archives > "ProvablePrimeQ: timing on a P4"

Help | Reply To Topic
Author Comment/Response
08/30/03 10:43pm

How long does the function ProvablePrimeQ take to prove that a prime number is in fact prime on a P4 with Mathematica 4.2 in terms of the number of digits it has? That is, what is the longest the function could take to prove a number's primality. If the answer cannot be given in terms of digits but you can answer for a specific number, my number in question is prime by PrimeQ so it is probably prime and it has 8726 digits.
I would appreciate any help you can offer.

URL: ,
Help | Reply To Topic