Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
-
Updated
Mar 11, 2024 - Python
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
A couple of algorithms I implemented in order to not get rusty with python.
A repository that holds some functions related to number theory.
All the different ways to find the greatest common divisor
Proyecto corto realizado para la clase de Matemática Discrete, contiene funciones para obtener el mcd de 2 números dados con el algoritmo de eculides, determinar si un número es primo o compuesto y determinar los factores de un número
Solutions to some interesting questions on different data structure and algorithm concepts
Add a description, image, and links to the greatest-common-divisor topic page so that developers can more easily learn about it.
To associate your repository with the greatest-common-divisor topic, visit your repo's landing page and select "manage topics."