McCanney's Algorithm for Calculating Primes

I now have a copy of McCanney's book which contains the 1st of at
least 4 papers (3 apparently still unpublished) describing aspects
of the algorithm for enumerating the primes directly and exhaustively
using only addition and subtraction..

I think the algorithm may work, but no one reading this is likely
to figure out the algorithm without a copy of the book handy. I'm
not sure I can figure out the algorithm even with the book handy.
(It was my original intention to program the algorithm in either
Haskell or C. It's not going to be as simple as I thought. I have
to understand the algorithm before I can program it.)

The book contains a prohibition against posting any of its content
(directly quoted or paraphrased) to the internet.

So anyone not willing to spend $20 to get a copy of McCanney's book
should just forget about his algorithm for calculating primes and
move along.

Dave Feustel
.

Relevant Pages

  • Re: McCanneys Algorithm for Calculating Primes
    ... I think the algorithm may work, but no one reading this is likely ... not sure I can figure out the algorithm even with the book handy. ... The book contains a prohibition against posting any of its content ... so a paraphrase cannot be prohibited. ...
    (comp.security.unix)
  • Re: Countering chosen-plaintext attacks
    ... > I really and truly honestly believe you have to just read papers. ... additionally special nutrition and much body movement (or ... of chosen plaintext possibly from a different/novel ... modifying or replacing the algorithm as such, ...
    (sci.crypt)
  • Re: Graph layout for DAGs: online resources?
    ... pointers to papers, but no explanation that I can implement from. ... IEEE Transactions on Systems, Man, and Cybernetics SMC-11, February, ... Algorithm for Layered Graph Drawing ...
    (comp.programming)
  • Re: finding minimum distance in a set of points
    ... Read from these respective papers: ... lower bound complexity of an *INCREMENTAL* delaunay ... to show a sorting algorithm cannot ... I can assure you Boissonnant ...
    (comp.soft-sys.matlab)
  • Re: "Size Balanced Tree" - more efficient than any known algorithm?
    ... his algorithm is an amortized one and has much ... seminal papers are discovered by following references by random ... is created by myself and that it is faster than all existing BSTs". ... many foreign theses although they are famous. ...
    (comp.theory)