Created
November 1, 2016 17:16
-
-
Save FsDevNinja/244720afaaf429728d348faaefa68f58 to your computer and use it in GitHub Desktop.
Finding the largest prime factor in a given number
This file contains hidden or 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
class LargestPrimeFactor | |
def largest_prime_of(number) | |
return nil if number == nil | |
arr = [] | |
(2..number).each do |n| | |
if prime?(n) | |
arr << n | |
end | |
end | |
arr.reject!{|n| number % n != 0} | |
arr[-1] | |
end | |
def prime?(number) | |
(2..number-1).each do |num| | |
if number%num == 0 | |
return false | |
end | |
end | |
true | |
end | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment