Proofreading FAQ?

OmbooHankvald · 2005-07-06, 08:52

(I've already posted this in the PSP forum but I'll do it here too in case you don't visit the PSP forum very often)

Hi. I've tried to write a guide to how to operate PSP, S/R B5 and 321 from Mersenneforum.

I was wondering if any of you would bother proofreading it? I'm not an expert so I've probably screwed up somewhere.
Also, any suggestions would be great!
It can be found here

Don't get me wrong: you have an excellent instruction-sticky but I'm just trying to see if it's possible to simplify it a bit (for philantropic extreme-newbies).

Thanks in advance
OH

Footmaster · 2005-07-06, 09:29

The link was dead when i tried it

OmbooHankvald · 2005-07-06, 09:41

Ahh... Sh*t! I accidentaly wrote http two times. Heres the link: http://www.geocities.com/omboohankva...xmersenne.html

geoff · 2005-07-09, 01:29

It looks fine to me, thanks for the help.

OmbooHankvald · 2005-07-09, 08:44

Really? No major flaws? No f*ck-ups?

OmbooHankvald · 2005-07-13, 17:10

No response is good response in this case

.

I've tried adding short descriptions of the projects here and once again I would ask if any of you would make sure I'm not writing something wrong

. It's nothing big 'cause I'm focusing on making a site whereto people can say "look here if you are n00b".

Thanks again

OH

Note: I'm posting this in several of the forums

geoff · 2005-07-16, 03:10

The only omission I noticed is to say that we are looking for the smallest _even_ base 5 S/R numbers, since every odd number is trivially S/R when the base is odd.

geoff · 2005-09-17, 15:07

Note that while LLR can prove primality of base 2 numbers, for base 5 numbers it only does a probable prime test. This is the same as the probable prime tests done by PRP or PFGW.

PFGW can prove primality of base 5 numbers using a N-1 or N+1 test.

2005-07-06, 08:52	#1
OmbooHankvald May 2005 Copenhagen, Denmark 17² Posts	Proofreading FAQ? (I've already posted this in the PSP forum but I'll do it here too in case you don't visit the PSP forum very often) Hi. I've tried to write a guide to how to operate PSP, S/R B5 and 321 from Mersenneforum. I was wondering if any of you would bother proofreading it? I'm not an expert so I've probably screwed up somewhere. Also, any suggestions would be great! It can be found here Don't get me wrong: you have an excellent instruction-sticky but I'm just trying to see if it's possible to simplify it a bit (for philantropic extreme-newbies). Thanks in advance OH

2005-09-17, 15:07	#8
geoff Mar 2003 New Zealand 13·89 Posts	LLR Note that while LLR can prove primality of base 2 numbers, for base 5 numbers it only does a probable prime test. This is the same as the probable prime tests done by PRP or PFGW. PFGW can prove primality of base 5 numbers using a N-1 or N+1 test.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Proofreading the Server info	Joe O	PrimeNet	10	2006-07-27 23:05
Proofreading my FAQ?	OmbooHankvald	Prime Sierpinski Project	44	2005-09-26 22:06
distributed proofreading	adpowers	Lounge	10	2004-11-05 01:54

2005-07-06, 09:29	#2
Footmaster Mar 2004 3×13 Posts	The link was dead when i tried it

2005-07-06, 09:41	#3
OmbooHankvald May 2005 Copenhagen, Denmark 17² Posts	Ahh... Sh*t! I accidentaly wrote http two times. Heres the link: http://www.geocities.com/omboohankva...xmersenne.html

2005-07-09, 01:29	#4
geoff Mar 2003 New Zealand 13·89 Posts	It looks fine to me, thanks for the help.

2005-07-09, 08:44	#5
OmbooHankvald May 2005 Copenhagen, Denmark 17² Posts	Really? No major flaws? No f*ck-ups?

2005-07-13, 17:10	#6
OmbooHankvald May 2005 Copenhagen, Denmark 17² Posts	No response is good response in this case . I've tried adding short descriptions of the projects here and once again I would ask if any of you would make sure I'm not writing something wrong . It's nothing big 'cause I'm focusing on making a site whereto people can say "look here if you are n00b". Thanks again OH Note: I'm posting this in several of the forums

2005-07-16, 03:10	#7
geoff Mar 2003 New Zealand 13·89 Posts	The only omission I noticed is to say that we are looking for the smallest _even_ base 5 S/R numbers, since every odd number is trivially S/R when the base is odd.