On Mon, Jun 8, 2009 at 6:13 PM, <[email protected]> wrote: > From what I am read in this article, determing if a number > is a "Perfect Power" should be > a lot faster. Either that or I am totally mis-reading the > article.
Determining if a number is a perfect power is certainly faster than some algorithm for determining if a number is prime. But do you have any reason to believe J uses that algorithm, in its implementation of q? That said, 1 p: will determine whether or not a number is prime, and might be faster than 1 = # q: in some cases. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
