mamonu/euclidgcd.py

Created June 11, 2015 16:15

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

Select an option

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

Download ZIP

find greatest common denominator with Euclidean algorithm

Raw

euclidgcd.py

	def gcd(u, v):
	return gcd(v, u % v) if v else abs(u)

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