Project Euler 5

Project Euler 5

def devisible?(num, limit)
  devisible = true
	limit.downto(1) do |i|
		devisible = false if num % i != 0
		break if !devisible
	end
	devisible
end

def smallest_multiple(limit)
	smallest_multiple = limit
	while true
		return smallest_multiple if devisible?(smallest_multiple, limit) && smallest_multiple != limit
		smallest_multiple += limit
	end
end

p smallest_multiple(20)

# much faster solution:
# require 'rational'
# num = (1..20).inject(1) { |result, n| result.lcm n }
# puts "Smallest evenly divisible number is #{ num }."