Prime for Mac OS X - xGrid
 

I have an Apple xGrid with 16 total processors (and growing) that I want to use for Mersenne Prime calculations, any suggestions on where to get software?

You want either [url=ftp://hogranch.com/pub/mayer/README.html]MLucas[/url] or [url=http://www.oxixares.com/glucas/]GLucas[/url]. I'm not sure which one would be faster, or better on 16 processors. :unsure:

[QUOTE=Ken_g6]You want either [url=ftp://hogranch.com/pub/mayer/README.html]MLucas[/url] or [url=http://www.oxixares.com/glucas/]GLucas[/url]. I'm not sure which one would be faster, or better on 16 processors. :unsure:[/QUOTE]
I'm quite sure that Glucas will be better.

[QUOTE=victor]I'm quite sure that Glucas will be better.[/QUOTE]Based on what?

ewmayer,

Is it possible for you to modify your program so it can test numbers like k*2^n+1. Several members of the PSP project, have several mac's sitting around.

The algorithm is easy to implement. The multiplication modulo k*2^n+1 is the difficult part I guess. But it can't be very different from Mersenne numbers (I do not completely understand FFT)

What do you think, is it possible to implement the algorithm/multiplication?

Thanks,
Citrix

[QUOTE=Citrix]ewmayer,

Is it possible for you to modify your program so it can test numbers like k*2^n+1.[/QUOTE]Possible? Yes. But due to N (>> 1) more-pressing issues, the next major release will only allow the following:

1) k = -1, n prime;

2) k = +1, n a power of 2.

(I.e. Mersennes and Fermats.)

Thankyou, for considering the request. (even if it will not be fulfilled)

Citrix

[QUOTE=Citrix]Thankyou, for considering the request. (even if it will not be fulfilled)[/QUOTE]
Oh, rest assured it will be fulfilled - just not as fast as you'd like. ;)