fork download
copy 
  1. import math
  2.  
  3. def isprime(l, n):
  4.     if str(n)[-1] in ['2', '4', '5', '6', '8', '0']:
  5.         return 0
  6.     k = int(math.sqrt(n))
  7.     for d in l:
  8.         if d > k:
  9.             break
  10.         if n % d == 0:
  11.             return 0
  12.     return 1
  13.  
  14. l = [2]   
  15. for i in range(2, 10000):
  16.     if isprime(l, i):
  17.         l.append(i)
  18.  
  19. print('Done')
Success #stdin #stdout 0.02s 28384KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Done
https://ideone.com/9dZbe5
language:
Python 3 (python  3.12)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!