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 202.9
Special form: 5711^54-5711^27+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 144-digit number (this number has 203 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
n: 24284848258895975817137004943591191369436950566616277912053715938736277961077693879196412932047681831000465880016219127923246836043631773411766605179843997947818663497459935840476629070844582986090887057 # 5711^54-5711^27+1, difficulty: 202.86, scaled difficulty: 203.66 # special-q on the algebraic side, siever gnfs-lasieve4I14e, start at q = 9000000 in ranges of 8000 type: snfs size: 202 skew: 1.0000 c6: 1 c3: -1 c0: 1 Y1: 1 Y0: -6462632219874219848729923188982991 rlim: 18000000 alim: 18000000 lpbr: 28 lpba: 28 mfbr: 56 mfba: 56 rlambda: 2.6 alambda: 2.6
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 0
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:1100000009996519409 --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":1100000009996519409},"decimal":false,"detail":2}}'