Completed :D :D :D

Author: MAB015

.vscode/launch.json

@@ -0,0 +1,15 @@
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "type": "chrome",
+            "request": "launch",
+            "name": "Launch Chrome against localhost",
+            "url": "http://localhost:5501",
+            "webRoot": "${workspaceFolder}"
+        }
+    ]
+}

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+    "liveServer.settings.port": 5501
+}

src/factorial.js

@@ -1,5 +1,14 @@
+var factor = []
 const factorial = (number) => {
   // your code here
+  //The factor of 0 (0!) is 1, and the factor of 1 (1!) is 1 too
+  if (number == 0 || number == 1) {
+    return 1;
+  }
+  //if the factor
+  if (factor[number] > 0) {
+    return factor[number];
+  }
+  return factor[number] = factorial(number-1) * number;
 }
-
 module.exports = factorial;

src/fibonacci.js

@@ -1,5 +1,24 @@
 const fibonacci = (n) => {
   // your code here
+  var fibonacciNumbers = []
+  var numbers = [0, 1]; 
+  var sum; 
+  var numberi = 0;
+  if(n == 0){
+    fibonacciNumbers = [numbers[0]]
+  }else if (n == 1) {
+    fibonacciNumbers = [numbers[1]]
+  } else {
+    fibonacciNumbers = [numbers[1]]
+    for (numberi = 1; numberi < n; numberi++)  
+    { 
+      sum = numbers[0] + numbers[1]; 
+      numbers[0] = numbers[1]; 
+      numbers[1] = sum; 
+      fibonacciNumbers.push(sum)
+    } 
+  }
+  return fibonacciNumbers
 }
 
 module.exports = fibonacci;

src/primalidad.js

@@ -1,5 +1,14 @@
 const trialDivision = (number) => {
   // your code here
+  if (number < 2) {
+    return false;
+  }
+  for (var i = 2; i <= number-1; i++){
+      if (number % i === 0 || !Number.isInteger(number)){
+        return false;
+      }
+  }
+  return true;
 }
 
 module.exports = trialDivision;