diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/fibonacci-word.md index 6094dc31f3e..835a19918b2 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/fibonacci-word.md +++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/fibonacci-word.md @@ -8,7 +8,7 @@ dashedName: fibonacci-word # --description-- -The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf): +The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation. 
Define  F_Word1  as  1
 Define  F_Word2  as  0
@@ -16,9 +16,11 @@ Form   F_Word3  as  F_Word2   concatenated with  F_Wordn  as  F_Wordn-1  concatenated with  F_wordn-2
+Entropy calculation is required in this challenge, [as shown in this Rosetta Code challenge](https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy) + # --instructions-- -Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` [as described here](https://en.wikipedia.org/wiki/Entropy_%28information_theory%29) and rounded to 8 decimal digits of accuracy. +Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`. # --hints--