this is a representation of the extended Euclidean algorithm in rust

A comprehensive repository featuring practical implementations, tutorials, and resources for exploring cryptographic algorithms and protocols.

🐘 Arbitrary precision arithmetic for integers in big-endian order for JavaScript

Gaussian Integers and Gaussian Rational Numbers

C++ template project provides a flexible way to work with polynomials and calculate their real roots.

Examples of algorithms written in Kotlin

Math library of number theory (only natural numbers)

Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.

Problems and simulators made in Haskell

This program offers a C++ solution to compute the Greatest Common Divisor (GCD) of two strings, showcasing an application of the Euclidean algorithm for string manipulation.

This repository contains a method to reconstruct the motion, or swing, of cast-off spatter patterns. The method is based on stain inspection and Euclidean geometry. The reconstructed swing is represented as a three-dimensional region of statistical likelihood. See the README.md for instructions to install and run the repository scripts.

Repository containing algorithmic solutions to Project Euler challenges. Each solution has been methodically developed, optimized, and rigorously tested. Engage in mathematical and computational problem-solving.

A repository that holds some functions related to number theory.

The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. It is a recursive algorithm.

A crowd/audience engagement measuring system

An assortment of functions for number theory / discrete math type problems

Pensamento Computacional 1º ano

Estudos de desempenho e funcionamento de algoritmos e estruturas

Реалізація математичного алгоритму Евкліда для знаходження найбільшого спільного дільника в класичному та модифікованому варіантах