![]() |
Just out of curiosity, what are the current stats on the DB: size, prime count, etc....?
|
[quote=frmky;168121]It's just me dumping a few elf files in. Don't worry. It's only taking up one worker, and it'll clear shortly. :smile:[/quote]
The numbers are still going up - about 15 extra numbers per second. Shortly after the invention of "very high limits", someone put M1061 in the queue. Now the C254 from M961 is in the queue. Edit: It isn't any more! Edit2: The rate of numbers being put in to the primality queue is fluctuating wildly - at one point it was about 100 per second. Edit3: There is a C83 being sieved. On the worker status page, it is given as "Working on <number> since <time sieving so far>. Could you replace "since" with "for"? That is not what "since" means. |
squares of 4+ digit primes
I just reported the .elf file of aliquot sequence 184578, which 10metreh [URL="http://www.mersenneforum.org/showpost.php?p=168727&postcount=16"]has posted[/URL], to the database and noticed the following:
Line 1714 contains 7069^2 as a factor. All lines which follow this line have not been shown, because on importing the .elf file, the database took the squared 4-digit prime as an unfactored composite. Anyway, clicking "TF to 1e6" in such a case does the trick (once you see the small unfactored composite.) |
[QUOTE=10metreh;168744]That is an offence. Please correct it.[/QUOTE]
He, take it easy. Mistakes happen. |
[QUOTE=10metreh;168744]That is an offence. Please correct it.[/QUOTE]
Sorry. This was neither intended as an offence, nor as an offen[COLOR="Red"]s[/COLOR]e. This was just a typo. P.S.: smh was faster by a few seconds when I intended to correct it. |
[quote=smh;168745]He, take it easy. Mistakes happen.[/quote]
The whole "offence" thing was a joke. :smile: I've deleted the original post. |
I have two requests that hopefully should be easy.
Could we have a mod function with the % sign? Could we have a way of using the previous iteration as a variable in a formula? |
I have a question. Does the database query itself when doing p+1 and p-1 testing? That is, if there's a hard composite 1 away from a number to be factored, but it's already been factored in the database, is that used?
|
flat output
Scripting issue:
I want to query the database to get all factors of completely factored Mersenne's. Is there an easy way to get a flat output of let's say M823? [URL]http://factorization.ath.cx/search.php?query=M823[/URL] I'd rather not have to work through the HTML stuff; it would be nice if all digits of factors were visible. Perhaps someone already has scripting I can use? Or: Syd, could you make a switch like "?outputtype=flat" or something? |
Nevermind, I think I can work-around the problem with the format I just found on
[url]http://factorization.ath.cx/search.php?query=Mx&v=x&x=200&EC=1&E=1&Prp=1&P=1&C=1&FF=1&CF=1&of=T&pp=50[/url] |
[QUOTE=J.F.;169762]I want to query the database to get all factors of completely factored Mersenne's. [/QUOTE]
Are you are that Will Edgington already provides this service in the file factoredM.txt? [url]http://www.garlic.com/~wedgingt/mersenne.html[/url] William |
| All times are UTC. The time now is 21:04. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.