A PRIME FACTORIZATION ALGORITHM, IN ACTIONSCRIPT

A PRIME FACTORIZATION ALGORITHM, IN ACTIONSCRIPT

There are many algorithms for factoring integers. The trial division algorithm is one of the most efficient algorithms for factoring small integers(say less than 10,000,000,000). For a number n to be factored, the runtime of the trial division algorithm depends mainly on the size of a nontrivial factor of n. In this paper, we create a function named factors that can implement the trial division algorithm in ActionScript and using the factors function we construct an interactive Prime Factorization Movie and an interactive GCD Movie.

(0)

(0)

(0)

(0)