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.
Is factor of
SNFS polynomial degree 6 · difficulty 168.7
Special form: 26^102*3^51-26^51*3^26+1. 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 125-digit number (this number has 128 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
n: 20265302317943458790798002259231200961867967497088129088834605874404878190375909477895546263423261872616210194319858519171735937 # 26^102*3^51-26^51*3^26+1, difficulty: 168.66, scaled difficulty: 169.93 # special-q on the algebraic side, siever gnfs-lasieve4I13e, start at q = 3500000 in ranges of 4000 type: snfs size: 168 skew: 0.6934 c6: 27 c3: -9 c0: 1 Y1: 1 Y0: -7439041016241973910360948736 rlim: 7000000 alim: 7000000 lpbr: 27 lpba: 27 mfbr: 54 mfba: 54 rlambda: 2.5 alambda: 2.5
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 12 · TF complete · 3 ECM stages
Work the background scanners have done on this number, from its position in the scanner queue.
Report factors
Paste anything - plain factors, a GMP-ECM run, a factor list. Every number found is checked for divisibility here; the ones that divide are submitted.
From the command linefdb · curl
fdb number id:1100000005836054278 --detail 2
curl -s 'https://factordb.com:4059/rpc' -H 'Content-Type: application/json' -d '{"jsonrpc":"2.0","id":1,"method":"get_number","params":{"target":{"id":1100000005836054278},"decimal":false,"detail":2}}'