3.3.2 Assumptions

Let us be ``lazy'' and make some assumptions. For example, I'll assume, for now, that there is a way to find a prime factor $ f$ of $ n$ . Given this ability, I can write the logic as in algorithm 1.


\begin{algorithm}
% latex2html id marker 86\begin{algorithmic}[1]
\STATE giv...
...{$n = 1$}
\end{algorithmic} \caption{A factoring algorithm.}
\end{algorithm}

As an exercise, assume $ n=15$ and trace this algorithm.



Copyright © 2006-09-26 by Tak Auyeung