some math-related js classes and possibly more
-
Updated
May 25, 2024 - JavaScript
some math-related js classes and possibly more
EPR: A Factoring and Primality checking library for C++
Examples of algorithms written in Kotlin
Compute the greatest common divisor (gcd).
Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.
A repository that holds some functions related to number theory.
EuclideanAlgorithm in C#
Implementations of some algorithms in C++
🔢💻 Get the greatest common devisor CLI
🔢 Get the greatest common devisor of two numbers
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
Implementation of the extended "Euclidean" algorithm in java.
Computation of the greatest common divisor and least common multiple.
Python
Practical work on the discipline "Algorithms and data structures" of the second year.
A program that calculates the greatest common divisor and least common multiple of 2 numbers requested as input from the user.
This is a project that can help with boring calculations!
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
but what 'bout B-For Math ?
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."