I received my copy of the book and DVD "Calculate Primes" by James McCanney ( http://CalculatePrimes.com ) two weeks ago and have been studying it and trying to implement the algorithms ( In PERL first, but it should be in "J" (jsoftware.com), but I'm not fluent in that ).
He shows that prime numbers are not random and can be generated easily with just addition and subtraction, and claims that integer factorization is easy also. I'm stuck in one aspect of the algorithm, though (for large integers). Is anyone on this list familiar with this and could help? Because of his copyrights and other restrictions, I can't get in to too much detail in public (He claims it renders RSA type encryption schemes broken). Hoyt Stearns Scottsdale, Arizona US
