#!/usr/bin/env python
from math_tools import factorial, digits
"""https://projecteuler.net/problem=20"""
if __name__ == "__main__":
print sum(digits(factorial(100)))
#!/usr/bin/env python
from math_tools import digits
"""https://projecteuler.net/problem=30"""
if __name__ == '__main__':
result = 0
for n in range(10, (9**5) * len(str((9**5)))):
if sum(i**5 for i in digits(n)) == n:
result += n
print(result)
#!/usr/bin/env python from math_tools import digits """https://projecteuler.net/problem=56""" if __name__ == '__main__': result = 0 for a in range(0, 100): for b in range(0, 100): result = max(result, sum(digits(a ** b))) print(result)
#!/usr/bin/env python
from math_tools import factorial, digits
"""https://projecteuler.net/problem=34"""
if __name__ == "__main__":
upper_bound_coef = 1
while len(str(upper_bound_coef * factorial(9))) > upper_bound_coef:
upper_bound_coef += 1
result = 0
for n in range(10, upper_bound_coef * factorial(9)):
if sum(factorial(i) for i in digits(n)) == n:
result += n
print(result)
#!/usr/bin/env python from math_tools import factorial, digits """https://projecteuler.net/problem=20""" if __name__ == '__main__': print sum(digits(factorial(100)))
#!/usr/bin/env python
from math_tools import factorial, digits
"""https://projecteuler.net/problem=34"""
if __name__ == '__main__':
upper_bound_coef = 1
while len(str(upper_bound_coef * factorial(9))) > upper_bound_coef:
upper_bound_coef += 1
result = 0
for n in range(10, upper_bound_coef * factorial(9)):
if sum(factorial(i) for i in digits(n)) == n:
result += n
print(result)
#!/usr/bin/env python from math_tools import digits """https://projecteuler.net/problem=30""" if __name__ == '__main__': result = 0 for n in range(10, (9 ** 5) * len(str((9 ** 5)))): if sum(i ** 5 for i in digits(n)) == n: result += n print(result)
#!/usr/bin/env python
from math_tools import digits
"""https://projecteuler.net/problem=56"""
if __name__ == '__main__':
result = 0
for a in range(0, 100):
for b in range(0, 100):
result = max(result, sum(digits(a**b)))
print(result)
