Talk:MPrime

	This redirect is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
	This redirect is supported by WikiProject Software.
	An editor has requested that an image or photograph be added to this redirect.

Reqphoto

—Preceding unsigned comment added by Anthony5429 (talk • contribs) 15:54, 13 October 2006

I suppose "photo" means screenshot here, but on linux there's no GUI so it would be just something like

(mfh@lx01 ~/Research/NumberTheory/gimps) mprime -h
Usage: mprime [-cdhmstv] [-aN] [-b[N]] [-wDIR]
-c      Contact the PrimeNet server, then exit.
-d      Print detailed information to stdout.
-h      Print this.
-m      Menu to configure mprime.
-s      Display status.
-t      Run the torture test.
-v      Print the version number.
-aN     Use an alternate set of INI and output files.
-bN     Run in the background.  N is number of CPUs.
-wDIR   Run from a different working directory.

(mfh@lx01 ~/Research/NumberTheory/gimps) ls
loca0001.ini            prim0001.log            q1I94089
local.ini               prime.ini               resu0001.txt
p0H56477                prime.log               results.txt
p1I94089                primenet.ini            work0001.ini
prim0001.ini            q0H56477                worktodo.ini
(mfh@lx01 ~/Research/NumberTheory/gimps) mprime -b2
(mfh@lx01 ~/Research/NumberTheory/gimps) mprime -s
Below is a report on the work you have queued and any expected completion dates.
M42056477, Lucas-Lehmer test, Wed Jul 30 20:06 2008
The chance that the exponent you are testing will yield a Mersenne prime
is about 1 in 348146.
(mfh@lx01 ~/Research/NumberTheory/gimps) mprime -s -A1
Below is a report on the work you have queued and any expected completion dates.
M43194089, Lucas-Lehmer test, Fri Aug 15 13:48 2008
The chance that the exponent you are testing will yield a Mersenne prime
is about 1 in 357564.
(mfh@lx01 ~/Research/NumberTheory/gimps) mprime -v
Mersenne Prime Test Program, Version 24.14.2
(mfh@lx01 ~/Research/NumberTheory/gimps) uptime
 12:56:35 up 136 days, 22:58,  3 users,  load average: 2.01, 1.29, 0.05
(mfh@lx01 ~/Research/NumberTheory/gimps) which mprime
/usr/bin/mprime
(mfh@lx01 ~/Research/NumberTheory/gimps)

Would this really "improve its quality" ? — MFH:Talk 17:02, 5 June 2008 (UTC)[reply]

mersenne only ?

I'm not sure but I believe that mprime does not only check Mersenne numbers but can "treat" (whatever that means : ecm / gcd / P-1 / trial factor ? ...) any numbers of the form k*b^n+c . Some guru advice needed... — MFH:Talk 13:21, 10 January 2007 (UTC)[reply]

merge with Prime95

Even though there are OS specific issues, wouldn't it me reasonable to merge mprime with Prime95? — MFH:Talk 17:02, 5 June 2008 (UTC)[reply]

I agree. Prime95 and MPrime are basically the same thing. --Ixfd64 (talk) 16:47, 1 August 2009 (UTC)[reply]
Merge. It appears to come from the same source code, from the same site. Widefox (talk) 12:23, 29 November 2009 (UTC)[reply]
Merge. Agree with reasons above. Why hasn't this been done yet? :P —Per Hedetun (talk) 02:01, 29 December 2010 (UTC)[reply]

I've gone ahead and merged it with Prime95. --Ixfd64 (talk) 02:32, 19 February 2011 (UTC)[reply]