A really inefficient way to compute prime numbers.

prime.py

#! /usr/bin/env python

curnum = 2
nums = []

while True:
    prime = True
    for num in nums:
        if curnum % num == 0:
            prime = False
            break
    if prime is True:
        print curnum 
    nums.append(curnum)
    curnum = curnum + 1