diff --git a/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/644b71f678b5e1687666c88d.md b/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/644b71f678b5e1687666c88d.md
index 4754cd72985..a764950fe55 100644
--- a/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/644b71f678b5e1687666c88d.md
+++ b/curriculum/challenges/english/15-javascript-algorithms-and-data-structures-22/learn-recursion-by-building-a-decimal-to-binary-converter/644b71f678b5e1687666c88d.md
@@ -9,7 +9,7 @@ dashedName: step-26
 
 Like you saw in the last step, division can lead to a floating point number, or a number with a decimal point. The best way to handle this is to round down to the nearest whole number.
 
-Use the `Math.floor()` function to round down the quotient of `input` divided by `2` before it's assigned to `input`.
+Use the `Math.floor()` function to round down the quotient of `input` divided by `2` before it's assigned to `quotient`.
 
 # --hints--