HASHING LAZY NUMBERS

This paper describes an extension of the ''lazy'' rational arithmetic (LEA) presented in [1]. A lazy arithmetic is an optimized version of t he usual exact arithmetics used in Symbolic Calculus, in Computational Geometry or in many other fields. We present a method originating fro m modular arithmetic for storing lazy numbers in hash-tables. This met hod uses results from the well-studied technique of ''hash coding'' ([ 4]) to compute efficient ''keys'' for lazy numbers. In fact, such keys may be used to hash code lazy numbers, or data containing lazy number s, such as vertices or line segments in Computational Geometry.