python Vs Julia (Seive of Eratosthenes)

#Python code  seive_n.py
def seive_n(N):
    s,is_divis = set(),False
    for i in xrange(2,N+1):
        arr = [i%j for j in s]
        if 0 in arr:
            is_divis = True
        else:
            is_divis = False
        if not is_divis:
            s.add(i)
            is_divis = False

    return sorted(s)

print seive_n(100000)


#Julia code sieve_n.jl


function seive_E(n)
  s,is_divisible = Set(),false
      for i in [2:n]
         arr = [i%j for j in s]
         is_divisible = in(0,arr)?true:false
         if !is_divisible
            push!(s,i)
            is_divisible = false
         end
      end
  sort([i for i in s])
end

println(seive_E(100000))