Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
-
Updated
Feb 22, 2023 - JavaScript
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
Implementations of some algorithms in C++
Greatest Common Divisor Finder With Java
Programs for the Casio fx-5800P calculator
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
A library for computing modular GCD of univariate polynomials.
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!
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.
EuclideanAlgorithm in C#
🔢💻 Get the greatest common devisor CLI
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."