mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > 15k Search

 
 
Thread Tools
Old 2003-06-05, 19:13   #1
TTn
 

69516 Posts
Default NOVICE INSTRUCTIONS & EXPERT

If you have any trouble with these instructions, please email 15k@strikepoint.com and I will help you through it step by step.

Novice users,
Make sure you email me, the 15k you have chosen.
First you make a new folder, and name it LLR.
Then download both zips.Newpgen & LLR
Unzip them into new LLR folder you've made, by using winzip.
Now place the LLR folder in your documents.

Start NewPGen.
Create a new file by naming the Output file, as your chosen 15k.txt
Choose base 2.
Choose Type k.b^n-1 with k fixed, by scrolling down.
Insert your 15k into the k window.
Insert 164000 into the nmin window.
Insert 220000 into the nmax window.
Now select the Options menu up top,
and check the use two save files so you wont loose any data.
Now press Start, EXPERTS CAN SKIP TO THE NEXT SECTION
Let the program run for a complete 24 hours.
When done press Stop.
You will now have a text file that is ready for LLR.

Start up LLR, it will come up red when in-active.
Click, Test / Input Data
Insert 15k.txt as the input file of LLR
Insert Primes.txt as the output file of LLR
Insert 1 as the starting line of the file.
Click OK, it should turn green, and start right up testing the file.
If it does not then click Test / Input Data / OK
Which should re-initialize the configuration settings.
Good luck, It should run for about a week or so.
You may decide to continue testing the same 15k, if you get good enough results. Or at any time you may decide to quit if your results are not so good.
When you find primes submit them to the forum, and Chris Caldwell's top 5000.

OPTIONAL
AUTORUN LLR
Click options, and check start at boot up.
If you are running XP, you will also have to add LLR to the start menu like so:
Click Windows start / settings / control panel / taskbar and start menu / start menu /
customize / add / browse, and point to green LLR in your documents / OK / next /
startup / next / finish.
FIND PRIMES ON YOUR DESKTOP
Check primes daily, by creating a shortcut to the Primes.txt and placing it on your desktop for easy reference.(primes will not appear while the text is open)
__________________________________________________________
Ok now you've found a prime. SUBMIT IT HERE

EXPERT USERS
Start a Newgpen file, and then stop it, when the rate is 1 n per second.
(Take note of the how many n's are left.)
Now test, the largest number of the file,
by inputing the number of n's left into, the LLR starting line number.
Make sure nothing else is running during this test, for accuracy.
(Take note of how many seconds it takes to test that last number.)
Now continue sieving the old newgpen file, and choose the option to sieve until rate is__ seconds per k. Ignore that k and n are opposite, and input the number of seconds it took to test the last number, and click start! NewGpen will automatically stop when it can no longer sieve faster than LLR can test.
<edit> SD - Update ranges for top 5000 list - n ranges were 116000-155000 </edit>
<edit> SD - Changed e-mail address from TTcreation@aol.com to 15k@strikepoint.com </edit>

Last fiddled with by SlashDude on 2004-06-07 at 04:27
 
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Novice Q how long it take..... abumichal Programming 46 2013-12-03 21:31
Any TI/AM35x/Sitara/WinCE6 expert around? LaurV Lounge 0 2012-12-27 10:00
Which range with which dat (expert discussion) hhh Prime Sierpinski Project 19 2007-10-29 08:26
please help me, cal expert tinhnho Homework Help 11 2007-09-25 12:24
ECM question from a novice EbonezerCabbage Miscellaneous Math 3 2006-04-13 00:03

All times are UTC. The time now is 23:59.

Fri Dec 4 23:59:19 UTC 2020 up 1 day, 20:10, 0 users, load averages: 1.11, 1.61, 1.58

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.