Skip to content

Project Euler 70 Solution #3041

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

Merged
dhruvmanila merged 11 commits into from
Nov 21, 2020
Merged

Project Euler 70 Solution #3041

Changes from 1 commit
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
bbdaeb1
Add solution for Project Euler 70, Fixes: #2695
peteryao7 Oct 8, 2020
ca5da04
Remove parameter from solution()
peteryao7 Oct 8, 2020
ebdd4ed
Add tests for all functions, add fstring and positional arg for solut…
peteryao7 Oct 15, 2020
75bb975
Merge branch 'master' into peteryao7_project-euler-70
peteryao7 Oct 15, 2020
a3fb36c
Merge branch 'master' into peteryao7_project-euler-70
peteryao7 Oct 16, 2020
4d189fb
Rename directory to 070
peteryao7 Oct 16, 2020
8d89b90
Move up explanation to module code block
peteryao7 Oct 16, 2020
c34bd6a
Move solution() below helper functions, rename variables
peteryao7 Oct 16, 2020
4c4d3d2
Remove whitespace from defining min_numerator
peteryao7 Oct 16, 2020
bd354fe
Add whitespace
peteryao7 Oct 16, 2020
efc6e1d
Improve type hints with typing.List
dhruvmanila Nov 21, 2020
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
Prev Previous commit
Next Next commit
Remove parameter from solution()
  • Loading branch information
@peteryao7
peteryao7 committed Oct 8, 2020
commit ca5da045c9b4223e1dc7b619a850f9f26e4bac79
5 changes: 3 additions & 2 deletions project_euler/problem_70/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
"""


def solution(max: int) -> int:
def solution() -> int:
"""
This is essentially brute force. Calculate all totients up to 10^7 and
find the minimum ratio of n/φ(n) that way. To minimize the ratio, we want
Expand All @@ -30,6 +30,7 @@ def solution(max: int) -> int:

min_num = 1 # i
min_den = 0 # φ(i)
max = 10000000
totients = get_totients(max + 1)

for i in range(2, max + 1):
Expand Down Expand Up @@ -88,4 +89,4 @@ def has_same_digits(num1: int, num2: int) -> bool:


if __name__ == "__main__":
print(solution(10000000))
print(solution())