C · No factor known
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 337.4
Special form: 2033^102+2033^51+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 220-digit number (this number has 316 digits). Listed best first; the files carry sieving parameters for the polynomial's difficulty.
x6 − 12198x4 + 37197801x2 − 8402569937 root m = −Y0/Y1
difficulty 337.4 · E 2.26e-17
ggnfs msieve cado
n: 1241795191190994628302937119688174404883399153975712585394775296247889673488612761695222164509893642643237835705606103606329881694931177502528987504407750410943678524765421781879533855126736108449825159512592083451594398580708396951308612722660401131696622431746073523060375917712262742940191276944679258299280034043 # 2033^102+2033^51+1, difficulty: 337.43, scaled difficulty: 339.42 # special-q on the rational side, siever gnfs-lasieve4I16e, start at q = 50000000 in ranges of 32000 type: snfs size: 337 skew: 1.0000 c6: 1 c3: 1 c0: 1 Y1: 1 Y0: -173115293683432354757924269966581850966317639693338578673 rlim: 100000000 alim: 100000000 lpbr: 32 lpba: 32 mfbr: 64 mfba: 64 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 0
Work the background scanners have done on this number, from its position in the scanner queue.
Trial division
none yet
ECM effort
none yet
starts after trial division
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
fdb number id:1100000009996519734 --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":1100000009996519734},"decimal":false,"detail":2}}'