20200805, 05:31  #23  
Jun 2003
11000101011_{2} Posts 
Quote:
Turning the problem around  instead of fixing a number powersmooth (x) and then searching we leave both input and output variable. If we are flexible with above  then we could generate a 2^n+c that has a lot of factors (smooth) and c is relatively small and we can control number of bits in n. This should have a low hammer weight. OR generate a number with low hammer weight that has a lot of factors. 

20200829, 02:57  #24 
Romulan Interpreter
Jun 2011
Thailand
3^{3}·347 Posts 
Mihai, there is a way to reduce that number of bits, but the multiple becomes such big, that would be impossible to use, as you will need soooOOO many more squarings, you gain nothing. For example, instead of computing b^e (with odd e), you can compute b^(2^ord(2,e))/b. What's in parenthesis is a power of 2, so it has no additional "pops", and the resulted power (after division) is a multiple of e (by definition of ord). But what you get there is HUUGE, way beyond b^(2^p2) that you compute for PRP, haha.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Primorial offsets  robert44444uk  Prime Gap Searches  7  20181129 08:40 
Primorial calculation  FreakyPotato  Programming  7  20150206 10:33 
Primorial puzzle  Citrix  Puzzles  3  20060307 15:07 
Primorial question  Dougy  Math  2  20050728 13:13 
Multiple systems/multiple CPUs. Best configuration?  BillW  Software  1  20030121 20:11 