20101127, 16:10  #12 
Aug 2006
5979_{10} Posts 

20101127, 17:29  #13  
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
Quote:
Besides, this type of prime is too easy to find, and sieving doesn't get rid of much. Last fiddled with by 3.14159 on 20101127 at 17:30 

20101127, 17:35  #14 
Jun 2003
3·17·101 Posts 

20101127, 19:18  #15 
May 2010
Prime hunting commission.
690_{16} Posts 
There won't be much eliminated as you head towards the larger factorials. No difference is made.
Last fiddled with by 3.14159 on 20101127 at 19:21 
20101127, 23:45  #16 
Jun 2003
141F_{16} Posts 

20101128, 04:24  #17  
Aug 2006
3×1,993 Posts 
Quote:
I trust you know the rule of thumb here. It still applies, and suggests that some amount of trial division is still worthwhile. The amount depends on how many you're sieving out and how fast your basic operations are. 

20101204, 01:46  #18  
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
Quote:
Last fiddled with by 3.14159 on 20101204 at 01:48 

20101204, 05:24  #19 
Aug 2006
1011101011011_{2} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Search primes of form 2*n^n ± 1  JeppeSN  And now for something completely different  27  20180412 14:20 
Carol / Kynea search (Nearpower primes)  rogue  And now for something completely different  37  20160618 17:58 
MultiFactorial Search  rogue  And now for something completely different  1  20150602 23:51 
Factorial primes  Unregistered  Information & Answers  2  20110911 21:32 
Why Search for these Huge Primes?  Unregistered  Math  8  20050427 00:55 