Shoot. I knew that c169 was 3 (mod 4), so the hopes were low, but not as low as they turned out. Still 2^5, man.

Next line is an easy c125 (so far).

Ooops...make that an even easier c104....left as an exercise for the reader :grin:

The reader is running gnfs... :devil:

[QUOTE=Batalov;197436]The reader is running gnfs... :devil:[/QUOTE]

Stop gnfs'ing. I clicked "quick ecm" a couple of times, before seeing that you were factoring it, and an easy p26 popped out. Sorry about that.

edit: or did you happen to submit it?

[QUOTE=schickel;197431]Just walked in the door from work to this:[code][2009-12-01 03:22:29 GMT] Factor returned by schickel@psln.com:server:v2.1a! a4788.c169 / 246867439541623785917452977412081734719211487:probable:32592798509311135674308419327488775229812399824613803365165161633979950190408523081434602797123630458924959977397735854806101:Probable finder: schickel@psln.com:Machine_1:v2.0k B1:43000000 sigma: 863597136
[/code]Not even turned into the the DB yet....

Edit: Only 161 curves!![/QUOTE]

Nice. I finished 623 curves @ B1=43000000, B2=388112953420 without finding the factor.

[QUOTE=jrk;197441]Nice. I finished 623 curves @ B1=43000000, B2=388112953420 without finding the factor.[/QUOTE]

I found it twice overnight, but was asleep at the time.

[FONT=Arial Narrow]Then sigh not so,
But let them go,
And be you blithe and bonny,
Converting all your sounds of woe
Into Hey, nonny, nonny.[/FONT]

On to the c161, guys!

[QUOTE=fivemack;197443]I found it twice overnight, but was asleep at the time.[/QUOTE]Ooops....sorry for stealing your thunder. :blush:

If I've done my calculations correctly, the good news is that we can't lose 2^4 and we can't pick up a 3 either on the next line.

Who is regularly updating up the factor database at
[URL]http://factorization.ath.cx/search.php[/URL]

I hope that there are many people; my question is that

For an aliquot sequence or home prime sequence
will the database automatically produce the next iteration
once we completely submitted away the factors?
Will it automatically check up if the remaining cofactor
is prime or not? Will it automatically eliminate small factors
of any number or any iteration by using brute force trial
division or the Pollard's Rho algorithm? How does it work
out?

[quote=Raman;197499]Who is regularly updating up the factor database at[URL="http://factorization.ath.cx/search.php"] http://factorization.ath.cx/search.php[/URL][/quote]
(if I understand your question correctly) Anyone can enter a factor. Various people do, depending on which particular sequence/work you're talking about. For Aliquot sequence 4788 (the subject of this thread), it is whoever happens to be the one who finds a factor.
(or maybe you meant...) A user named Syd is the one who runs the DB, but hasn't had much time to put towards it lately.
By the way, it is also available at a newer and easier-to-remember URL: [URL]http://factordb.com/[/URL]
[quote=Raman;197499]For an aliquot sequence or home prime sequence will the database automatically produce the next iteration once we completely submitted away the factors?[/quote]
Yes.
[quote=Raman;197499]Will it automatically check up if the remaining cofactor is prime or not?[/quote]
Yes. Composite numbers appear blue, prime numbers appear black, and PRP numbers appear dark red.
[quote=Raman;197499]Will it automatically eliminate small factors of any number or any iteration by using brute force trial division or the Pollard's Rho algorithm?[/quote]
No. To have it run GMP-ECM with increasing bounds, (good for factors up to about 20 digits), click the cofactor and click the Quick ECM button.
[quote=Raman;197499]How does it work out?[/quote]
Not sure what you mean by this, but the database is used extensively by this project and is very useful. It's also useful for other things, such as Cunningham Tables.