Transformations In Integer Programming

A Computational Introduction to Number Theory and …

3.3 Basic integer arithmetic 55 3.4 Computing in Z n 64 3.5 Faster integer arithmetic 69 3.6 Notes 71 4 Euclid’s algorithm 74 4.1 The basic Euclidean algorithm 74 4.2 The extended Euclidean algorithm 77 4.3 Computing modular inverses and Chinese remaindering 82 v

  Number, Theory, Integre, Number theory