From 33a61168c005ae7379fb6023a68501cf3c0d77d8 Mon Sep 17 00:00:00 2001
From: Natalie Cardot <33387780+nataliecardot@users.noreply.github.com>
Date: Sat, 1 Jun 2019 07:06:54 -0700
Subject: [PATCH] Correct word in code explanation (#36146)

---
 .../sum-all-odd-fibonacci-numbers/index.md                      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md
index 5a23f0f84d..642627802b 100644
--- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md
+++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md
@@ -62,7 +62,7 @@ As you get the next odd one, don't forget to add it to a global variable that ca
 
 *   Create a variable to keep record of the current and previous numbers along with the result that will be returned.
 *   Use a while loop to make sure we do not go over the number given as parameter.
-*   We use the modulo operand to check if the current number is odd or even. If it is even, add it to the result.
+*   We use the modulo operand to check if the current number is odd or even. If it is odd, add it to the result.
 *   Complete the Fibonacci circle by rotating getting the next number and swapping values after.
 *   Return the result.