Last active
August 29, 2015 14:13
-
-
Save tu98/084b2ec00418095bd48f to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 | |
(2..(number-1)).each do |x| | |
if number % x == 0 | |
largest_prime = x unless x < largest_prime | |
tree(number / x, largest_prime) | |
end | |
end | |
end | |
tree(600851475143,0) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment