From 187e8e13fa9f1ba457f50d00cae272f769fe4769 Mon Sep 17 00:00:00 2001 From: Vse Mozhe Buty Date: Thu, 15 Oct 2020 18:35:59 +0300 Subject: [PATCH] Fix a typo in 1.6.1 task solution --- .../06-advanced-functions/01-recursion/02-factorial/solution.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md b/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md index 59040a2b..09e511db 100644 --- a/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md +++ b/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md @@ -1,4 +1,4 @@ -By definition, a factorial is `n!` can be written as `n * (n-1)!`. +By definition, a factorial `n!` can be written as `n * (n-1)!`. In other words, the result of `factorial(n)` can be calculated as `n` multiplied by the result of `factorial(n-1)`. And the call for `n-1` can recursively descend lower, and lower, till `1`.