![]() |
![]() |
#1 |
Sep 2008
Krefeld, Germany
2·5·23 Posts |
![]()
Hello,
i think of programming a factor database with web interface to search and report factors, anybody knows if something similar already exists? Is there a need for something like this? Syd |
![]() |
![]() |
![]() |
#2 |
Mar 2008
5×11 Posts |
![]()
Certain projects have their own. The homogeneous cunningham project has a rather simple one. You can reserve a number, and then submit factors which you found. I think a lot of the actual tables in most projects are still manually updated (at least submitted data is checked by a human in some way.)
I haven't seen a "general system" created by someone, however. |
![]() |
![]() |
![]() |
#3 |
Jun 2008
23×32 Posts |
![]()
I always like the idea of gathering data and automated processing.
Two things however: if you also want to store things like search statistics about cofactors, that might prove to be a hell of a job, taken into account that special numbers have special factors etc. Secondly: if it were to be successful, I suppose such a generic database needs a lot of computing power to check things like primality of submitted factors. [edit] Do you have a draft of the design? I'd be happy to comment. I have some hobby-wise experience with creating a CMS and web interface driven apps. Last fiddled with by J.F. on 2008-12-12 at 07:26 |
![]() |
![]() |
![]() |
#4 | |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
28×41 Posts |
![]() Quote:
Paul Last fiddled with by xilman on 2008-12-12 at 12:29 Reason: fix typoo |
|
![]() |
![]() |
![]() |
#5 |
Mar 2008
5×11 Posts |
![]()
I've been slowly designing one for keeping up with my NFS factorizations as I learn more. Also, I've been working on something that will more intelligently split the workload between a few systems I have. Just doing the even/odd thing with factMsieve or factLat doesn't work well when one system is 64-bit dual core, the other is a dual P3. one is just 5x faster than the other and thus a lot of the lower ranges don't get sieved. I get these evenly spaced holes.
|
![]() |
![]() |
![]() |
#6 |
"William"
May 2003
New Haven
23·5·59 Posts |
![]()
Last week I made a first draft schema for an SQL database for factorization information of interest to me. I was planning to use MS SQL because it's available to me and I use it at work. In the factorization part I'm still considering options for storing factors - large factors need a representation method and small factors could share it or could use a native integer representation.
|
![]() |
![]() |
![]() |
#7 |
Sep 2008
Krefeld, Germany
2×5×23 Posts |
![]()
I'm finally done with it, it was a hell of work! A lot more than i thought it would be.
The first difficult part was the scanner/parser, it has to modify the expressions used and notice if they are actually the same, take care of operator priority and so on. There is still one bug in it, x^y^z is taken as (x^y)^z, not x^(y^z) and maybe some i didnt notice. Next comes the tricky part: Special numbers can have factors that are special numbers, too. If a factor is submitted, all numbers above also have this factor, numers below it also may have this factor. I simplified this a little bit by using 3 tables: factor <factorid, shortform, Maybe longform, digits, type enum(prime, prp, composite, unknown_too_big)> hasfactor <factorid, factorid> cofactor <factorid, factorid> hasfactor contains all factors of a factor which are prime or where no factors are known, if a factor has been factorized, it moves to cofactor. If a factor is submitted, it looks up recursively and adds the factor to every number found, modifies its type, next it goes down recursively and checks which numbers divide it. http://factorization.ath.cx/search.php If you give it a try, i'd be happy to read some comments ![]() |
![]() |
![]() |
![]() |
#8 |
Mar 2008
5×11 Posts |
![]()
Ok, I'll post a quick one, what does it do?
I see a text box, and a button that says search. Search for what? |
![]() |
![]() |
![]() |
#9 |
Sep 2008
Krefeld, Germany
2·5·23 Posts |
![]() |
![]() |
![]() |
![]() |
#10 | |
Banned
"Luigi"
Aug 2002
Team Italia
2·5·479 Posts |
![]() Quote:
![]() It works fine, but maybe there should be a warning about limits of the search. Luigi |
|
![]() |
![]() |
![]() |
#11 | |
Sep 2008
Krefeld, Germany
111001102 Posts |
![]() Quote:
![]() Syd |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Database for k-b-b's: | 3.14159 | Miscellaneous Math | 325 | 2016-04-09 17:45 |
Factoring database issues | Mini-Geek | Factoring | 5 | 2009-07-01 11:51 |
database.zip | HiddenWarrior | Data | 1 | 2004-03-29 03:53 |
Database layout | Prime95 | PrimeNet | 1 | 2003-01-18 00:49 |
Is there a performance database? | Joe O | Lounge | 35 | 2002-09-06 20:19 |