Re: [ProgSoc] Simplifying fractions

[Telford Tendys <telford@nospam.progsoc.uts.edu.au>]

> from memory you are looking for euclid's algorithm. it is probably one
> of the fastest number theory algorithms known to man (O(log^2n) from
> memory). an amazing bit of work. sometimes called the gcd
> algorithm. very nice.

Hmmm, that certainly is much faster than dividing by primes,
since it has the same effect as dividing by primes can you run it
backwards and use it to generate the prime table that you would
have been dividing by? Just a passing thought...

	- Tel

--
You are subscribed to the progsoc mailing list. To unsubscribe, send a
message containing "unsubscribe" to progsoc-request@nospam.progsoc.uts.edu.au.
If you are having trouble, ask owner-progsoc@nospam.progsoc.uts.edu.au for help.

This list is archived at <http://www.progsoc.uts.edu.au/lists/progsoc/>