Computing the greatest common divisor (GCD) of two numbers
-
Updated
Jan 6, 2022 - Python
Computing the greatest common divisor (GCD) of two numbers
Solution to Hacker's Rank question "Restaurant" solution in mathematics fundamentals
Python Try
This is a very simple python script that helped me find the Greatest Common Divisor of two numbers using the Euclidean Algorithm (with steps!)
Algorithm python
Proste programy napisane w 🐍PYTHONIE🐍
A simple Docker environment for the Grand Comic Database (GCD) with some Python scripts for interacting with the database
Code from Introduction to Computer Security course from PPGCC at UFPA with Roberto Samarone
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
To calculate the GCD Number using loop and with Euclidean method
(CVPR2024 Highlight) Novel Class Discovery for Ultra-Fine-Grained Visual Categorization (UFG-NCD)
Computer Algebra problem-solving function using SymPy . Projects for the course "Computer Algebra I" https://www.e-ce.uth.gr/studies/undergraduate/courses/ece413/?lang=en
The training project "Brain Games" on the Python Development course on Hexlet.io
Add a description, image, and links to the gcd topic page so that developers can more easily learn about it.
To associate your repository with the gcd topic, visit your repo's landing page and select "manage topics."