[ create a new paste ] login | about

Link: http://codepad.org/W57mWx7a    [ raw code | output | fork ]

programmingpraxis - Python, pasted on Jul 31:
def is_prime(n):
    if n < 2:
        return 0
    if n == 2:
        return 1
    if n % 2 == 0:
        return 0
    i = 3
    while i * i <= n:
      if n % i == 0:
          return 0
      i = i + 2
    return 1

def prime(n):
    i = 1
    while 1:
        if is_prime(i):
            n = n - 1
        if n == 0:
            return i
        i = i + 1

print prime(1000)


Output:
1
7919


Create a new paste based on this one


Comments: