Ruby_Exercise15

def prime(n)
  prime_no = []
  a =0
    if n==2
      print "#{n} is prime no"
    end
  prime_no << 2
  3.step(n,1) do |num|
  2.step(num/2,1) do |k|
      if num % k == 0
        a =1
      break
    end
  end
      if a == 0
        prime_no << num
      end
      a = 0
    end
  puts prime_no.inspect
end

print "Enter the number upto which you want Prime numbers- "
n = gets.to_i
prime(n)