HP 50g Programming Competition: How Many Partitions of an Integer in 4 Squares

04202018, 02:04 PM
Post: #30




RE: HP 50g Programming Competition: How Many Partitions of an Integer in 4 Squares
While nothing to do with this thread, Pari uses quite sophisticated methods to factorize.
While nothing to do with this thread: =============================================================== ======= Welcome to YAFU (Yet Another Factoring Utility) ======= ======= bbuhrow@gmail.com ======= ======= Type help at any time, or quit to quit ======= =============================================================== cached 78498 primes. pmax = 999983 >> factor((720^2019)*(720^20+19)) fac: factoring 196471634081745552248512280061541905821883939119093566055892261119434162175999999999999999999999999999999 9999999639 fac: using pretesting plan: normal fac: no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations Total factoring time = 0.1200 seconds ***factors found*** P58 = 1401683395356260729391818575873415577600000000000000000019 P58 = 1401683395356260729391818575873415577599999999999999999981 ans = 1 >> https://sourceforge.net/projects/yafu/ 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)