Questions and stuff - Page 16

vaughan · 2012-02-29, 02:18

I'm having a problem with the PRPnetclient.exe

It started with an Intel E8400 Wolfdale CPU based system. Now it has occurred on an Intel Q8200 quad-core system also. Both are running Windows 7 Ultimate 64-bit edition. Both computers were happily running NPLB prpnet on port 2000. Now they throw a message "prpclient.exe has stopped working" and below this heading it says "A problem caused the program to stop working correctly. Windows will close the program and notify you if a solution is available." It doesn't. This occurs when the start batch file is initiated. On the quad only 2 of the cores crash, so it leaves 2 instances (in separate sub-directories as per Lennart's batch file) running.

I tried re-installing the client using the install batch file right over the top of the existing files. Didn't help.

I'm stuck. Any ideas?

Lennart · 2012-02-29, 02:27

Quote:

Originally Posted by vaughan

I'm having a problem with the PRPnetclient.exe

It started with an Intel E8400 Wolfdale CPU based system. Now it has occurred on an Intel Q8200 quad-core system also. Both are running Windows 7 Ultimate 64-bit edition. Both computers were happily running NPLB prpnet on port 2000. Now they throw a message "prpclient.exe has stopped working" and below this heading it says "A problem caused the program to stop working correctly. Windows will close the program and notify you if a solution is available." It doesn't. This occurs when the start batch file is initiated. On the quad only 2 of the cores crash, so it leaves 2 instances (in separate sub-directories as per Lennart's batch file) running.

I tried re-installing the client using the install batch file right over the top of the existing files. Didn't help.

I'm stuck. Any ideas?

Save the resultfiles in prpclient-# folder then delete all prpclient-# folders.

Run install # core then update # core then start and it should work.

This is only a fast way to get it running again. You don't have to save the resultfiles if you don't need them.

Lennart

vaughan · 2012-02-29, 06:56

Thanks Lennart, that worked for both machines.

vaughan · 2012-11-19, 13:55

Question: Do all Prime Numbers occur next to a number divisible by 6?
Eg 17 is next to 18.

firejuggler · 2012-11-19, 13:59

yep, 1 mod 6 , -1 mod 6 or 5 mod 6.

meaning a prime will be of tthe form (x*6) plus or minus one

jnml · 2012-11-20, 08:47

Quote:

Originally Posted by vaughan

Question: Do all Prime Numbers occur next to a number divisible by 6?
Eg 17 is next to 18.

No.

LaurV · 2012-11-20, 08:51

Quote:

Originally Posted by jnml

No.

the (only) exceptions are 2 and 3

vaughan · 2012-11-20, 15:46

Quote:

Originally Posted by LaurV

the (only) exceptions are 2 and 3

I agree with you LaurV.

Anybody else able to add to the discussion?

AMDave · 2012-11-20, 23:14

just for giggles I tested the first 100,000 primes and this is true for
3 < prime <= 239737
However there is no discernible pattern for whether the mod6 'seed' is 1 above or 1 below.
I sent you the worksheet

gd_barnes · 2012-11-21, 00:21

There is no need to test. It can be easily proven that all primes > 3 must be either p==(1 mod 6) or p==(5 mod 6). Proof:

p==(0 mod 6) is always divisible by 2 and 3
p==(2 mod 6) is always divisible by 2
p==(3 mod 6) is always divisible by 3
p==(4 mod 6) is always divisible by 2

This leaves p==(1 mod 6) and p==(5 mod 6) as the only possible primes mod 6.

Stargate38 · 2012-11-21, 00:53

If you convert the primes into base-6, you'll notice that, except for 2 and 3, they all end in 1 or 5. That's easy proof.

2012-11-21, 00:53	#176
Stargate38 "Daniel Jackson" May 2011 14285714285714285714 3·251 Posts	If you convert the primes into base-6, you'll notice that, except for 2 and 3, they all end in 1 or 5. That's easy proof. Last fiddled with by Stargate38 on 2012-11-21 at 00:53

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Some old stuff	Batalov	Miscellaneous Math	1	2017-01-27 04:56
Stuff for sale	fivemack	Lounge	12	2011-06-12 11:28
useful stuff	paulunderwood	Linux	3	2005-12-05 22:18
Free stuff...	Xyzzy	Software	6	2004-10-06 13:35
Extra Stuff...	Xyzzy	Lounge	11	2003-09-15 23:22

2012-02-29, 02:18	#166
vaughan Jan 2005 Sydney, Australia 5×67 Posts	I'm having a problem with the PRPnetclient.exe It started with an Intel E8400 Wolfdale CPU based system. Now it has occurred on an Intel Q8200 quad-core system also. Both are running Windows 7 Ultimate 64-bit edition. Both computers were happily running NPLB prpnet on port 2000. Now they throw a message "prpclient.exe has stopped working" and below this heading it says "A problem caused the program to stop working correctly. Windows will close the program and notify you if a solution is available." It doesn't. This occurs when the start batch file is initiated. On the quad only 2 of the cores crash, so it leaves 2 instances (in separate sub-directories as per Lennart's batch file) running. I tried re-installing the client using the install batch file right over the top of the existing files. Didn't help. I'm stuck. Any ideas?

2012-02-29, 06:56	#168
vaughan Jan 2005 Sydney, Australia 5×67 Posts	Thanks Lennart, that worked for both machines.

2012-11-19, 13:55	#169
vaughan Jan 2005 Sydney, Australia 101001111₂ Posts	Question: Do all Prime Numbers occur next to a number divisible by 6? Eg 17 is next to 18.

2012-11-19, 13:59	#170
firejuggler "Vincent" Apr 2010 Over the rainbow B44₁₆ Posts	yep, 1 mod 6 , -1 mod 6 or 5 mod 6. meaning a prime will be of tthe form (x*6) plus or minus one

2012-11-20, 23:14	#174
AMDave Jan 2006 deep in a while-loop 2²·167 Posts	just for giggles I tested the first 100,000 primes and this is true for 3 < prime <= 239737 However there is no discernible pattern for whether the mod6 'seed' is 1 above or 1 below. I sent you the worksheet

2012-11-21, 00:21	#175
gd_barnes "Gary" May 2007 Overland Park, KS 10111000010001₂ Posts	There is no need to test. It can be easily proven that all primes > 3 must be either p==(1 mod 6) or p==(5 mod 6). Proof: p==(0 mod 6) is always divisible by 2 and 3 p==(2 mod 6) is always divisible by 2 p==(3 mod 6) is always divisible by 3 p==(4 mod 6) is always divisible by 2 This leaves p==(1 mod 6) and p==(5 mod 6) as the only possible primes mod 6.