THEORY NET: A finite representation of rationals

Article View: ut.theory

Article #171

#171

From: arvind
Date: Fri, 16 Oct 1987 13:53

28 lines
1169 bytes

Date:         7 Oct 1987 16:01:38-EDT (Wednesday)
From: Peter Wayner <WAYNER@svax.cs.cornell.edu>
Subject:      A finite representation of rationals

Does anyone have any  references on a
method of encoding all rational fractions into  a finite representation of
the form:
     
 P
 - =       a   a   a   a   ..... a
 Q          2   3   4   5          n
     
     
  where  each a   is an integer,   0<=a   < i.
               i                       i
with the  result being
     
P         (     a         )
-  =  sum (   ---i--      )
Q         (     i!        )
     
     
     
      Thank you:
     
      Peter Wayner
     
      (wayner@crnlcs.bitnet   or   wayner@svax.cs.cornell.edu   )

Technical Details

Message-ID: <5533@utcsri.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!utcsri!arvind

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!utgpu!utcsri!arvind
From: arvind@utcsri.UUCP
Newsgroups: ut.theory
Subject: THEORY NET: A finite representation of rationals
Message-ID: <5533@utcsri.UUCP>
Date: Fri, 16-Oct-87 09:53:35 EDT
Article-I.D.: utcsri.5533
Posted: Fri Oct 16 09:53:35 1987
Date-Received: Sat, 17-Oct-87 14:02:32 EDT
Distribution: ut
Organization: CSRI, University of Toronto
Lines: 28