Skip to content

Instantly share code, notes, and snippets.

@davidsonbrsilva
Created March 31, 2019 23:33
Show Gist options
  • Save davidsonbrsilva/9d899931b390bdb4ce876686630f0667 to your computer and use it in GitHub Desktop.
Save davidsonbrsilva/9d899931b390bdb4ce876686630f0667 to your computer and use it in GitHub Desktop.
Implementação de testes de primalidade: lazy
# Lazy: verifica se um número é primo contando seus divisores.
def lazy(number):
divisions = 0
# Conta o número de divisores de number.
for index in range(1, number + 1):
if number % index == 0:
divisions += 1
# Se o número de divisores for maior que 2 significa que number é primo.
if divisions > 2:
return False
if divisions < 2:
return False
return True
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment