Added solution for Project Euler problem 75.#3129
Added solution for Project Euler problem 75.#3129dhruvmanila merged 5 commits intoTheAlgorithms:masterfrom fpringle:problem_75
Conversation
Travis tests have failedHey @fpringle, TravisBuddy Request Identifier: 4bd0dec0-0d95-11eb-9111-f326d0cb7f09 |
dhruvmanila
left a comment
There was a problem hiding this comment.
Announcement:
This message is sent to all pull requests which are OPEN, NOT MERGED, not containing 'wontfix' label and contains 'Project Euler' or 'Project' or 'Euler' (case doesn't matter) in their title. If this message doesn't apply to your pull request, please ignore this.
Message:
This is to notify all the users submitting a pull request for the Project Euler solution that the README.md file has been updated with all the style requirements necessary for the directory and solution files. Please read through it and make all the necessary changes required to your submission.
* Added solution for Project Euler problem 75. * Added doctest for solution() in project_euler/problem_75/sol1.py * Update docstring and 0-padding of directory name. Reference: TheAlgorithms#3256 * More descriptive variable names * Moved solution explanation to module-level docstring
* Added solution for Project Euler problem 75. * Added doctest for solution() in project_euler/problem_75/sol1.py * Update docstring and 0-padding of directory name. Reference: TheAlgorithms#3256 * More descriptive variable names * Moved solution explanation to module-level docstring
Name: Singular integer right triangles
It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided right angle triangle, and other lengths allow more than one solution to be found; for example, using 120 cm it is possible to form exactly three different integer sided right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can exactly one integer sided right angle triangle be formed?
Reference: https://projecteuler.net/problem=75
Reference: #2695
Checklist:
Fixes: #{$ISSUE_NO}.