diff options
| -rw-r--r-- | challenge-173/walt-mankowski/perl/ch-2.pl | 17 |
1 files changed, 17 insertions, 0 deletions
diff --git a/challenge-173/walt-mankowski/perl/ch-2.pl b/challenge-173/walt-mankowski/perl/ch-2.pl new file mode 100644 index 0000000000..20be9326f8 --- /dev/null +++ b/challenge-173/walt-mankowski/perl/ch-2.pl @@ -0,0 +1,17 @@ +#!/usr/bin/env perl +use v5.36; +use bigint; +use List::Util qw(product); + +# Task 2: Sylvester’s sequence +# Submitted by: Mohammad S Anwar +# +# Write a script to generate first 10 members of Sylvester's sequence. +# In number theory, Sylvester's sequence is an integer sequence in +# which each term of the sequence is the product of the previous +# terms, plus one. + +my @sylvester; +push @sylvester, 1 + product @sylvester while @sylvester < 10; +say for @sylvester; + |