jshawl · August 29, 2015 14:10
diff --git a/gcd.rb b/gcd.rb
 def gcd *args
 divisors = args.map do |arg|
   (1..arg).select { |n| arg % n == 0} # find all divisors
 end
 divisors.inject(:&).max # find intersection of all arrays, grab max value
 end

 p gcd( 12, 24, 36 )
	def gcd *args
	divisors = args.map do \|arg\|
	(1..arg).select { \|n\| arg % n == 0} # find all divisors
	end
	divisors.inject(:&).max # find intersection of all arrays, grab max value
	end

	p gcd( 12, 24, 36 )