We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent beda6fc commit 9c25148Copy full SHA for 9c25148
project_euler/problem_034/sol1.py
@@ -31,7 +31,7 @@ def solution() -> int:
31
40730
32
"""
33
# The upper bound is 1,499,999, as shown in this proof:
34
- # https://math.stackexchange.com/a/112383/89462
+ # https://rosettacode.org/wiki/Talk:Factorions
35
limit = 1_499_999
36
return sum(i for i in range(3, limit) if sum_of_digit_factorial(i) == i)
37
0 commit comments