[ create a new paste ] login | about

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

Python, pasted on Nov 22:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
def get_primes(limit):
    counter = 1
    primes = []
    for n in range(3, limit, 2):
        for x in range(3, n):
            if n%x == 0:
                break
        else:
            counter = counter + 1
            primes.append(n)
            #if counter == 20:
            #    break
    return primes

if __name__ == "__main__":
    primes = get_primes(2000)
    print primes[-1] # print highest prime


Output:
1
1999


Create a new paste based on this one


Comments: