Skip to content

feat(euler): Optimize problem 034 with a lower upper bound #13531

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

feat(euler): Optimize problem 034 with a lower upper bound #13531

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
beda6fc
feat(euler): Optimize problem 034 with a lower upper bound
ArnabTechiee Oct 16, 2025
9c25148
fix: Update proof link to a stable Rosetta Code source
ArnabTechiee Oct 18, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion project_euler/problem_034/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,9 @@ def solution() -> int:
>>> solution()
40730
"""
limit = 7 * factorial(9) + 1
# The upper bound is 1,499,999, as shown in this proof:
# https://rosettacode.org/wiki/Talk:Factorions
limit = 1_499_999
return sum(i for i in range(3, limit) if sum_of_digit_factorial(i) == i)


Expand Down