20130217, 12:40  #1 
Dec 2009
3^{3} Posts 
PFGW can't find a small factor.
For example,
2362339121*2^10181 has no small factor. mod(2362339121*2^10181, 17) = 0. 
20130218, 00:19  #2 
"Mark"
Apr 2003
Between here and the
19×367 Posts 

20130218, 04:01  #3 
Jun 2003
2·2,719 Posts 

20130218, 04:07  #4 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10,061 Posts 
Code:
PFGW Version 3.7.2.64BIT.20130122.x86_Dev [GWNUM 27.9] 2362339121*2^10181 is composite: RES64: [3DE9C23DFB42D757] (0.0017s+0.0267s) ... PFGW Version 3.7.3.32BIT.20130210.Win_Dev [GWNUM 27.8] 2362339121*2^10181 is composite: RES64: [3DE9C23DFB42D757] (0.0022s+0.0838s) PFGW Version 3.7.3.64BIT.20130210.Win_Dev [GWNUM 27.8] 2362339121*2^10181 is composite: RES64: [3DE9C23DFB42D757] (0.0020s+0.0295s) Last fiddled with by Batalov on 20130218 at 04:12 
20130218, 07:42  #5 
Banned
"Luigi"
Aug 2002
Team Italia
2·7·347 Posts 
What is the command line?
pfgw[3264]{s} q2362339121*2^10181 or pfgw[3264]{s} t q2362339121*2^10181 or pfgw[3264]{s} t f q2362339121*2^10181 ? Luigi 
20130218, 08:25  #6 
Jun 2003
2×2,719 Posts 
I used f q (in windows command line you have to escape the ^ with ^^)

20130218, 10:23  #7 
Dec 2009
3^{3} Posts 
Open WinPFGW Version 3.6.5.
PFGW Version 20130210. pfgw f o input file.txt 
20130218, 12:43  #8 
"Mark"
Apr 2003
Between here and the
19×367 Posts 
3.6.7 finds the factor, but 3.7.3 does not. I assume it was due to reintroduction of the tree factoring code. I'm getting help from someone much more familiar with that code.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
PFGW 3.6.x problems on small primes  gd_barnes  Conjectures 'R Us  18  20140713 11:51 
Can Pollard Rho cycles be used to find a factor?  wwf  Factoring  26  20130930 04:24 
Fails to find very small factors.  Mr. P1  FactorDB  6  20130322 02:30 
How much ECM does it take to find a given factor?  geoff  Factoring  5  20040929 20:14 
Where I find the best program to it factor keys? I use AMD.  chrow  Factoring  5  20040219 10:15 