Sam Rawlins srawlins

## modular_arithmetic.rb
# Some modular arithmetic helper methods useful for number theory or
# cryptography.
#
# # Examples
#
# Compute the greatest common denominator of 114 and 48:
#
#     gcd(114, 48) #=> 6
#
# Compute `a` and `b` such that `a*x + b*y = gcd(x, y)`:
	# Some modular arithmetic helper methods useful for number theory or
	# cryptography.
	#
	# # Examples
	#
	# Compute the greatest common denominator of 114 and 48:
	#
	# gcd(114, 48) #=> 6
	#
	# Compute `a` and `b` such that `ax + by = gcd(x, y)`: