Added solution for Project Euler problem 129.#3113
Added solution for Project Euler problem 129.#3113dhruvmanila merged 4 commits intoTheAlgorithms:masterfrom fpringle:problem_129
Conversation
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.
|
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
|
Remove the label. |
|
Closing and reopening the pull request to run the latest test configuration. |
dhruvmanila
left a comment
There was a problem hiding this comment.
Thank you for your contribution and patience!
* Added solution for Project Euler problem 129. * Added doctest for solution() in project_euler/problem_129/sol1.py * Update formatting. Reference: TheAlgorithms#3256 * More descriptive function and variable names, more doctests.
* Added solution for Project Euler problem 129. * Added doctest for solution() in project_euler/problem_129/sol1.py * Update formatting. Reference: TheAlgorithms#3256 * More descriptive function and variable names, more doctests.
* Added solution for Project Euler problem 129. * Added doctest for solution() in project_euler/problem_129/sol1.py * Update formatting. Reference: TheAlgorithms#3256 * More descriptive function and variable names, more doctests.
* Added solution for Project Euler problem 129. * Added doctest for solution() in project_euler/problem_129/sol1.py * Update formatting. Reference: TheAlgorithms#3256 * More descriptive function and variable names, more doctests.
Name: Repunit divisibility
A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.
Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible by n, and let A(n) be the least such value of k; for example, A(7) = 6 and A(41) = 5.
The least value of n for which A(n) first exceeds ten is 17.
Find the least value of n for which A(n) first exceeds one-million.
Reference: #2695
Checklist:
Fixes: #{$ISSUE_NO}.