|
|
Phil Carmody <thefatphil_demunged@xxxxxxxxxxx> wrote in
news:87u0icfqtc.fsf@xxxxxxxxxxxxxxxxxxxx:
> "Dik T. Winter" <Dik.Winter@xxxxxx> writes:
>> In article <87mzolhmpw.fsf@xxxxxxxxxxxxxxxxxxxx> Phil Carmody
>> <thefatphil_demunged@xxxxxxxxxxx> writes:
>> > "Dik T. Winter" <Dik.Winter@xxxxxx> writes:
>> ...
>> > > > After a lengthy discussion on this subject several years ago,
>> > > > we concluded:
>> > > > Any sieve that's slower than a hard disk is insufficiently
>> > > > advanced. Any hard disk which is slower than a sieve is
>> > > > insufficiently advanced.
>> > >
>> > > I like this, but it does not answer the question of the OP.
>> >
>> > Which is why I replied to you, not the OP :-D
>>
>> To me it looks like the definition of a ratrace.
>
> At least it has a simple solution - whatever's slower, make it faster!
>
> Got any spare CPU power? I'm on the trawl for intelligent contributors
> to my latest computational number theory distraction.
>
> Phil
Thanks for the information. the question is, is it worth the effort to
"prime code" files? or are the primes to dense?
--
The world is flat it's pi that's round!
There is only one number.
Prime Code :: P(i)^a.P(j)^b.......
|
|