Package de.tilman_neumann.jml.gcd

  • Class Summary
    Class Description
    EEA31
    Extended Euclidean algorithm, mostly used to compute the modular inverse of x (mod y).
    EEA31.Result  
    EEA63
    Extended Euclidean algorithm, mostly used to compute the modular inverse of x (mod y).
    EEA63.Result  
    Gcd
    GCD implementations for BigIntegers.
    Gcd31
    GCD implementations for 32-bit integers.
    Gcd63
    GCD implementations for longs.