[I]rip[/I] freeze st([B]r!p[/B])s

( a shotlution )

thx f°r brrrrrrr ...

[URL="http://factordb.com/distribution.php"]now focus on glogerr 11002[/URL]

[QUOTE=wblipp;270179]Syd,

I'd like to help the factordb get better at recognizing algebraic factors of cyclotomic numbers - currently it misses many of these. I have competence is SQL, C, and other programming languages. Would you welcome collaboration on a programming level, or would you prefer that I explain the improvements I envision, or would you prefer I just go away because you are too busy?

William[/QUOTE]

[QUOTE=Syd;270186]William,

I know about the paper and the algorithm that could be used to recognize algebraic factors, but I dont understand it at a level to be able to implement it. Any help is appreciated here! Currently its implemented in php and uses the internal data structure I also use to parse the terms. If you are interested I'll send the code over

- Syd[/QUOTE]

Any progress with the algebraic factors? I'd really like to see the db handle that.

az ... time on fly

Here's a list of errors I found under the Sequences section of factordb, regardless of what sequence type I choose (Home prime, Inverse home prime, Aliquot, etc.):

10[sup]9[/sup] shows up as 3 digits instead of 10
3[sup]1000[/sup] shows up as 470 digits instead of 478
10[sup]100[/sup] shows up as 94 digits instead of 101
2[sup]912[/sup] shows up as 267 digits instead of 275
911[sup]419[/sup] shows up as 1235 digits instead of 1241

Here's proof: [URL="http://www.factordb.com/sequences.php?se=1&eff=2&aq=10%5E100&action=all&fr=0&to=100"]http://www.factordb.com/sequences.php?se=1&eff=2&aq=10%5E100&action=all&fr=0&to=100[/URL]
Why is this happening? It happens with any number of the form x[sup]y[/sup], no matter what x and y values I use. Could you please fix that?

Another error.
Smallest numbers without known factors (97 digits):
1210015
1210004
1210008
1210005
1210000
1210001
1210010
1210013
1210008
1210007
They are 7 digit numbers and factorized!!.

[QUOTE=mataje;275088]Another error.
Smallest numbers without known factors (97 digits):
1210015
1210004
[snip]
They are 7 digit numbers and factorized!!.[/QUOTE]Hmmm.....someone's managed to confuse the parser with another formula.

1210015 = 2^300*1210015-(2^1061-1)%2^300*1210015

1210004 = 2^300*1210004-(2^1061-1)%2^300*1210004

Do you suppose they have fun doing that?

Can you please make it possible to prove really large numbers >50000 digits of the form k*b[SUP]n[/SUP]+1 or k*b[SUP]n[/SUP]-1 with the included P+1 or P-1 algorithm? It keeps saying "Too big to be tested at the moment".

Here's an example number:
9*10[SUP]364521[/SUP]-1
It's a PRP at the moment. Why can't I use the P+1 algorithm on it? Also, when I put in the known Mersenne primes >500000 digits, they show up as U (unknown) instead of P (prime). All smaller Mersenne primes show up as primes. :huh: Please fix that. Maybe you could put a Lucas-Lehmer test option under "Primality" when the number is of the form k*b[SUP]n[/SUP]-1. Also, Please fix the problem where it says "error: Maximum length exceeded 2,000,000 digits (Factorial)". I want to see what the factors of 8675309!-1 are (it has 56,424,131 digits). When will this site ever be able to handle 100 million digit numbers?

"Report factors" doesn't seem to work. (GMP-ECM output)

Anyone else having trouble?

[QUOTE=lorgix;276098]"Report factors" doesn't seem to work. (GMP-ECM output)

Anyone else having trouble?[/QUOTE]
I didn't try GMP-ECM, but I was successful with some elf file lines a few minutes ago...

What happened to BOINC?