mersenneforum.org 10^119+x brilliant number
 Register FAQ Search Today's Posts Mark Forums Read

 2006-04-25, 04:56 #1 Citrix     Jun 2003 22×397 Posts 10^119+x brilliant number I have cleaned up this thread to reduce confusion. Here is the progress Code: 10^119+223 gribozavr pp46*pp74 10^119+937 Citrix 10^119+1077 ltd pp35*pp85 10^119+1249 gribozavr pp47*73 10^119+2101 gribozavr pp40*pp80 10^119+2293 gribozavr 10^119+2461 10^119+2983 10^119+3049 10^119+3277 10^119+3427 10^119+3507 10^119+5011 10^119+5107 10^119+5139 10^119+5169 10^119+5407 10^119+5517 408 curves with B1=250000 B2=15e7 on each. 10 curves on each with B1=1M (More numbers to come when done with these) Last fiddled with by Citrix on 2006-05-07 at 00:39
 2006-05-04, 23:10 #2 Citrix     Jun 2003 22×397 Posts Thread open now! You can help if intrested.
 2006-05-04, 23:55 #3 gribozavr     Mar 2005 Internet; Ukraine, Kiev 6278 Posts Code: 10^119+223 = pp46 * pp74 pp46 = 2898402772939283547976441865550839548404385393 pp74 = 34501761084981829929281731446972436211056117061268167640438694939142751311 Reserving 10^119+1249 for SNFS. I wonder if ltd had factored 10^119+1077 with ECM or SNFS? I will play a bit more with parameters and will post a .poly file for ggnfs tomorrow. Thanks Alex Kruppa for advice! Last fiddled with by gribozavr on 2006-05-05 at 00:01
2006-05-05, 04:36   #4
ltd

Apr 2003

22×193 Posts

Quote:
 Originally Posted by gribozavr I wonder if ltd had factored 10^119+1077 with ECM or SNFS? I will play a bit more with parameters and will post a .poly file for ggnfs tomorrow. Thanks Alex Kruppa for advice!
I did my factoring with SNFS using the (corrected) poly file from Alex.
The one that Citrix forwarded to me had a c5=32 but c5=16 is correct.
I made a small test with the more obvious:
10*(10^119+1077)=
10^120+10770=
(10^24)^5+10770
But the yields are lower.

Code:
Number: 10^119+1077
N=100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001077
( 120 digits)
SNFS difficulty: 119 digits.
Divisors found:
r1=37541772553546870485714476622892243 (pp35)
r2=2663699479223236701814445359955449233285321569703635203838860551903727327268826785239 (pp85)
Version: GGNFS-0.77.1-20051202-pentium4
Total time: 3.30 hours.
Scaled time: 2.08 units (timescale=0.629).
Factorization parameters were as follows:
name: 10^119+1077
type: snfs
n: 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001077
m: 500000000000000000000000
c5: 16
c4: 0
c3: 0
c2: 0
c1: 0
c0: 5385
skew: 2.7

lpbr: 26
lpba: 26
mfbr: 46
mfba: 46
qstep 15000
qintsize: 15000

Factor base limits: 600000/800000
Large primes per side: 3
Large prime bits: 26/26
Max factor residue bits: 46/46
Sieved algebraic special-q in [400000, 595001)
Primes: RFBsize:49098, AFBsize:63873, largePrimes:2836327 encountered
Relations: rels:2721020, finalFF:167987
Max relations in full relation-set: 28
Initial matrix: 113035 x 167987 with sparse part having weight 14897156.
Pruned matrix : 98764 x 99393 with weight 6452928.
Total sieving time: 2.93 hours.
Total relation processing time: 0.15 hours.
Matrix solve time: 0.17 hours.
Time per square root: 0.04 hours.
Prototype def-par.txt line would be:
snfs,119,5,0,0,0,0,0,0,0,0,600000,800000,26,26,46,46,2.4,2.4,50000
total time: 3.30 hours.

Last fiddled with by ltd on 2006-05-05 at 04:38

 2006-05-05, 07:05 #5 Citrix     Jun 2003 22·397 Posts How many relations do you have to collect before you find a factor? My .poly file is Code: name: 10^119+937 type: snfs n: 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000937 m: 500000000000000000000000 c5: 16 c4: 0 c3: 0 c2: 0 c1: 0 c0: 4685 skew: 2.71 rlim: 550000 alim: 700000 lpbr: 25 lpba: 25 mfbr: 44 mfba: 44 rlambda: 2.4 alambda: 2.4 q0: 700000 qintsize: 10000 Last fiddled with by Citrix on 2006-05-05 at 07:25
2006-05-05, 10:59   #6
ltd

Apr 2003

22·193 Posts

From the stats i posted:
Quote:
 Relations: rels:2721020, finalFF:167987
I made also tests with lpbr,lpba=25 but got lower yields.

I did not modify the other values so i can not tell which parameter set is better.
(Like q0,mfbr,mfba,rlambda,....)

You should use a larger qintsize for the real runs. (40000-50000)
I only used the small size to see where i come out with the tests parameters.

Lars

Last fiddled with by ltd on 2006-05-05 at 11:02

 2006-05-05, 16:30 #7 Citrix     Jun 2003 158810 Posts My yield is 800/sec. What is your yield? Last fiddled with by Citrix on 2006-05-05 at 16:32
 2006-05-05, 17:51 #8 gribozavr     Mar 2005 Internet; Ukraine, Kiev 6278 Posts Code: 10^119+1249 = pp47 * pp73 pp47 = 27199431305799148084904394598249052610367045793 pp73 = 3676547457030072421238598967605938493557216789338106612659852439900822593 Reserving 10^119+2101. Citrix, please, update the first post.
 2006-05-06, 04:57 #9 gribozavr     Mar 2005 Internet; Ukraine, Kiev 40710 Posts Also reserving 10^119+2293.
 2006-05-06, 16:10 #10 gribozavr     Mar 2005 Internet; Ukraine, Kiev 1100101112 Posts Code: 10^119+2101 = pp40 * pp80 pp40 = 4716435201180395304234255127690084533571 pp80 = 21202453915824545402323668471002790271511510479354117342570659786294985480923431
 2006-05-19, 20:42 #11 Citrix     Jun 2003 22×397 Posts I did 100 curves at b1=1M on all numbers. No factors. This problem is seeming harder than I had originally thought it to be. May be we can work on the base 2 table which is easier to do http://www.alpertron.com.ar/BRILLIANT2.HTM#2br What do you think gribozavr?

 Similar Threads Thread Thread Starter Forum Replies Last Post fivemack Factoring 4 2017-11-02 22:36 mickfrancis Math 16 2017-03-01 07:17 alpertron Factoring 50 2013-05-27 11:21 aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16 fivemack Miscellaneous Math 13 2012-05-03 23:56

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

Sun Aug 14 07:20:38 UTC 2022 up 38 days, 2:07, 2 users, load averages: 0.53, 0.71, 0.79