Created
January 16, 2015 08:39
-
-
Save anonymous/3a065ce6ebef2c232d44 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 factor_finder(x,a) | |
n=0 | |
x.times do | |
n += 1 | |
if x % n == 0 | |
a.push(n) | |
end | |
end | |
end | |
#factor finder | |
def prime_checker(x) | |
n = 2 | |
remainder = x % n | |
finished = false | |
while finished == false do | |
if n == x | |
puts "#{n} is prime" | |
finished = true | |
elsif remainder == 0 | |
puts "#{x} is not prime" | |
finished = true | |
else | |
n+=1 | |
finished = false | |
end | |
end | |
end | |
#prime checker | |
new_array = [] | |
factor_finder(28,new_array) | |
puts new_array | |
prime_checker(new_array.each) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment