Apologies for previous truncated message due to finger trouble on my part! On Friday 11 August 2006 22:40, roger lindley wrote: > I attempted a posting at 9:50 PM CDT last night (August 10th) > which included the FORTRAN source code of the implementation > of the algorithm among other things. The posting did not > appear. I don't know why unless the postings are limited in > size.
Doesn't look big enough to be a problem ... ? > > Anyway I am attempting another posting herewith. The > following link is to the text of the failed posting. So if > this gets posted, then you can read what I attempted to > post by following the link. > > Link to failed posting: http://westondigital.com/prime/failedposting.txt Thanks. The algorithm is basically the same as that I posted on 8th August though the extension to get powers is an improvement on that I proposed on the 10th. My "pointer list" idea conserves memory. Roger's method of detecting powers of factors is cleverer and a bit more efficient than my crude idea. I doubt very much whether either of us have done anything more original than re-inventing the wheel. Having said that, with regard to Roger's original question, no, I can't point at a direct statement of Roger's algorithm, though that is very far from proving that a prior claim doesn't exist. Regards Brian Beesley _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
