Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version nyu B notes v1.5 12/10/84; site acf4.UUCP
Path: utzoo!linus!philabs!cmcl2!acf4!hkr4627
From: hkr4627@acf4.UUCP (Hedley K. J. Rainnie)
Newsgroups: net.math
Subject: Fraction math algs.
Message-ID: <920001@acf4.UUCP>
Date: Thu, 25-Apr-85 18:30:00 EST
Article-I.D.: acf4.920001
Posted: Thu Apr 25 18:30:00 1985
Date-Received: Sat, 27-Apr-85 05:45:16 EST
Organization: New York University
Lines: 10

I am attempting to perform limited precision fractional math using a digital
computer. The idea is to not use a float where a fraction would do. A 
fraction also is just integer multiplication,addition,etc... No floating
point nastiness need creep into the calculation. I am troubled by ways to
efficiently handle normalization. I was wondering whether anyone in the 
mathematics community has heard of procedures that deal with this problem.
I feel that for my applications it will be much faster than floating point
work.

Thank you, Hedley.