20150819, 20:20  #1 
Dec 2011
After 1.58M nines:)
5^{2}×67 Posts 
Generalized Fermat numbers (in our case primes)
On page where is S reservation is written this:
Generalized Fermat numbers (GFn's), i.e. q^m*b^n+1 where b is the base, m>=0, and q is a root of the base Since 4*155^n+1 is Generalized Fermat sequence: I am interested how it can be written to form q^m*b^n+1 Thanks for reply 
20150819, 21:19  #2  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
23731_{8} Posts 
Quote:
Generalized Fermat numbers (GFN's) are x^2^t+1 with t > 0, that's all. (x^2 + 1 are included. For example 37 is a GFN and a prime.) In this case (k*155^n+1 with k=4), it is (2*155^(n/2))^2^1+1 for even n. Furthermore, for doubly even n (n=4q), there is an algebraic factorization, so these are never prime. What is left for prime GFNs is n = 2 (mod 4).  it is not. Not every member of this sequence is a GFN. A Generalized Fermat "sequence" would be one where every term is a GFN; then one could make a simple argument that for such sequences only finite number of terms can be prime (that includes 0 prime terms). 

20151007, 21:44  #3  
"Gary"
May 2007
Overland Park, KS
19·643 Posts 
Quote:
In this statement: "q^m*b^n+1 where b is the base, m>=0, and q is a root of the base" I am saying that where all of these conditions are true, then the form is excluded. What you are missing here for 4*155^n+1 is that b is equal to 155 and q can be equal to either 2 or 4 (i.e. 4^1 or 2^2). But neither 2 nor 4 is a root of 155. Remember the last statement where I say q must be a root of b. In this case it is not. Here is an example where it is: 10*1000^n+1 In this case, 10 is a cube root of 1000 so the form is always GFN and is therefore excluded from the conjecture because there is likely a finite number of primes for it, which, as Serge stated, could be zero primes. Of course most of the time when these GFN forms are excluded, k=b or k=b^2 or k=b^3 etc. such as 2*2^n+1, 4*2^n+1, 8*2^n+1, etc. What is not so obvious is when k^2=b or k^3=b etc. as is the case with 10*1000^n+1. Finally: This excludes all k=1 for Sierp even bases because where k=1, then b^0=1 (i.e. m=0), which fits all criteria that was stated above for the exclusion. (Note that k=1 is not eliminated for Sierp even bases with trivial factors like it is for Riesel bases. It's the GFN's that eliminate it.) Last fiddled with by gd_barnes on 20151007 at 21:45 

20151008, 03:00  #4 
Romulan Interpreter
"name field"
Jun 2011
Thailand
10288_{10} Posts 
(The example with 10 is not very fortunate, as it is still obvious. For a "less obvious" one, think to something like 49*343^n+1 or 27*243^n+1 )

20151009, 14:49  #5 
Dec 2011
After 1.58M nines:)
5^{2}·67 Posts 
Thanks once more for explanation!

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New Generalized Fermat factors  Batalov  Factoring  149  20170220 12:06 
Pseudoprimality Hypothesis for Specific Class of Generalized Fermat Numbers  primus  Miscellaneous Math  1  20150325 22:18 
Best case Fermat Factors  yourskadhir  Miscellaneous Math  5  20121212 04:18 
Generalized Fermat factors  why?  siegert81  Factoring  1  20110905 23:00 
Generalized Fermat Numbers  ET_  Programming  4  20080623 07:59 