aboutsummaryrefslogtreecommitdiff
path: root/challenge-155
diff options
context:
space:
mode:
authorJames Smith <js5@sanger.ac.uk>2022-03-07 21:38:08 +0000
committerGitHub <noreply@github.com>2022-03-07 21:38:08 +0000
commitec35f0f52efb79198e2febfbf20d953769c19178 (patch)
tree86258a089ae822195602b423b8a8400bd38d376a /challenge-155
parent460e5dcfaaa40abab1aaa322a2d9fbe28091ceae (diff)
downloadperlweeklychallenge-club-ec35f0f52efb79198e2febfbf20d953769c19178.tar.gz
perlweeklychallenge-club-ec35f0f52efb79198e2febfbf20d953769c19178.tar.bz2
perlweeklychallenge-club-ec35f0f52efb79198e2febfbf20d953769c19178.zip
Update README.md
Diffstat (limited to 'challenge-155')
-rw-r--r--challenge-155/james-smith/README.md9
1 files changed, 5 insertions, 4 deletions
diff --git a/challenge-155/james-smith/README.md b/challenge-155/james-smith/README.md
index 2f4f424197..f031b2d2fa 100644
--- a/challenge-155/james-smith/README.md
+++ b/challenge-155/james-smith/README.md
@@ -29,16 +29,17 @@ We use it two ways:
Doing this gives a list of unique fortunate numbers, which we then sort to display them
-Note without doing an exhaustive search there may be a prime product for which `m` is 11 (for instance)
+Note without doing an exhaustive search there may be a prime product for which `m` is `11` (for instance).
```perl
use Math::Prime::Util qw(next_prime);
my %res;
-for( my $p = my $pp = 2;
- $pp < 1<<63;
- $pp *= $p = next_prime($p)
+for(
+ my $p = my $pp = 2;
+ $pp < 1<<63;
+ $pp *= $p = next_prime($p)
) {
$res{ next_prime($pp+2) - $pp } = 1;
}