20070716, 22:35  #1 
15717_{8} Posts 
Primality
If n(2^(n1)) +1 is prime, prove n is prime if and only if n is not a composite prime square.

20070717, 19:22  #2 
∂^{2}ω=0
Sep 2002
República de California
2^{3}·3·487 Posts 

20070717, 20:03  #3  
Jun 2007
Moscow,Russia
7·19 Posts 
Quote:
Code:
{1, 2, 3, 6, 7, 14, 27, 66, 67, 87, 115, 134, 187, 295, 446, 867, 1326, 1479} Last fiddled with by VolMike on 20070717 at 20:07 

20070717, 22:12  #4 
∂^{2}ω=0
Sep 2002
República de California
2^{3}×3×487 Posts 
The very first composite among the numerous one you found that satisfy the condition already disproves the hypothesis. Sounds like it's back to the drawing board for Unregistered...

20070718, 08:36  #5 
Jun 2007
Moscow,Russia
7×19 Posts 
That's why I suggest him to recheck the formulating of his statement or admit the approval to be false.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Probability of primality  siegert81  Other Mathematical Topics  12  20200720 13:37 
primality of F33  MiniGeek  Math  8  20090924 21:18 
Primality searches and primality successes  marco_calabresi  Information & Answers  3  20090417 19:44 
primality of ((p+1)^p1)/p^2  maxal  Math  23  20080309 21:09 
N1 primality test  Citrix  Math  3  20050919 15:06 