Procedure to solve
ax mod v=1 , where x is unknown
WARNING! This procedure may return negative values!

This algorithm has been taken from Bruce Schneier's "Applied Cryptography:
Protocols, Algorithms and Source Code in C" and translated to E 3.3a
by Maciej Plewa (maciejplewa@hotmail.com)
Please send my your comments, propositions or bug-reports.

 PERMSSN    UID  GID    PACKED    SIZE  RATIO     CRC       STAMP          NAME
---------- ----------- ------- ------- ------ ---------- ------------ -------------
[generic]                  663     896  74.0% -lh5- f9d9 Jul  7  1998 ext_euclidian
[generic]                  491     766  64.1% -lh5- d09f Jul  7  1998 ext_euclidian.e
[generic]                  313     492  63.6% -lh5- b497 Jul  7  1998 euclidian.readme
---------- ----------- ------- ------- ------ ---------- ------------ -------------
 Total         3 files    1467    2154  68.1%            Aug 18  1998