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.
Value
Special form: 10987^36-10987^33+10987^27-10987^24+109…. 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 111-digit number (this number has 146 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
n: 29624326294665709253534525847335650559246902644584305300068812652576725326926568873484567757223219385994457702255164174863458200324835351809447289 # 10987^36-10987^33+10987^27-10987^24+10987^18-10987^12+10987^9-1326286574802, difficulty: 145.47, scaled difficulty: 145.47 # special-q on the algebraic side, siever gnfs-lasieve4I13e, start at q = 1730000 in ranges of 4000 type: snfs size: 145 skew: 1.0000 c4: 14571910597349574 c3: 1326286574802 c2: 120714169 c1: -14571910597349574 c0: -1326286574802 Y1: 1 Y0: -212340578457469021722659838234721 rlim: 3460000 alim: 3460000 lpbr: 26 lpba: 26 mfbr: 52 mfba: 52 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.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.
fdb number '10987^36-10987^33+10987^27-10987^24+10987^18-10987^12+10987^9-10987^3+1' --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":{"expr":"10987^36-10987^33+10987^27-10987^24+10987^18-10987^12+10987^9-10987^3+1"},"decimal":false,"detail":2}}'