[quote=kar_bon;157742]try
[code]
type *.txt >all.txt
[/code]this will 'copy' (actually list) all *.txt-files in one file called 'all.txt' without the $1A-value at the end![/quote]

Thanks Karsten. I'll try that.


Gary

[quote=gd_barnes;157743]Added a quad to the fun. I will likely add 3 more cores later today. :smile:
...

Gary[/quote]
In that case, you will reach a score 0f 1000,000 real quick. :smile:
[URL]http://stats4.free-dc.org/stats.php?page=user&proj=nplb&name=gd_barnes[/URL]

copy /b part1 + part2 + part3 file.ext

Brrrrrrrrrrr Carlos!

this drive is convicing me that we need a kind of score system for llrnet results
with this drive i have jumped from 2 primes to over 10 with very little effort
also my number of pairs tested has rocketed

[quote=gd_barnes;157743]Max, it might be best to go ahead and process the results in ranges of 100k (actually ~50 k's), i.e. k=1005-1100, 1100-1200, etc. As soon as you see that the first k/n pair is k>=1101, then you can go ahead with it.

As soon as I can after getting the file from you, I'll start compiling a list of primes and finders. THAT should be interesting! lol[/quote]Okay. I see that the first k/n pair remaining in the server is for k=1107, so it's all set for me to process the results any time now.

One quick question: would you prefer the results for each 100-k range sorted by k or by n within that k-range? My scripts are designed to sort by n, but I should be able to modify them to sort by k if need be. Of course, even if I do end up sorting them by n, I'd still have to re-sort the sieve file...so, I'm going to end up having to change *something* either way. Though, of course, either modification should be pretty easy, so I'm fine with either way. :smile:

[quote=mdettweiler;157809]Okay. I see that the first k/n pair remaining in the server is for k=1107, so it's all set for me to process the results any time now.

One quick question: would you prefer the results for each 100-k range sorted by k or by n within that k-range? My scripts are designed to sort by n, but I should be able to modify them to sort by k if need be. Of course, even if I do end up sorting them by n, I'd still have to re-sort the sieve file...so, I'm going to end up having to change *something* either way. Though, of course, either modification should be pretty easy, so I'm fine with either way. :smile:[/quote]

Sort by k primary and n secondary. I'll be matching them with the original results, which are sorted by k then n. Also, the primes listing will need to be by k then n.


Gary

Guys, don't get too excited about this score thing for all the results and primes for this effort.

The scoring should be far lower for each pair and prime. Actually, it needs to be the same as calculated on the top-5000 site. That is:

A result at n=600K should score 36 times as much as a result at n=100K.

A prime at n=600K should score 216 times as much as a prime at n=100K.

That is correct, it takes 216 times as much CPU time to find a prime at n=600K vs. 100K and 36 times as much CPU time to process a result at n=600K vs. 100K.

That said, don't pull any machines off. I just wanted to point out that while this is a fun effort, it shouldn't score any higher than other efforts for the amount of CPU time expended.


Gary

I added one core for a couple of days for a little of this fast fun.

[quote=gd_barnes;157828]Sort by k primary and n secondary. I'll be matching them with the original results, which are sorted by k then n. Also, the primes listing will need to be by k then n.


Gary[/quote]
Okay, thanks--I'll get the results processed tomorrow (probably late afternoon or evening). Feel free to bug me if they're still not done by Sunday morning. :razz:

[quote=mdettweiler;157856]Okay, thanks--I'll get the results processed tomorrow (probably late afternoon or evening). Feel free to bug me if they're still not done by Sunday morning. :razz:[/quote]


By mid-day Sunday, we'll be done up to k=1200. If you wait until then, you may as well do k=1000-1200. lol

Moved discussion about the weather to a separate thread.