diff --git a/snippets/fibonacciTillNum.md b/snippets/fibonacciUntilNum.md
similarity index 76%
rename from snippets/fibonacciTillNum.md
rename to snippets/fibonacciUntilNum.md
index 63a7f98bb..55df575d0 100644
--- a/snippets/fibonacciTillNum.md
+++ b/snippets/fibonacciUntilNum.md
@@ -1,14 +1,15 @@
-### fibonaciiTillNum
+### fibonacciUntilNum
 
 Generates an array, containing the Fibonacci sequence, up until the nth term.
 
 Create an empty array of the specific length, initializing the first two values (`0` and `1`).
 Use `Array.reduce()` to add values into the array, using the sum of the last two values, except for the first two.
-Uses a mathematical formula to calculate the length of the array required
+Uses a mathematical formula to calculate the length of the array required.
+
 ```js
-const fibonacciTillNum = num => {
-  let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2))// fibonacci(5) -> [0,1,1,2,3];
+const fibonacciUntilNum = num => {
+  let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2));
   return Array.from({ length: n}).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
-  }
-// fibsTillNum(15) -> [0,1,1,2,3,5,8,13]
+}
+// fibonacciUntilNum(15) -> [0,1,1,2,3,5,8,13]
 ```