diff options
| author | James Smith <js5@sanger.ac.uk> | 2021-11-04 17:13:45 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-11-04 17:13:45 +0000 |
| commit | bf5538ad1f5731602298463bb9c819339f94736b (patch) | |
| tree | 32a9adfa95f0bf3e0a3330c0ee61dd86100b6111 | |
| parent | c1a9ecb43a5a9194946c464511f0ec0054dde082 (diff) | |
| download | perlweeklychallenge-club-bf5538ad1f5731602298463bb9c819339f94736b.tar.gz perlweeklychallenge-club-bf5538ad1f5731602298463bb9c819339f94736b.tar.bz2 perlweeklychallenge-club-bf5538ad1f5731602298463bb9c819339f94736b.zip | |
Update README.md
| -rw-r--r-- | challenge-137/james-smith/README.md | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/challenge-137/james-smith/README.md b/challenge-137/james-smith/README.md index 16a55aa072..9bdd58ce27 100644 --- a/challenge-137/james-smith/README.md +++ b/challenge-137/james-smith/README.md @@ -172,6 +172,7 @@ To 10 million the time taken was approximately 1 min 40s; 20 million ~ 3 min 50s | 20,000,000 | 4,521,930 | 3 min 50s | | 30,000,000 | 7,177,742 | 31 min 40s | +The last of these is still quicker than getting Lychrel numbers up to 1,000,000 using the "large" method. ### Explanation For every sequence generated above - all the numbers are either not Lychral numbers or candidate Lychral numbers. Once we either get to a palindrome OR reach the "end of the sequence" we can tag every number as either a candidate Lychral number or not. This reduces the number of calculations. |