From bcbf96b47e669e59e2b2eb4ed5f589f8a7229cb5 Mon Sep 17 00:00:00 2001
From: Rafael Livise <r.livise@hotmail.com>
Date: Tue, 6 Sep 2022 14:07:27 -0500
Subject: [PATCH 1/4] challenge: [UPDATE] factorial resolved

---
 src/factorial.js | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/src/factorial.js b/src/factorial.js
index 4f3ae70..fc5c093 100644
--- a/src/factorial.js
+++ b/src/factorial.js
@@ -1,5 +1,10 @@
 const factorial = (number) => {
-  // your code here
+  let result = 1
+  while(number){
+    result *= number
+    number-=1
+  }
+  return result
 }
 
 module.exports = factorial;
\ No newline at end of file

From ef0676046fec6b69056399c724b88ec910b45a9c Mon Sep 17 00:00:00 2001
From: Rafael Livise <r.livise@hotmail.com>
Date: Tue, 6 Sep 2022 14:32:13 -0500
Subject: [PATCH 2/4] challenge: [UPDATE] primalidad resolved

---
 src/primalidad.js | 19 ++++++++++++++++++-
 1 file changed, 18 insertions(+), 1 deletion(-)

diff --git a/src/primalidad.js b/src/primalidad.js
index 8bdb849..d566b8b 100644
--- a/src/primalidad.js
+++ b/src/primalidad.js
@@ -1,5 +1,22 @@
 const trialDivision = (number) => {
-  // your code here
+  // validation of decimals
+  if(number != parseInt(number)) return false
+  // validation negativos
+  if(number <= 1) return false
+  // if it is 2 is correct
+  if(number == 2) return true
+
+  let min = 2;
+  let max = number;
+
+  while(min < max){
+    if(number % min==0){
+      return false;
+    }
+    max = parseInt(number/min)+1;
+    min += 1;
+  }
+  return true;
 }
 
 module.exports = trialDivision;
\ No newline at end of file

From 44d19bd50c13eefddfadc6928fc56ad83e3bb3cf Mon Sep 17 00:00:00 2001
From: Rafael Livise <r.livise@hotmail.com>
Date: Tue, 6 Sep 2022 14:37:32 -0500
Subject: [PATCH 3/4] challenge: [UPDATE] primalidad resolved

---
 src/fibonacci.js | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/src/fibonacci.js b/src/fibonacci.js
index ea3270f..b9c02c0 100644
--- a/src/fibonacci.js
+++ b/src/fibonacci.js
@@ -1,5 +1,12 @@
 const fibonacci = (n) => {
-  // your code here
+  let memo = [0,1]
+  while(n>0){
+    const nextFibo = memo[memo.length] + memo[memo.length-1]
+    memo.push(nextFibo)
+    n-=0
+  }
+  memo.shift()
+  return memo
 }
 
 module.exports = fibonacci;
\ No newline at end of file

From 87cd05ec198141d97f9c5a9eb984af7a7b0f8740 Mon Sep 17 00:00:00 2001
From: Rafael Livise <r.livise@hotmail.com>
Date: Tue, 6 Sep 2022 14:42:08 -0500
Subject: [PATCH 4/4] challenge: [UPDATE] fibonacci resolved

---
 src/fibonacci.js | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/fibonacci.js b/src/fibonacci.js
index b9c02c0..14fd6d2 100644
--- a/src/fibonacci.js
+++ b/src/fibonacci.js
@@ -1,9 +1,9 @@
 const fibonacci = (n) => {
   let memo = [0,1]
-  while(n>0){
-    const nextFibo = memo[memo.length] + memo[memo.length-1]
+  while(n>1){
+    const nextFibo = memo[memo.length-1] + memo[memo.length-2]
     memo.push(nextFibo)
-    n-=0
+    n -= 1
   }
   memo.shift()
   return memo