Re: [PrimeNumbers] Re: Fermat or Rabin/Miller PRP test uing YEAFFT
- pfgw is your best bet. I don't know if YEAFFT will be faster than it
for numbers of that form.
On Sep 2, 2008, at 6:20 PM, j_chrtn wrote:
> Hello Mark,
> As mentioned in my previous reply to Phil, the numbers I want to
> check are (n+1)^p-n^p for which I don't know any
> specialized/optimized program. So I used to use pfgw for this
> purpose. Pfgw is great but as far as I know cannot take advantage of
> SMP hardware...
> Do you have any idea of a program I could use for this form of
> numbers on SMP ?
[Non-text portions of this message have been removed]