notmarkmiranda

def isPrime(n)
    factors = []    
    (2..n-1).each do |x|
        if (n % x == 0)
            return false
        end
    end
    factors << n
puts factors
end

notmarkmiranda

current = 1
previous = 0
sum = 0
new = 0

while new <= 4000000 do
    new = current + previous
    if (new % 2 == 0)
        sum += new
    end

notmarkmiranda

x = 0
y = 0

while x < 1000 do
    if ((x % 3 == 0) || (x % 5 == 0))
        y += x
    end
    x = x + 1
end