A simple program that calculates the Greatest Common Divisor through a user input
-
Updated
Jul 27, 2018 - C++
A simple program that calculates the Greatest Common Divisor through a user input
A repository that holds some functions related to number theory.
C#/Mono utility that calculates the Greatest Common Divisor of an arbitrary amount of positive integers.
This is a project that can help with boring calculations!
Implementations of some algorithms in C++
All the different ways to find the greatest common divisor
A program that calculates the greatest common divisor and least common multiple of 2 numbers requested as input from the user.
Examples of algorithms written in Kotlin
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
Implementation of the extended "Euclidean" algorithm in java.
Solutions to some interesting questions on different data structure and algorithm concepts
Membuat Sebuah Algoritma untuk mengitung Pecahan GCD (Greatest Common Divisor) atau biasa kita kenal dengan FPB (Faktor Persekutuan Terbesar)
Computation of the greatest common divisor and least common multiple.
Implementation of Euclid's Algorithm in Python and Java to calculate the Greatest Common Divisor of two integers
EuclideanAlgorithm in C#
Calculates the GCD and LCM for given set of numbers.
Practical work on the discipline "Algorithms and data structures" of the second year.
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."