AmirSoleimani/gcd.go

Created November 21, 2018 09:46

Star 0 You must be signed in to star a gist
Fork 0 You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/AmirSoleimani/c4b7435308fc5a121c4c35cba1e07024.js"></script>
Save AmirSoleimani/c4b7435308fc5a121c4c35cba1e07024 to your computer and use it in GitHub Desktop.

Download ZIP

GCD - Greatest Common Divisor

Raw

gcd.go

	package cryptogcd

	//GCD Greatest Common Divisor (Factor)
	func GCD(a, b int) int {
	var Remainder int
	for {
	Remainder = a % b
	a = b
	b = Remainder
	if b == 0 {
	break
	}
	}
	return a
	}

Author

AmirSoleimani commented Nov 21, 2018

GCD is known as the greatest common divisor, or greatest common factor (gcf), and is the largest positive integer that divides into two numbers without a remainder. For example, the GCD of 9 and 15 is 3. It is an operation that is used many encryption algorithms

Sample:
9, 15 -> 3
54, 8 -> 6

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment