[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

1773.0. "apps for mod inverse.." by MAYES::RMARTIN () Tue Jul 13 1993 17:13

   +---+---+---+---+---+---+---+ tm    DIGITAL      EQUIPMENT      CORPORATION
   |   |   |   |   |   |   |   |       SEAFMC   ACCOUNTS   PAYABLE   SHR1-3/L2
   | d | i | g | i | t | a | l |       333 South Street, Shrewsbury, MA  01545
   |   |   |   |   |   |   |   |       NM%WILLEE::RMARTIN   FAX:(508)-841-2066
   +---+---+---+---+---+---+---+       PHONE: (508)-841-2845     DTN: 237-2845
                                       "Excellence is THE Valued Difference!"

   Dear Fellow Math Noters,

     Is there a general catalog available of practical applications for the
   Modulo-Inverse that is described here in Note 5 and its replies? I have
   a general feeling that this algoritm has a lot of problem-solving power
   just waiting to be tapped somewhere. Just for what it's worth, and thanks
   for your help out there.

   Dick Martin
T.RTitleUserPersonal
Name
DateLines
1773.1VMSDEV::HALLYBFish have no concept of fireTue Jul 13 1993 18:231
    This is referring to note 5 in HEAVY::ALGORITHMS (q.v.)
1773.2CFSCTC::GILBERTSat Jul 31 1993 00:1412
FWIW, I developed an incredibly short algorithm for doing this modulo a
power of two -- in particular, the machine's word size.  This was for a
matrix package that would invert a matrix in place.  Since the interface
passed the array by VMS descriptor, I had to consider arrays of *integers*.
NB: In this case, only odd integers had inverses, and only matrices with
odd determinants had inverses.

I suggested using this in BASIC's run-time, but it was decided to keep what
was there, which after considerablr work would produce an array of almost
all zeroes.

Is there any use?  Perhaps.
1773.3RDVAX::GRIESTue Aug 03 1993 15:409
! FWIW, I developed an incredibly short algorithm for doing this modulo a
! power of two -- in particular, the machine's word size. 
 Ok I bite, I am always interested in fast (if that is what short means)
algorithms.

If you post your code, I will be thankful.

Gries
1773.4CFSCTC::GILBERTWed Aug 04 1993 23:201
    See note 170.