Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upAdded solution for Project Euler problem 183 #3183
Conversation
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: b8bd2140-0b94-11eb-a59b-f3f3774a9991 |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: 4e25b9e0-0b95-11eb-a59b-f3f3774a9991 |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: b4a16fc0-0b9a-11eb-a59b-f3f3774a9991 |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: 84beb820-0b9b-11eb-a59b-f3f3774a9991 |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: 66cce5c0-0b9c-11eb-a59b-f3f3774a9991 |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: 8bca15e0-0b9d-11eb-a59b-f3f3774a9991 |
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. |
Travis tests have failedHey @prakhargurunani, TravisBuddy Request Identifier: 15ab9d80-0eda-11eb-9bff-abeacd856cb9 |
|
@Kush1101 Done ! All guidelines meet successfully |
|
Do not change the |
|
@dhruvmanila done ! I don't know how it mistakenly happened as I had switched to a different code editor. |
Describe your change:
Name: Maximum product of parts
Problem Statement: Let N be a positive integer and let N be split into k equal parts, r = N/k, so that
N = r + r + ... + r. Let P be the product of these parts, P = r × r × ... × r = rk.
For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2,
then P = 2.25 = 51.53632. Let M(N) = Pmax for a given value of N. It turns out that
the maximum for N = 11 is found by splitting eleven into four equal parts which leads
to Pmax = (11/4)4; that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.
However, for N = 8 the maximum is achieved by splitting it into three equal parts,
so M(8) = 512/27, which is a non-terminating decimal. Let D(N) = N if M(N) is a non-terminating
decimal and D(N) = -N if M(N) is a terminating decimal. For example, ∑ D(N) for 5 ≤ N ≤ 100 is 2438.
Find ∑ D(N) for 5 ≤ N ≤ 10000.
Reference: https://projecteuler.net/problem=183
reference: #2695
Checklist:
Fixes: #{$ISSUE_NO}.