aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJames Smith <js5@sanger.ac.uk>2021-11-24 00:20:29 +0000
committerGitHub <noreply@github.com>2021-11-24 00:20:29 +0000
commitfb5a6a0057cc4bbadec9e1319aae7932a18e9b23 (patch)
tree8261f117991d0fa9c6cadb9da1f3935133f9eb85
parent14a75baed4826c986ec6cbeaf4b84f803b678f2e (diff)
downloadperlweeklychallenge-club-fb5a6a0057cc4bbadec9e1319aae7932a18e9b23.tar.gz
perlweeklychallenge-club-fb5a6a0057cc4bbadec9e1319aae7932a18e9b23.tar.bz2
perlweeklychallenge-club-fb5a6a0057cc4bbadec9e1319aae7932a18e9b23.zip
Update README.md
-rw-r--r--challenge-136/james-smith/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-136/james-smith/README.md b/challenge-136/james-smith/README.md
index b0b3dc8889..3fa420f2e3 100644
--- a/challenge-136/james-smith/README.md
+++ b/challenge-136/james-smith/README.md
@@ -39,7 +39,7 @@ sub friendly {
# Task 2 - Fibonacci Sequence
-***You are given a positive number `$n`. Write a script to find how many different sequences you can create using Fibonacci numbers where the sum of unique numbers in each sequence are the same as the given number. ***
+***You are given a positive number `$n`. Write a script to find how many different sequences you can create using Fibonacci numbers where the sum of unique numbers in each sequence are the same as the given number.***
## Solution