diff --git a/1-js/06-advanced-functions/06-function-object/2-counter-inc-dec/solution.md b/1-js/06-advanced-functions/06-function-object/2-counter-inc-dec/solution.md
@@ -1,2 +1,2 @@

-The solution uses `count` in the local variable, but addition methods are written right into the `counter`. They share the same outer lexical environment and also can access the current `count`.
diff --git a/1-js/06-advanced-functions/06-function-object/2-counter-inc-dec/task.md b/1-js/06-advanced-functions/06-function-object/2-counter-inc-dec/task.md
@@ -2,14 +2,14 @@ importance: 5

---

-# Set and decrease for counter

-Modify the code of `makeCounter()` so that the counter can also decrease and set the number:

-- `counter()` should return the next number (as before).
-- `counter.set(value)` should set the counter to `value`.
-- `counter.decrease()` should decrease the counter by 1.

-See the sandbox code for the complete usage example.

-P.S. You can use either a closure or the function property to keep the current count. Or write both variants.
diff --git a/1-js/06-advanced-functions/06-function-object/5-sum-many-brackets/solution.md b/1-js/06-advanced-functions/06-function-object/5-sum-many-brackets/solution.md
@@ -1,9 +1,9 @@

-1. For the whole thing to work *anyhow*, the result of `sum` must be function.
-2. That function must keep in memory the current value between calls.
-3. According to the task, the function must become the number when used in `==`. Functions are objects, so the conversion happens as described in the chapter <info:object-toprimitive>, and we can provide our own method that returns the number.

-Now the code:

```js demo run
function sum(a) {
@@ -28,28 +28,28 @@ alert( sum(6)(-1)(-2)(-3) ); // 0
alert( sum(0)(1)(2)(3)(4)(5) ); // 15
```

-Please note that the `sum` function actually works only once. It returns function `f`.

-Then, on each subsequent call, `f` adds its parameter to the sum `currentSum`, and returns itself.

-**There is no recursion in the last line of `f`.**

-Here is what recursion looks like:

```js
function f(b) {
  currentSum += b;
-  return f(); // <-- recursive call
}
```

-And in our case, we just return the function, without calling it:

```js
function f(b) {
  currentSum += b;
-  return f; // <-- does not call itself, returns itself
}
```

-This `f` will be used in the next call, again return itself, as many times as needed. Then, when used as a number or a string -- the `toString` returns the `currentSum`. We could also use `Symbol.toPrimitive` or `valueOf` here for the conversion.
diff --git a/1-js/06-advanced-functions/06-function-object/5-sum-many-brackets/task.md b/1-js/06-advanced-functions/06-function-object/5-sum-many-brackets/task.md
@@ -2,9 +2,9 @@ importance: 2

---

-# Sum with an arbitrary amount of brackets

-Write function `sum` that would work like this:

```js
sum(1)(2) == 3; // 1 + 2
@@ -14,4 +14,4 @@ sum(6)(-1)(-2)(-3) == 0
sum(0)(1)(2)(3)(4)(5) == 15
```

-P.S. Hint: you may need to setup custom object to primitive conversion for your function.
Original file line number	Diff line number	Diff line change
		@@ -1,2 +1,2 @@

		The solution uses `count` in the local variable, but addition methods are written right into the `counter`. They share the same outer lexical environment and also can access the current `count`.