mirror of
https://github.com/jlengrand/project_euler.git
synced 2026-03-10 08:41:20 +00:00
a85994f38a
Still have to perform some good work on prime numbers! Signed-off-by: Julien Lengrand-Lambert <julien@lengrand.fr>
25 lines
569 B
Python
25 lines
569 B
Python
#!/usr/bin/env python
|
|
'''
|
|
Created on 8 feb. 2012
|
|
|
|
@author: Julien Lengrand-Lambert
|
|
|
|
DESCRIPTION: Solves problem 34 of Project Euler
|
|
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
|
|
|
|
Find the sum of all numbers which are equal to the sum of the factorial of their digits.
|
|
|
|
Note: as 1! = 1 and 2! = 2 are not sums they are not included.
|
|
'''
|
|
def sum_power():
|
|
"""
|
|
Finds
|
|
"""
|
|
|
|
|
|
return 1
|
|
|
|
if __name__ == '__main__':
|
|
# The major problem in there is to find the upper limit.
|
|
print "Answer : %d " % (sum_power())
|