Hello.
im studieng math now and many time i need to find GCD (Great Common
Divider) and LCM (Least Common Member).
I can create a loop to find it by dividing by list of prime numbers then
finding thier ^ (i dont how it is call in english but for example 2^2 =4 )


--
To UNSUBSCRIBE, email to debian-user-REQUEST@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org