From ec35f0f52efb79198e2febfbf20d953769c19178 Mon Sep 17 00:00:00 2001 From: James Smith Date: Mon, 7 Mar 2022 21:38:08 +0000 Subject: Update README.md --- challenge-155/james-smith/README.md | 9 +++++---- 1 file 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; } -- cgit