20180728, 12:37  #694 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
1450_{8} Posts 
I have started YAFU on p^111 with digit size 112. I dont have an exact number (yet); but it´s about 940 numbers.
Most of them seem to have small factors, which should speed thinks up a bit. I can also take other numbers (e.g. p^191 (about ~1000 number with 112 digits)) after I´m finished with 112 digits. One number takes about 6200 seconds NFS plus 2150 seconds for ECM. So far I had bad luck; 4 out of 5 had to be done with NFS, the last had an 26 digits factor. CoFactor factored with SIQS. I have no idea how long it will take, with ~68 numbers/day it will take ~130 days. 
20180728, 13:11  #695 
"Robert Gerbicz"
Oct 2005
Hungary
5C5_{16} Posts 

20180728, 14:23  #696 
"Curtis"
Feb 2005
Riverside, CA
2^{5}·151 Posts 

20180728, 15:51  #697  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
1100101000_{2} Posts 
Quote:
I´m using the polys found by YAFU. They have scores about e 8.415e010. YAFU´s poly search runs about 14 Minutes; while factmsieve.py only searches for ~3 minutes. BUT: Booth gave me similar score values. The poly instructions I got from RichD doesn´t seem to work. (probably due to "layer 8" problem ) The poly I got from RichD for that C118 needed only 2,4M Relations; the msieve/Yafu polys need 7,65M Relations for lattice sieving. Looks like there is the problem. Cutting pretest effort will help for sure. 

20180728, 18:27  #698  
"Robert Gerbicz"
Oct 2005
Hungary
7×211 Posts 
Quote:
simply special numbers. Asked this because when you check out such a number, say: http://www.factordb.com/index.php?qu...8449862291%29 (the given number is not interesting, just random) and when you click on more information then there is an available option to get Code:
Autogenerated SNFSPolynominal available! Code:
n=(p^111)/(p1); f(x)=p*x^51; m=p*p; f(m)%n It was totally unable to recognize that it is a reciprocial polynomial, and we can get: Code:
g(y)=y^5+y^44*y^33*y^2+3*y+1; M=lift(Mod(p+1/p,n)); g(M)%n ? ? ? ? %25 = 0 ? ? ? ? ? %28 = 0 After this writing searched the web, and found this: http://www.mersennewiki.org/index.ph...mial_Selection explaining the same thing. 

20180730, 17:32  #699 
Dec 2017
2^{6} Posts 
All most wanted numbers with SNFS difficulty below 180 digits now done.
Now working on 6217^471 and 1091^591 As a matter of interest, is there any sort of target or score to work towards for the OPN bounds proofs? How many factorweights might we need to allow the proof that there is no OPN with less than 2100 digits, for example? Thanks Steve 
20180802, 08:50  #700  
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5876_{10} Posts 
Quote:


20180810, 12:06  #701  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
1450_{8} Posts 
Quote:
Quick notice: I have stopped this effort and moved the processing power on somethink more usefull. Soon I´ll have 4 numbers ready for SNFS with size 165 digits; they all passed pretest t40; excluding one that also survived 6600 curves@43M. These numbers have the form p^111; let me know if I should post them here or elswhere. I can also do any other form, send me an file with numbers that need pretest and suggested deeph and I´ll do them. 

20180810, 14:46  #702 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
808_{10} Posts 
It´s down to three numbers. (165 digits; form p^111)
These two reached t40: http://www.factordb.com/index.php?id...00001076092952 http://www.factordb.com/index.php?id...00001076093749 This reached t50: http://www.factordb.com/index.php?id...00001076094174 I´m willing to do ECM pretests for any digit size <1200 digits from this project. Just send me the numbers via PM. 
20180810, 17:40  #703  
Sep 2008
Kansas
3,361 Posts 
Quote:


20180812, 02:06  #704 
Sep 2008
Kansas
3,361 Posts 
MWRB file
Reserving the following numbers from the MWRB file.
Code:
1103^611 1129^611 1249^611 1783^611 1867^611 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Passive Pascal  Xyzzy  GPU Computing  1  20170517 20:22 
Tesla P100 — 5.4 DP TeraFLOPS — Pascal  Mark Rose  GPU Computing  52  20160702 12:11 
Nvidia Pascal, a third of DP  firejuggler  GPU Computing  12  20160223 06:55 
Calculating perfect numbers in Pascal  Elhueno  Homework Help  5  20080612 16:37 
Factorization attempt to a c163  a new Odd Perfect Number roadblock  jchein1  Factoring  30  20050530 14:43 