From: nowhere@never.at   
      
   Terje asked:   
      
   >>> Interesting ideas, I've got to ask though, what is the need/intention   
   >>> here?   
      
   >>> I.e. why do you need the prime reciprocals, what do you need them for,   
      
   >> speed up my 512 bit calculator for 1/P 1/N with minor rounding issues.   
   >> ["black peep hole watchers" and a few "metoo scientists" asked for]   
      
   > Again, what is it used for?   
      
   as mentioned above: "some of my clients want such LUTs" to speed up calc.   
   I dont care "why" as long as I'm paid for it :)   
   what they rearly do with it is a bit beyond my understanding of math,   
   but you may know: always fulfill client demands or risk to loose em.   
      
   > 1/P == reciprocal prime, 1/N any reciprocal which can then be syntesized   
   > by first factoring N and then combining the prime reciprocals?   
      
   almost right, all gathered values are either multiples of integers or   
   multiples of primes or a combination of both.   
   So prime factors detection is one part of the story while calculation   
   with LUTs by ordinal #of primes and their often needed reciprocals   
   (ie: ln x) instead of any divide is due.   
      
   >> not limited to 512 primes, but I want 512 bits precise 1/N.   
   > Anything special with 512?   
   > What is the final requirement?   
      
   512 bit precision is just my current limit and it fits HDsector bounds*8.   
   (and repeated reciprocal patterns could be used for any wanted presision).   
   __   
   wolfgang   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)