Chapter 19. Algorithms in Number Theory

GCD and Extended Euclidean have no separate classical form on this site.

Both programs in this chapter — LLP-GCD and LLP-ExtGCD — are presented on the LLP companion page »; Extended Euclidean runs there as its own forbidden/advance LLP program (see the LLP-ExtGCD section there), so there is no additional classical variant to show separately here. The book's Chinese Remainder Theorem, LCM, quadratic CRT, and multiplicative-order material is not yet published on this site.