Euclid's algorithm for computing greatest common divisors, with a modern improvement - Maple Application Center
Application Center Applications Euclid's algorithm for computing greatest common divisors, with a modern improvement

Euclid's algorithm for computing greatest common divisors, with a modern improvement

Author
: Michael Monagan
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
This worksheet is intended to show two things, firstly, how to write simple programs in Maple, and secondly, a expository study of Euclid's algorithm and how to compute the greatest common divisor of two integers a and b. First, what is the greatest common divisor of two integers and why is this calculation important?

Application Details

Publish Date: June 18, 2001
Created In: Maple V
Language: English

More Like This

Subgroup lattice plotting in 3-D
Number of iterations in Collatz's problem
All terminal reliability polynomial for a graph G with probabilty of edge failure p
FORTRAN code generation with a linear algebra application
Motion of a bullet under air resistance
An interesting 6x6 matrix
Finite splitting fields
Symbolic eigenvalues & eigenvectors
Diatomic anharmonic oscillator
Primitive trinomials
1
Commutator package for Maple 6
1