mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > FactorDB

Reply
 
Thread Tools
Old 2021-05-04, 13:21   #1618
bur
 
Aug 2020

111010102 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
"Silvester/Euclid sequence"s should not when a prime term is reached (by the definitions at Wikipedia), but they do. E.g. http://factordb.com/sequences.php?se...20&fr=0&to=100
This is still the case, it's blocking the "real" Silvester sequence (a(0) = 2) which just stops at 2. Since factorization is not required to continue the sequence it should just proceed.
bur is offline   Reply With Quote
Old 2021-05-19, 20:16   #1619
MisterBitcoin
 
MisterBitcoin's Avatar
 
"Nuri, the dragon :P"
Jul 2016
Good old Germany

23·101 Posts
Default

I started a worker on C86s. Most are done within a few secs.

Any one else working on small composites?
MisterBitcoin is offline   Reply With Quote
Old 2021-05-19, 21:18   #1620
richs
 
richs's Avatar
 
"Rich"
Aug 2002
Benicia, California

1,277 Posts
Default

I have had one worker on C81+ for the past few months. I was staying afloat until some spammer overflowed the C70's+.
richs is offline   Reply With Quote
Old 2021-05-20, 16:05   #1621
chris2be8
 
chris2be8's Avatar
 
Sep 2009

2·1,031 Posts
Default

I'm working on C70-C80s. And occasionally looking for easy numbers in the 80-90 digits range (easy usually means doable with SNFS).

I noticed a lot of numbers like 50##/206 (product of first 50 primes divided by some small number) and set a script going to factor them. That cleared out about 12,000 of them (mainly limited by how many updates per hour factordb would allow).

If you can think of a sensible reason for adding them to factordb in the first place I'd be interested to hear it.

Chris
chris2be8 is offline   Reply With Quote
Old 2021-05-20, 18:47   #1622
MisterBitcoin
 
MisterBitcoin's Avatar
 
"Nuri, the dragon :P"
Jul 2016
Good old Germany

80810 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
I'm working on C70-C80s. And occasionally looking for easy numbers in the 80-90 digits range (easy usually means doable with SNFS).

I noticed a lot of numbers like 50##/206 (product of first 50 primes divided by some small number) and set a script going to factor them. That cleared out about 12,000 of them (mainly limited by how many updates per hour factordb would allow).

If you can think of a sensible reason for adding them to factordb in the first place I'd be interested to hear it.

Chris

After about 22 hours in C86:


Code:
============================================================
Runtime (H:M:S).....................: 0022:34:45
Time waiting for composites (H:M)...: 0000:00
Composite range.....................: 86 - 86 digits

Report factors for composite #......: 3716
Factored C86 in.....................: 2.3 sec.

        New factors added...........: 2 / 4825
        Factors already known.......: 1 / 1832
        Small factors...............: 0 / 11190

        Only small factors..........: 240
        Worker collisions...........: 6

        Total page requests.........: 7432
============================================================
  164.6 composites/hr
  329.1 page requests/hr
  418.5 page requests/hr (last 60 composite requests)
  306.9 new factors added/hr (last 60 composite requests)
MisterBitcoin is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
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

All times are UTC. The time now is 07:49.

Tue Jun 15 07:49:14 UTC 2021 up 18 days, 5:36, 0 users, load averages: 1.34, 1.21, 1.25

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