/gcd_calculator

the gcd (greatest common divisor) calculator uses euclid's algorithm to calculate the gcd of any two given numbers. it also shows you the steps used to obtain the final answer in a nice small table. this came in handy when doing homework for my ece 103 course at the university of waterloo since the actual method was quite time consuming to do by hand.

Primary LanguagePHPGNU General Public License v3.0GPL-3.0

GCD (Greatest Common Divisor) Calculator
Created by Michael Soares (mikesoares.com)

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.

---------------------------------------------------------------------

USAGE: Upload this file to a PHP-capable server, browse to the full URL of the file,
and add two parameters, a and b, to the end of the URL to specify which numbers
you would like to find the GCD of.

EXAMPLE: http://www.example.com/gcd.php?a=12&b=20 would give you the GCD of 12 and 20 (=4),
as well as show you the steps used using Euclid's algorithm to obtain the final answer.

OTHER NOTES:	x*b + y*a = r
				r is the remainder
				q is the quotient
				i is the iteration