FINDING THE GREATEST COMMON DIVISOR OF POLYNUMBERS USING MODERN PROGRAMMING LANGUAGES
This article presents the Euclidean algorithm for finding the greatest common divisor of polynomials using the modern programming language Python. It also discusses the mathematical foundations of this algorithm and its implementation in Python.
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-04-14
- DOI
- https://doi.org/10.5281/zenodo.15212742
- Primary Topic
- Advanced Computational Techniques in Science and Engineering
- Type
- article
- Field-Weighted Citation Impact
- 0.00