FINDING THE GREATEST COMMON DIVISOR OF POLYNUMBERS USING MODERN PROGRAMMING LANGUAGES
Keywords:
polynomial, Euclidean algorithm, Python programming language, algebra, computation.Abstract
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.
References
1. Khojiyev J.Kh. Fayneleyib A.S. "Algebra and number theory". Tashkent, "Uzbekistan", 2001.
2. A.G. Kurosh. "Course of higher algebra". Tashkent, Teacher, 1976.
3. Saotov Yu.U. "Higher Mathematics". Part 3. Tashkent, 1993.
4. Jumaniyozov Q. Methods of solving examples and problems in mathematics. Ed. TDPU. T-2014.
5. Shodmonova Sh., Mirsagatova N., Ibragimova G., Mirsolieva M. "Educational Technologies" Methodological Guide, T. - 2011. 35.
6. R. Iskandarov, R. Nazarov. "Algebra and Number Theory", Part 1-2. Tashkent, 1963.
7. R. Iskandarov. "Higher Algebra", Part 1. Tashkent, 1963.
8. Saotov Yu.U. "Higher Mathematics". Part 2. Tashkent, 1991.
ent, 1991.