12/5    How does one find the multiplicative inverse with modulus m?
        \_ take Euler's method for finding the gcd of two numbers. take
             \_ Euclid's  -ok
           one number as m and the other as the number you would like to
           find the inverse of, and run them through this. then use this
           to construct an expression like "1=<your num>*a + b*m". a is
           your inverse. ask me if you need something more detailed. -chialea
           \_ okay thanks chialea. Can you please point me to a URL that
                explains how the Knapsack problem + multiplicative inverse
                stuff are used for public/private key encryption? Thanks.