You need to use a GCD (Greatest Common Divisor) algorithm.
The easiest one to code is the one that Euclid invented...
Say I want to do 84/18. I determine which one is larger, and divide 84 by 18 leaving remainder 12. Then I divide 18 by 12 leaving remainder 6. Then I divide 12 by 6 to get remainder 0, which means that 6 is the GCD. Therefore, the fraction may be reduced by a factor of 6/6.
I leave it to you to do this in BASIC.
__________________ Desktop machine: 2 x Opteron 246, Asus K8N-DL, 2GB PC3200 ECC Reg., XFX GeForce 6600GT, 74gb WD Raptor, 2 x 19\" LCDs, Windows XP x64
Server machine: Intel P4 3.0GHz 2MB EM64T, ECS i865pe, 1GB PC3200, 36gb WD Raptor, Windows Server 2003
Laptop: Dell Inspiron 9100 (Intel P4 3.2GHz 1MB Prescott, i865pe, 512MB PC3200, Mobility Radeon 9700, DVD+R/DL Burner), Windows XP
Linux: P3 450Mhz, 386MB ram, Slackware 10.1 (Running mySQL/Apache) |