Vinyasi's public fiddles
-
dcftsojn
No-Library (pure JS), HTML, CSS, JavaScript
-
gm0tqvp6
No-Library (pure JS), HTML, CSS, JavaScript
-
A Demonstration of RSA Encryption
This example now uses a shortcut to large exponentiations described by Dr. Herong Yang.
-
An Expanded and Streamlined Euclidean Algorithm for Computing the Greatest Common Divisor.
This method for using the Euclidean Algorithm to compute the Greatest Common Divisor will accept any quantity of integers whose values are greater than zero and not equal to each other.
-
Randomizing Demonstration of the Euclidean Algorithm for Infinite Quantity of Integers.
This does not perform GCD seperately -- on all pairs of integers in a set of two or more integers, but sorts and performs GCD on neighboring pairs resulting from a presort, and then integrates all remainders by resorting them before repeating the GCD upon neighboring remainders which have not yet zeroed out. The smallest integer, or remainder, is always GCD'ed with zero to obtain a remainder equal to itself to ensure a quantity of modulo operations equal to the quantity of terms (rather than a quantity of modulo operations one less than the full quantity of non-zeroed terms).