On Wednesday 09 August 2006 02:22, roger lindley wrote: > Brian - > > To begin, I have no interest in copyright. I subscribe to the > copyleft (all rights reversed) philosophy. I simply would like > to be pointed to a reference to such an algorithm. Yes, it > seems obvious. But where is it stated or demonstrated?
How can I answer that without knowing what it is? I can answer the question, "Does the word Jehovah appear in the Bible?" but I can't answer the question "Does the word you're thinking of appear in the Bible" unless you tell me which word you've selected. > > I think your explanation falls short. What about the composite > 12? Does it just have 2 and 3 as factors, or does it have two > factors of 2 and a factor of 3 by your explanation? The way I described it, just 2 and 3. > My algorithm > not only finds the primitive factors, but their powers as well. I could make it do that - at a large efficiency cost (running through the sieve for known composites as well as already found primes, and an increase in the storage required to keep the lists of factors). > And the algorithm does not require any division or modular > arithmetic, only loops and increments. Neither does mine. > > As far as telling you what the algorithm is, I would be happy to. > But my implementation of the algorithm is in crude FORTRAN > which I doubt anyone wants to decipher. Well, why not post the "crude FORTRAN"? There is at least one reader of this list who wrote FORTRAN programs over 35 years ago... maybe rusty but should be able to pick the bones out of even the messiest stew. Regards Brian Beesley _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
