Re: prime factorization
[Prev][Next][Index][Thread]
Re: prime factorization
An interesting sort of brute force approach. It doesn't give me the prime
factors though, just the factors. I've thought about doing a similar kind
of thing using a previously stored list of prime numbers but I was hoping
someone had thought of something more clever and less costly memory wise.
Mark
On Wed, 1 Oct 1997, Garcia wrote:
> In asm or basic. For basic just do a simpl loop which will divide a number
> by a every number beneath it, check the mod, and store in a list if 0. Then
> do what ever you want with the list.
>
> Andres
>
References: