mersenneforum.org  

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

 
 
Thread Tools
Old 2004-03-19, 17:17   #1
TTn
 

13×271 Posts
Default RMA Feedback

Please let me know what you think of RMA.
Available here:
http://www.15k.org/rma/rma.rar

Extract contents of all 19 cabs into a new folder, and name it RMA.
I cant see why anyone would want to hunt for primes of these forms, without a program like RMA. Once you try it you'll never go back.
The next version will have an option to choose new/old test file, as well as the being fully automated.
 
Old 2004-03-19, 23:53   #2
Citrix
 
Citrix's Avatar
 
Jun 2003

22×397 Posts
Default

Quote:
Originally Posted by TTn
I cant see why anyone would want to hunt for primes of these forms, without a program like RMA. Once you try it you'll never go back.

What's so good about RMA? Why should one shift from LLR/PRP to RMA? Is it faster?

It terms of size it is not good as it is over 7 Mb comapred to less than 2 Mb
for LLR/PRP.

Citrix
Citrix is offline  
Old 2004-03-27, 10:24   #3
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

I'd also like to learn more about RMA. Actually I tried a download but
one of the files was missing and it didn't work. Not knowing what's all
this about I gave up.
Kosmaj is offline  
Old 2004-04-24, 20:56   #4
TTn
 

2×11×127 Posts
Thumbs up RMA RELOADED! must see

Citrix
Kosmaj

It is faster to use this program for any form(preferences) of Riesel or Proth, because the user can interface one single program and keep tabs on it.

It now sieves old file.

It is now 2Mb, including all softwares. (SMALL)

The setup now installs on all machines.

Tone is actually sounded when prime is found.
Updated on main screen.
 
Old 2004-04-25, 04:26   #5
Citrix
 
Citrix's Avatar
 
Jun 2003

63416 Posts
Default

Just an idea!
If you sieve M32, M33 and all other numbers together, you will be able to sieve deeper and faster on an overall basis, but you will have to write a sieve for yourself, because none of the available sieves can do so.

Citrix
Citrix is offline  
Old 2004-04-30, 18:17   #6
TTn
 

AA16 Posts
Default

Yes, but I think it is easier and more practical, to use the field multiple included with RMA. This allows as many contiguous general Mersenne numbers, as you want. You can ensure that the multiple is big enough to connect to the next Mersenne prime. Ofcourse using the salvage strategy after each prime found.
 
Old 2004-08-22, 01:59   #7
TTn
 

100110110000012 Posts
Post RMA definition

Integer sequence for RMA

PS
Quite a lapse in the dates...

Last fiddled with by TTn on 2004-08-22 at 02:03 Reason: xtra
 
Old 2004-11-21, 07:07   #8
TTn
 

537710 Posts
Thumbs up RMA 1.7 beta

Please help me beta test RMA 1.7!
Download here, from the files list:
http://groups.yahoo.com/group/primeform/

Insert RMA into the same folder as LLR, and NewPGen.
Insert a Mersenne prime into the text boxes, and start testing!

Last fiddled with by TTn on 2004-11-21 at 07:09
 
Old 2004-11-21, 14:39   #9
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

1110001001102 Posts
Default

I got it, and I can start it (Win-2k) but can you provide an example of how to use it. What do you mean by "Mersenne": k=1, n=216091 for example, or what you call "generalized Mersenne" with k>1 ? I tried the above real Mersenne but it shows error telling about a missing input file. I put in the same directory LLR-2.2 and NewPgen but nothing else. Or/and can you provide the Instructions.txt file which is supposed to open on Help->Instructions.

Last fiddled with by Kosmaj on 2004-11-21 at 14:49
Kosmaj is offline  
Old 2004-11-21, 18:31   #10
TTn
 

947810 Posts
Thumbs up starting rma

Yes you can try k=1, and n=216091, or any other mersenne prime exponent.
The intructions, were not included to save space at the forum.

I see, you have not chosen the preference for a new, or old file.
You are trying to just start an old file, without having made one to start.
This is a safety issue, so that you must save your preference, before it will overwrite an existing file. As opposed to newpgen.


Quote:
i got it, and I can start it (Win-2k) but can you provide an example of how to use it. What do you mean by "Mersenne": k=1, n=216091 for example, or what you call "generalized Mersenne" with k>1 ? I tried the above real Mersenne but it shows error telling about a missing input file. I put in the same directory LLR-2.2 and NewPgen but nothing else. Or/and can you provide the Instructions.txt file which is supposed to open on Help->Instructions.

Here are a few pointers:
Kosmaj,
You can change priority at any time, and on the next loop, the proper cycles will be adjusted. For larger Mersenne's use "priority auto".

Do not change time, during a timer loop.(only when not testing)

Master File integration, is used for recycling the old newpgen file, after a prime is found. With this not checked an entire new file is created.(safer)

Rma disabled, is a function for those who want to just use the softwares automation between LLR, and NewPGen.

Last fiddled with by TTn on 2004-11-21 at 18:46
 
Old 2004-11-22, 05:30   #11
TTn
 

11101011000012 Posts
Default RMA 1.7 instructions

RMA Version 1.7 Instructions

In the Help/contents tab of Newpgen it states:
"In general, you ought to sieve until the rate at which NewPGen is
throwing out composites is equal to the rate at which Proth/PRP/PFGW/LLR
can perform a primality test on the numbers. Actually, you should stop a little sooner -
the idea is to find primes, after all."(Paul Jobling)
This is
__________________________________________________________________


Choose your preferences first, this evaluates the form of the prime.
If this is the first use, then you will have to choose "Sieve/Test New File".
Next decide the k, and n that you would like to test.
Insert them, into the appropriate text boxes.

Parameter limits
k should not be any larger than 1,000,000,000 (1 billion)
n should not be much larger than 340,000,000 (340 million)
$100,000 (Ten million digit primes have a n, larger than 33,219,276.)
$150,000 (Hundred million digit primes have an n, larger than 332192805.)
The field value, should be small, ie 1-1000. Depending on the size of n, you choose.

FULL AUTO
---------
This is the default mode. It also enables the Riesel Mersenne Algorithm.
Click "Sieve" to start sieve/testing.
Click "Stop Sieve", to stop testing. To resume click sieve again.
To save any preferences, just click "File", "Save", or "Exit" will also save.
Upon exit, RMA will thank you and close.
{Note: do not close RMA X (top right) without saving first.}


SEMI AUTO {Using full auto, is better so the user can adjust priority during testing.}
---------
Click Sieve
Wait 5 to 10 seconds
Click Stop sieving
Exit NewPGen properly, using the menu's file exit.

Click Test
LLR/PRP should begin testing, if not click Test/Input data/Ok.
Watch the time per iteration, on the lower right hand side of the screen.
(make sure no other processes are running during estimate)
Now multiply that(slightly changing number) by the exponent n, that you've chosen.
Divide that number by 1000, and that is the estimated number of seconds
it takes to test a candidate. Record this number !
Stop testing
Exit LLR/PRP properly, using the menu's file exit.
On the top menu of RMA choose "Preferences", "NewPGen Services", and "Input estimation"
Now input the number you've recorded !( seconds per k)
Click Ok, and wait until Newpgen finishes sieving.
When done Click Test, again to test all remaining candidates.
If the file is very large, you may want to repeat this process,
by stoping LLR/PRP about half way through the file.(Status check)
Then click the services menu on RMA, and click "Input estimation".
And Click continue sieving an old file, then point to the same file as,
both the new input and output file. Click Start again, again, and repeat if nessesary.

MANUAL
------
You guessed it! Just calls LLR, or NewPGen.


If you find a prime:
Great! You've found a prime.
If you have been testing a prime larger enough, then you can now submit it to Chris Caldwell's
database of the top 5000 largest prime numbers. Post the prime at the forum as well,
so others can keep up to date with your progress, and not duplicate your work.
The data of RMA's distribution, can be used to study, and cross reference the distribution,
of Mersenne primes. Send me the lresults.txt
for the double checking of it's residues. Email: divineprime@yahoo.com
Also note, if you had any sum-input/output errors, or problems during the tests etc.



______________________________________________________

Menu function discriptions:

File:
RMA configuration save.
RMA exit file.

Preferences:
Access to the same newpgen options, and services.
I added a small input service, for semi-auto testing.

Testing, new or old file.
Testing options, are specifically for LLR.
Other softwares can be called up(if in same folder), with no automation yet.

Full auto
Semi auto
manual

RMA options include,
Master File integration.(Static will be included in 1.7, allowing for a larger reference file.)
Priority, auto/llr/newpgen/50-50.
Set Timer(onlywhen not testing, this is an oops bug)
Visability of LLR, and NewPGen.
Voice, that sounds when prime is found, and other events.
Submit option, for when a prime is found. The web page is called up.
RMA, can be disabled so that just the automation takes place.

Riesel
Proth
Twin

Even k
Odd k
All k

Fixed k (any k)
Fixed n (15k)




This file will surely be re-vised after everyone's input!
 
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Msieve 1.50 feedback firejuggler Msieve 99 2013-02-17 11:53
Msieve v1.49 feedback Andi47 Msieve 146 2012-05-03 06:53
Msieve v1.48 feedback Jeff Gilchrist Msieve 48 2011-06-10 18:18
Msieve v1.47 feedback jasonp Msieve 38 2011-02-09 18:36
Msieve v1.46 feedback em99010pepe Msieve 153 2010-12-12 14:21

All times are UTC. The time now is 03:06.


Wed Sep 28 03:06:06 UTC 2022 up 41 days, 34 mins, 0 users, load averages: 0.73, 0.76, 0.85

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔