You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A $p + 1$ Method of Factoring
H. C. Williams
Mathematics of Computation
Vol. 39, No. 159 (Jul., 1982), pp. 225-234
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2007633
Page Count: 10
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Let $N$ have a prime divisor $p$ such that $p + 1$ has only small prime divisors. A method is described which will allow for the determination of $p$, given $N$. This method is analogous to the $p - 1$ method of factoring which was described in 1974 by Pollard. The results of testing this method on a large number of composite numbers are also presented.
Mathematics of Computation © 1982 American Mathematical Society