fork download
copy 
  1. def e_primo(num): # verificar se e primo
  2.     return all(num%i!=0 for i in range(2,num)) 
  3.  
  4. qtd_tuples = 10 # input
  5. results = [] # armazenar resultados
  6. curr_prime = 1
  7. while len(results) < qtd_tuples:
  8.     curr_prime += 2
  9.     if(e_primo(curr_prime) and e_primo(curr_prime+2)):
  10.         results.append((curr_prime, curr_prime+2))
  11.  
  12. print(results)
Success #stdin #stdout 0.02s 9220KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109)]
https://ideone.com/MSdeVF
language:
Python 3 (python  3.9.5)
created:
3 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!