aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJames Smith <js5@sanger.ac.uk>2022-01-24 16:30:45 +0000
committerGitHub <noreply@github.com>2022-01-24 16:30:45 +0000
commitdedf5a105550b946c57596926d534ecab1683fa9 (patch)
treef7088731e6164623c1c6c5248bf97f8bf18a9259
parent27863c17b772945f2795edcba873a65500791469 (diff)
downloadperlweeklychallenge-club-dedf5a105550b946c57596926d534ecab1683fa9.tar.gz
perlweeklychallenge-club-dedf5a105550b946c57596926d534ecab1683fa9.tar.bz2
perlweeklychallenge-club-dedf5a105550b946c57596926d534ecab1683fa9.zip
Update README.md
-rw-r--r--challenge-149/james-smith/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-149/james-smith/README.md b/challenge-149/james-smith/README.md
index 37e10a0cab..475b4dfb28 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 `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).