![]() |
It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them. |
[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote] If you'd like, Gary and I can enter them on your behalf for you. |
[QUOTE=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/QUOTE] I still can, just send me the info. |
[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote] it isnt simple is it:smile: |
[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote] If you want them, did you know we have very specific detailed instructions for creating new prover codes at the beginning of this thread? I can almost guarantee if you follow them word for word, you'll get it. I intended the instructions for total newbs to prime searching. If you can do that complicated server stuff, you can certainly do it! (lol) Take a shot at it if you want. If you can get it figured out, I'll be glad to transfer the one that I entered for you over to you. Don't worry if you somehow 'mess up'. Any prover code goof can always be easily corrected by Prof. Caldwell. He's quite prompt at correcting them if requested to do so. If you don't want to mess with it, here's an interesting idea instead of a raffle: Whoever sees any future prime for you first gets to enter it as his own! It's as simple as that. What do people think of that? I'm at a disadvantage for the next 9 days while I'm out of town since I'm only on about 2X/day but that's not a big deal. You already gave me one. Edit: By first to see it, I'm referring to ANYONE currently doing searches for NPLB; not just the mods. It will make for an interesting scramble when you pop out another one. lol Gary |
507*2^562132-1 is prime
|
Actually, the first post is a wee bit confusing for the absolute newbie (not saying that to Ironbits, just in general). Here's a draft that I think is easier: (feel free to make changes to this draft or ignore it or use it how it is :smile:; the biggest difference is giving direct links instead of saying where the link is)
Instructions for submitting a top-5000 prime: Step 1: For people who have not submitted top-5000 primes previously, create a prover account: 1. Go to [URL]http://primes.utm.edu/bios/newprover.php[/URL]. 2. Fill out the form and submit it. You will be assigned a prover account. Step 2: Create a proof code: 1. Go to [URL]http://primes.utm.edu/bios/index.php[/URL]. 2. Next to 'search prover-accounts', type your last name and press enter. 3. Click on your prover account (there may be one or several) and press enter. 4. Towards the bottom, click on 'Create a New Proof-Code' and press enter. 5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 6. You should now have a list of proof programs. Select "Jean Penné's LLR". 7. In the space below all the programs, type in "Srsieve, PrimeSearch" ('Srsieve' for the sieving software and 'PrimeSearch' for the project). (Obviously if you did an individual-k search on your own, then the software may vary.) 8. You should now have a new proof code and can submit the prime. Example...L442. Step 3: Submit the prime: 1. Go to [URL]http://primes.utm.edu/bios/index.php[/URL]. 2. Next to 'search prover-accounts', type your last name and press enter. 3. Towards the bottom, next to 'Submit primes using the proof-code', click on your proof code and press enter. 4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'. OR 1-3. Go to (optionally bookmark) this URL with L000 replaced with your proof code and yourusername replaced with your user name: [URL]http://primes.utm.edu/primes/submit.php?code_str=L000&username=yourusername[/URL] 4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'. OR 1. Go to [URL]http://primes.utm.edu/primes/submit.php[/URL]. 2. In the first box, enter your user name 3. In the second box, enter your proof code. 4. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'. 5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'. (Step 3 is really long...maybe remove the last method or something? If the last method is removed, the 4 and 5 could be grouped with the 6 instead of in separate sections.) Here's what it currently is: [quote=gd_barnes;123340]Instructions for submitting a top-5000 prime: Go to [URL]http://primes.utm.edu/primes/home.php[/URL]. Step 1: For people who have not submitted top-5000 primes previously, create a prover account: 1. Select 'Submit' on the lower left side under 'Join in'. 2. Select the 'click here to create a prover-account' link in the middle of the page. 3. Fill out the form and submit it. You will be assigned a prover account. Step 2: Create a proof code: 1. Go to the home page in the link above and select 'Index' on the left side under 'Provers'. 2. Next to 'search prover-accounts', type yours and press enter. 3. Click on your prover account (there may be one or several) and press enter. 4. Towards the bottom, click on 'Create a New Proof-Code' and press enter. 5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 6. You should now have a list of proof programs. Select LLR. 7. In the space below all the programs, type in 'PrimeSearch' for the project and 'Srsieve' for the sieving software. Separate each selection by a comma. (Obviously if you did an individual-k search on your own, then the software may vary.) 8. You should now have a new proof code and can submit the prime. Example...L442. Step 3: Submit the prime: 1. Go to the home page in the link above and select 'Index' on the left side under 'Provers'. 2. Next to 'search proof-code', type your new code from step 2 and press enter. 3. Towards the bottom, next to 'Submit primes using this code as', click on your name (prover account) and press enter. 4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter. 5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'. 6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'.[/quote] |
How about a form box?
Login ... Please enter information below to submit prime. UserName: IronBits Select Type: LLR Input Prime: some long string <Click to submit> Click |
Excellent Mini-Geek! I don't have time to review it in detail but having the direct links helps the "true" newb. :smile:
Max, when you get a chance, can you do a quickie review of Mini-Geek's instruction suggestion here? If all looks good, you can edit the 1st post of this thread with his changes. It's nice to have helpful people around here! :smile: Gary |
Mini-Geek!!! :w00t:
Awesome instructions. :grin: Following your instructions, I was able to submit prime 821*2^561774-1 whoops! Max already had it listed. Do I just post confirmed in this thread now?? Someone check my home work please. |
[quote=IronBits;151390]Mini-Geek!!! :w00t:
Awesome instructions. :grin:[/quote] Thanks. :blush: [quote=IronBits;151390]Following your instructions, I was able to submit prime 821*2^561774-1 whoops! Max already had it listed. Do I just post confirmed in this thread now?? Someone check my home work please.[/quote] I don't think that's how posting confirmed works...after primes are submitted to, and before they are put on, the top 5000, they are double checked automatically. I'm pretty sure that codes and/or accounts are automatically deleted after a day or two with no prime, so you'll probably have to make that again next time you find a prime (in no other circumstances will you need to remake things like that with the same info). Edit: It looks like you already had an [URL="http://primes.utm.edu/bios/page.php?id=1399"]account[/URL] and had submitted primes, which means that it won't be deleted after a day or two. Were you not the one to actually do the entering before or something? |
| All times are UTC. The time now is 22:48. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.