146
Developer's Corner / Re: Efficient way to find highest common denominator? (For reducing fractions.)
« on: July 13, 2007, 10:42 AM »
Welp, I made a function that will do it. It uses a list of prime numbers (primes.txt) that must be in the same directory as the "Func_GreatestCommonDenominator.ahk" script.
Also included is an example ahk script that uses the function to reduce a fraction and report by how much the original was reduced.
GCD 1.1.rar (22.95 kB - downloaded 227 times.)
Also included is an example ahk script that uses the function to reduce a fraction and report by how much the original was reduced.
GCD 1.1.rar (22.95 kB - downloaded 227 times.)