Python Algoritmos.esPrimo Examples

Example #1

File: problem49.py Project: miguel-vila/problemas-de-programacion

def permutacionesMayoresYprimas(n):
    r=[]
    for i in str(n):
        r.append(int(i))
    l=[n]
    for i in range(math.factorial(len(r))):
        p=int(Algoritmos.nPermutacion2(i+1,r))
        if p>n and Algoritmos.esPrimo(p):
            l.append(p)    
    return l

Example #2

File: problem49.py Project: miguel-vila/problemas-de-programacion

def problem49():
    ini=time.time()
    for i in range(1488,10000):
        if Algoritmos.esPrimo(i) and not('0' in str(i) ):
            perm=permutacionesMayoresYprimas(i)
            sub=subsecuenciaAritmetica(perm)
            if len(sub)!=0:
                print(time.time()-ini)
                return sub
    return []