Project Euler: Problem 7

Euler_7

def is_prime?(num)
  2.upto(num-1) { |i| return false if ((num % i) == 0) }
  true
end

def this_prime(position)
  results = []
	i = 2
	until results.count == position
		results << i if is_prime?(i)
		i += 1
	end
	p results.last
end