diff options
| author | James Smith <js5@sanger.ac.uk> | 2022-01-25 16:25:26 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-01-25 16:25:26 +0000 |
| commit | 600e1bd1c46f7679ccd7195574af14f7790845f6 (patch) | |
| tree | e75ee443c0419c74eae664c74280cad2e5a452ca /challenge-149 | |
| parent | 0d01621b90240a4320aaf59d0a8f8434b2f9b510 (diff) | |
| download | perlweeklychallenge-club-600e1bd1c46f7679ccd7195574af14f7790845f6.tar.gz perlweeklychallenge-club-600e1bd1c46f7679ccd7195574af14f7790845f6.tar.bz2 perlweeklychallenge-club-600e1bd1c46f7679ccd7195574af14f7790845f6.zip | |
Update README.md
Diffstat (limited to 'challenge-149')
| -rw-r--r-- | challenge-149/james-smith/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-149/james-smith/README.md b/challenge-149/james-smith/README.md index f6404ea1ec..a11172ed66 100644 --- a/challenge-149/james-smith/README.md +++ b/challenge-149/james-smith/README.md @@ -89,5 +89,5 @@ The values for each value of $N are given below up to (base 15) - the largest va | 15 | 659854601 | 435408094460869201 | EDAC93B24658701 | 0.315265 | 190654 | -You will note that most time is taken where `$n` is 13. You will note that for `$n` in `3`, `5`, `13` there are no pan-digital solutions so we have to loop through all the 13 digit numbers and reach the 12 digit numbers before we find a solution. **97.6%** of the checks for matching digits are in the case where `$n` is 13 (approximately **97%** of the time in the code). +You will note that most time is taken where `$n` is 13. You will note that for `$n` in `2`, `3`, `5`, `13` there are no pan-digital solutions so we have to loop through all the 13 digit numbers and reach the 12 digit numbers before we find a solution. **97.6%** of the checks for matching digits are in the case where `$n` is 13 (approximately **97%** of the time in the code). |