20050919, 03:24  #1 
Jun 2003
11^{2}·13 Posts 
N1 primality test
I am just wondering in the n1 primality test must p1 be completely factorizable.
Can p be (a^a1)/(a1) where a is prime then p1 = (a^aa)/(a1) clearly a^(a1)1 can be split into a^(a1)/2+1 and a^(a1)/21 Can this factorization be used to prove these numbers prime or not? Citrix 
20050919, 03:52  #2  
"William"
May 2003
New Haven
2×3^{2}×131 Posts 
Quote:


20050919, 14:36  #3  
Nov 2003
2^{2}·5·373 Posts 
Quote:
p1, p+1, p^2+1, p^2+p+1, p^2p+1, such that the product exceeds n^1/3, then you can do a full primality proof with "old fashioned" methods. The Cyclotomy (aka CohenLenstraBosma, etc.) Method even improves upon this. It can use results from *many* cyclotomic rings simultaneously... 

20050919, 15:06  #4  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
5·2,053 Posts 
Quote:
I've implemented the simple form of CohenLenstra version and made a start on Bosma's improved version but gave up after a while. Paul 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Modifying the Lucas Lehmer Primality Test into a fast test of nothing  Trilo  Miscellaneous Math  25  20180311 23:20 
New Mersenne primality test  Prime95  Miscellaneous Math  19  20140823 04:18 
there is another way to test the primality of a no  shawn  Miscellaneous Math  5  20070717 17:55 
AKS Primality Test  Guilherme  Math  2  20041126 05:29 
A primality test for Fermat numbers faster than Pรฉpin's test ?  T.Rex  Math  0  20041026 21:37 