20070719, 11:48  #1 
Sep 2002
Vienna, Austria
DB_{16} Posts 
New phi for homogeneous Cunningham numbers
I have modified akruppa's phi program to work with a^n +/ b^n numbers.
here is the source file, compile with GCC with lgmp. 
20070719, 13:08  #2 
Jun 2007
Moscow,Russia
7·19 Posts 
As usual,compilation problems appear.
Trying to compile with devC++ 4... Steps done: 1) Unpack gmp 4.2.1 archieve 2) Rename gmph.in to gmp.h 3) Path to gmp.h was added as "include" directory While compiling, the errors line "line XX ,parse error" appear. How can I compile this code? 
20070719, 13:11  #3  
Sep 2002
Vienna, Austria
3×73 Posts 
Quote:


20070719, 14:32  #4 
Jun 2007
Moscow,Russia
7×19 Posts 

20070719, 20:44  #5 
Sep 2002
Vienna, Austria
DB_{16} Posts 
This binary is compiled under Cygwin  thus it need cygwin1.dll and cyggmp3.dll to run.

20140417, 16:17  #6 
Sep 2009
2^{2}×3×167 Posts 
Is there a later version of phi available anywhere? I've think I've found a bug in this version:
Code:
$ phi deg4 17 313616599 1 52768558671518362205861309316257680653426149189122032710729071712003321614920605612513 n: 52768558671518362205861309316257680653426149189122032710729071712003321614920605612513 # 313616599^171^17, difficulty: 169.93, skewness: 2356672.75, alpha: 0.00 # cost: 8.99361e+15, est. time: 4.28 GHz days (not accurate yet!) skew: 2356672.753 c4: 1 c0: 30845876999193307850169799 Y1: 1 Y0: 3033857681268212293634352084667698572482999 m: 3033857681268212293634352084667698572482999 type: snfs Code:
n: 52768558671518362205861309316257680653426149189122032710729071712003321614920605612513 c4: 313616599 c0: 1 m: 9673779037659330951530253934893601 # m is 313616599^4 PS. Is there a way to search for attachment names matching a string? The forum search engine doesn't appear to. 
20140417, 17:45  #7 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·3·5·311 Posts 
You could have fun with an octic! ;)
Code:
n: 52768558671518362205861309316257680653426149189122032710729071712003321614920605612513 type: snfs skew: 1 # t^8+t^77*t^66*t^5+15*t^4+10*t^310*t^24*t+1, t=(x^2+1)/x c0: 1 c1: 4 c2: 10 c3: 10 c4: 15 c5: 6 c6: 7 c7: 1 c8: 1 Y1: 313616599 Y0: 98355371168326802 Last fiddled with by Batalov on 20140417 at 17:49 Reason: QS! 
20140417, 18:33  #8  
Nov 2003
1110100100100_{2} Posts 
Quote:
313616599^171; At 145 digits this is much too big for SIQS. 

20140417, 18:49  #9 
"Ben"
Feb 2007
3,371 Posts 

20140417, 18:51  #10  
Aug 2006
1756_{16} Posts 
Quote:
Edit: bsquared beat me to it. Last fiddled with by CRGreathouse on 20140417 at 18:52 

20140417, 19:25  #11 
Aug 2006
2×29×103 Posts 
Factors as 40198613071456517734490522684447 * 1312696002165987096298388275017136243160743778951559679.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Fix for homogeneous cunningham polynomials  frmky  YAFU  1  20160414 13:35 
Homogeneous Cunningham snfs poly selection?  nuggetprime  Factoring  22  20080815 10:01 
Don't know how to work on Cunningham numbers.  jasong  GMPECM  6  20060630 08:51 
Doing Cunningham numbers but messed up.  jasong  Factoring  1  20060403 17:18 
Need help factoring Cunningham numbers  jasong  Factoring  27  20060321 02:47 