def sf(n):
return sumadigitos(f(n))
from aritmetica import digitos
from aritmetica import Factoriales
from aritmetica import sumadigitos
def f(n):
return sum([Factoriales[d] for d in digitos(n)])
def sf(n):
return sumadigitos(f(n))
L = [sf(n) for n in xrange(100000000)]
G = [L.index(i) for i in xrange(0,151)]
print G
print sum([sumadigitos(G[k]) for k in xrange(1,151)])
from fractions import Fraction
from aritmetica import sumadigitos
E = [2, 1, 2]
for n in xrange(2, 40):
E.extend([1, 1, 2 * n])
for k in range(1, 100):
part = E[:k]
r = Fraction(1, 1)
# print part[::-1],
for a in part[::-1]:
r = a + 1 / r
print r
print "S:", sumadigitos(r.numerator)
def check(n): b = sumadigitos(n) if b<2: return False return probar(n,b)
from aritmetica import sumadigitos
import time
T0=time.time()
c=0
for n in xrange(9,10**18,9):
if sumadigitos(n) == sumadigitos(137*n):
c+=1
print c
print time.time()-T0
