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 [URL=http://http://geocities.com/omboohankvald/indexmersenne.html]here[/URL]

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

The link was dead when i tried it :ermm:

Ahh... Sh*t! I accidentaly wrote http two times. Heres the link: [url]http://www.geocities.com/omboohankvald/indexmersenne.html[/url]

It looks fine to me, thanks for the help.

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

No response is good response in this case :smile: .

I've tried adding short descriptions of the projects [URL=http://www.geocities.com/omboohankvald/What.html]here[/URL] and once again I would ask if any of you would make sure I'm not writing something wrong :redface: . It's nothing big 'cause I'm focusing on making a site whereto people can say "look [URL=http://www.geocities.com/omboohankvald/indexmersenne.html]here[/URL] if you are n00b".

Thanks again

OH

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

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.

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.