Euler 7 (Python)

>>> from math import sqrt
>>> def primo(n):
...     for i in xrange(2,int(sqrt(n))+1):
...         if n % i == 0:
...             return False
...     return True
>>> while i < 10002:
...     if primo(a):
...             i +=1
...     a += 1
...
>>> i
10002
>>> a
104744
>>> a-1
104743