Discrete Math for Computer Science - Chapter 18: Prime factorization: gcd and Euclid’s algorithm

Authors

Houman Kamran Habibkhani, University of the PacificFollow

Files

Description

See this OER textbook full record by clicking here.

Publication Date

3-1-2025

Publisher

University of the Pacific

City

Stockton, CA

Disciplines

Discrete Mathematics and Combinatorics

Recommended Citation

Kamran Habibkhani, Houman, "Discrete Math for Computer Science - Chapter 18: Prime factorization: gcd and Euclid’s algorithm" (2025). Pacific Open Videos. 19.
https://scholarlycommons.pacific.edu/open-videos/19