Skip to content

Solution for the Euler Project problem 136 #12658

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.

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

Merged
merged 13 commits into from
Apr 17, 2025
Prev Previous commit
Next Next commit
Update sol1.py
  • Loading branch information
MaximSmolskiy authored Apr 17, 2025
commit 1fd3f75cce58251c2a580044bdfb01e461fa4ef5
1 change: 0 additions & 1 deletion project_euler/problem_136/sol1.py
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,6 @@
In the end it is counted how many n's have one solution.
"""


def solution(n_limit: int = 50 * 10**6) -> int:
"""
Define n count list and loop over delta, y to get the counts, then check
Expand Down