tu98

def prime?(n)  
  (2..(n-1)).each { |x| return false if n % x==0 }  
  return true
end

def tree(number, largest_prime)
  if prime?(number)
    largest_prime = number unless number < largest_prime
    return largest_prime #Where I think the problem is
  end