Created by cahier-algo-2de-indice2019
Created on November 27, 2018
228 Bytes
def nbdv(a): n=0 for i in range(1,a+1): if a%i==0: n=n+1 return(n) def nbpremier(n): c=0 for a in range(1,n+1): if nbdv(a)==2: c=c+1 return(c)