GCD, binary representaion extension, polynomial
-
Updated
Aug 8, 2017 - C#
GCD, binary representaion extension, polynomial
A few scripts for the course 01017 Diskret Matematik at DTU, simply for the second part of the course which contains a lot of boring and long calculations. Here it's simply done in a few scripts.
Introductory Python course for math students
Web app that uses the euclidean algorithm for classifications
Euclidiana is a web application that determines different characteristics by means of the Euclidean and Naive Bayes distance algorithm.
A simple program that calculates the Greatest Common Divisor through a user input
Euclid's greatest common divisor algorithm as a JavaScript component and npm package
|| Безопасность вычислительных систем (gui)
My own script to calculate the private key on RSA using the Extended Euclidean Algorithm aproximation.
PHP fraction library with fraction simplification and float to fraction conversion.
Given repository contains Unity + vuforia animation project, where a witch and dragon fights based on their distance.
Finds the greatest common divisor of two integers using a recursive function based on the Euclidean Algorithm. Simple netbeans-generated GUI.
Implementation of finite polynomial rings to support coding schemes like Reed-Solomon and Network Coding
Using Principal Component Analysis and Euclidean Classifier for face recognition with GUI
Sviluppo dell'algoritmo esteso di euclide. Permette all'utente di calcolare l'MCD tra due numeri interi e restituisce i coefficenti dell'identità di Bezout.
A couple of algorithms I implemented in order to not get rusty with python.
Euclidean Division & Euclidean Modulo for Nim
Elliptic Curves and other algorithms
All you need to save time :p
Add a description, image, and links to the euclidean-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-algorithm topic, visit your repo's landing page and select "manage topics."