Euclid's algorithm for computing greatest common divisors, with a modern improvement - Maple Application Center
  Submit your work
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
1
Engineering software solutions from Maplesoft
 Download
 Preview
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
This app is not in any Collections

Add to a Collection

Tags

precalculus algorithm number-theory

More Like This

Subgroup lattice plotting in 3-D

Michael Monagan

2
Number of iterations in Collatz's problem

Michael Monagan

2
All terminal reliability polynomial for a graph G with probabilty of edge failure p

Michael Monagan

1
FORTRAN code generation with a linear algebra application

Michael Monagan

0
Motion of a bullet under air resistance

Michael Monagan

0
An interesting 6x6 matrix

Michael Monagan

0
Symbolic eigenvalues & eigenvectors

Michael Monagan

3
Finite splitting fields

Michael Monagan

4
Planck radiation

Michael Monagan

1
Diatomic anharmonic oscillator

Michael Monagan

0
Primitive trinomials

Michael Monagan

1
Commutator package for Maple 6

Michael Monagan

1