From d660436ad05e650dcd5b35ecf9dac13d068cf0bb Mon Sep 17 00:00:00 2001 From: BKinahan Date: Tue, 5 Jul 2016 19:03:21 +0000 Subject: [PATCH] Clarify Sum All Odd Fibonacci Numbers instructions --- .../intermediate-bonfires.json | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json b/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json index c1e11bd3b4..5df53a4893 100644 --- a/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json +++ b/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json @@ -614,9 +614,9 @@ "id": "a5229172f011153519423690", "title": "Sum All Odd Fibonacci Numbers", "description": [ - "Return the sum of all odd Fibonacci numbers up to and including the passed number if it is a Fibonacci number.", - "The first few numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8, and each subsequent number is the sum of the previous two numbers.", - "As an example, passing 4 to the function should return 5 because all the odd Fibonacci numbers under 4 are 1, 1, and 3.", + "Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num.", + "The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.", + "For example, sumFibs(10) should return 10 because all odd Fibonacci numbers less than 10 are 1, 1, 3, and 5.", "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [