factordbrpc · fdb
Sign in

Enter a value, an expression, or a term with a variable like 10^n+1 to list a range. Switch to Database id to look a number up by its stored id. Reading never stores anything; use Create to add a number to the database. See the expression syntax & functions reference.

C · No factor known
id #1100000001618966894 166 digits created 2020-11-11

Value

1708398143…19<166>
term (10^188*11-10^94*9-11)/643878011642412255824331
Show full digits Permalink
Is factor of
SNFS polynomial degree 6 · difficulty 189.0

Special form: 11*10^188-9*10^94-11. This number divides it, so the number field sieve can use a polynomial with small coefficients. The best one costs about as much as GNFS on a 136-digit number (this number has 166 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.

1100x6 - 90x3 - 11 difficulty 189.0 · E 1.92e-11 ggnfs msieve cado
11x4 - 9x2 - 11 difficulty 189.0 · E 1.28e-11 ggnfs msieve cado
11x6 - 900x3 - 110000 difficulty 193.0 · E 9.68e-12 ggnfs msieve cado
110000x4 - 900x2 - 11 difficulty 189.0 · E 8.68e-12 ggnfs msieve cado
1100000000x6 - 90000x3 - 11 difficulty 189.0 · E 5.91e-12 ggnfs msieve cado
11x4 - 900x2 - 110000 difficulty 193.0 · E 5.21e-12 ggnfs msieve cado
n: 1708398143918761801789575546989441921685149073483977596102993219353589911509144795285136260997469299115660495971703823504368435786800127706488013123371472436458726719
# 11*10^188-9*10^94-11, difficulty: 189.04, scaled difficulty: 190.76
# special-q on the algebraic side, siever gnfs-lasieve4I14e, start at q = 6000000 in ranges of 8000
type: snfs
size: 189
skew: 0.4642
c6: 1100
c3: -90
c0: -11
Y1: 1
Y0: -10000000000000000000000000000000
rlim: 12000000
alim: 12000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.6
alambda: 2.6
The block above is a GGNFS / yafu job file for the first polynomial (yafu: save it as nfs.job and resume with -R). The order is for a sieve of this job's size. E is the Murphy score with the conventional fixed parameters, comparable with msieve's; it favours low degrees for small jobs, so it is not always descending.
Trial factoring & ECM effort 11 · TF complete · 2 ECM stages

Work the background scanners have done on this number, from its position in the scanner queue.

Trial division up to 100G
ECM effort P-1 B1=500000 · P+1 c=3 B1=50000 next: ECM c=15 B1=150000

Report factors

Paste anything - plain factors, a GMP-ECM run, a factor list. Every number found is checked for divisibility; the ones that divide are submitted.

From the command linefdb · curl
fdb
fdb number id:1100000001618966894 --detail 2
curl
curl -s 'https://factordb.com:4059/rpc' -H 'Content-Type: application/json' -d '{"jsonrpc":"2.0","id":1,"method":"get_number","params":{"target":{"id":1100000001618966894},"decimal":false,"detail":2}}'