diff --git a/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md b/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md index e0b544b68f9..c2d1d952a88 100644 --- a/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md +++ b/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md @@ -11,7 +11,7 @@ dashedName: comparisons-with-the-logical-and-operator ستحتاج أحيانًا إلى اختبار أكثر من شيء في وقت واحد. مشغل الإضافة المنطقي ورمزه (`&&`) يرجع `true` فقط إذا كان المعاملتين إلى اليسار واليمين صحيحين. -ويمكن تحقيق نفس التأثير عن طريق وضع عبارة if داخل if أخري: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -سوف يعيد `Yes` فقط إذا كان `num` أكبر من `5` وأقل من `10`. ويمكن كتابة نفس المنطق كما يلي: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index edfcdfd35bf..b0447a4664b 100644 --- a/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/arabic/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ dashedName: comparisons-with-the-logical-or-operator يتكون مشغل إي من من رمزين و هما خطين مستقيمين كالآتي: (`||`). يمكن العثور على هذا الرمز عادة بين مفاتيح Backspace و Enter. -يجب أن يبدو النمط أدناه مألوفًا من الدروس السابقة: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -سوف يعيد `Yes` فقط إذا كان `num` بين `5` و `10` (5 و 10 مشمولين). ويمكن كتابة نفس المنطق كما يلي: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/arabic/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/arabic/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 601bd52955b..dcc0f0106f6 100644 --- a/curriculum/challenges/arabic/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/arabic/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -HTML attributes اي السمات، هي كلمات خاصة تستخدم داخل opening tag لعنصر للتحكم في سلوك العنصر. السمة `src` في عنصر `img` تحدد عنوان URL للصورة (حيث توجد الصورة). مثال على عنصر `img` باستخدام `src` كسمة: ``. +HTML attributes اي السمات، هي كلمات خاصة تستخدم داخل opening tag لعنصر للتحكم في سلوك العنصر. السمة `src` في عنصر `img` تحدد عنوان URL للصورة (حيث توجد الصورة). -داخل عنصر `img` الموجود، أضف خاصية `src` مع هذا الرابط: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -الكود الخاص بك يجب أن يحتوي على عنصر `img`. ربما تكون قد قمت بإزالة عنصر `img` أو لم تحيط قيمة سمة `src` بعلامات الاقتباس. +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -يجب أن يحتوي عنصر `img` الخاص بك علي سمة `src`. إما أنك حذفت السمة أو لديك خطأ إملائي. تأكد من وجود مسافة بين اسم العنصر واسم السمة. +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -يجب تعيين عنصر `img` الخاص بك سمة `src` بقيمة '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. إما أنك حذفت الـ URL أو لديك خطأ إملائي. حالة (case) عنوان الـ URL مهمة. +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -على الرغم من أنك قمت بتعيين عنصر `img` سمة `src` إلى عنوان الـ URL الصحيح، يوصى بأن تحيط دائما قيمة السمة بعلامات اقتباس. +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\運算符的左邊和右邊都是 true，邏輯與運算符（`&&`）纔會返回 `true`。 -同樣的效果可以通過 if 語句的嵌套來實現： +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -只有當 `num` 的值大於 `5` 並且小於`10` 時纔會返回 `Yes`。 相同的邏輯可被寫爲： +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index eed2935615b..9c649570384 100644 --- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ dashedName: comparisons-with-the-logical-or-operator 邏輯或運算符由兩個豎線（`||`）組成。 這個按鍵位於退格鍵和回車鍵之間。 -下面這樣的語句你應該很熟悉： +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -只有當 `num` 大於等於 `5` 或小於等於 `10` 時，函數才返回 `Yes`。 相同的邏輯可以簡寫成： +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index c9fac4c88eb..8cb5d071a5a 100644 --- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -HTML 屬性是寫在一個元素的開始標籤中的特殊詞彙，它們用於控制這個元素的行爲。 在 `img` 元素中的 `src` 屬性明確了一個圖片的 URL（圖片所在的位置）。 使用 `src` 屬性的 `img` 元素示例：``。 +HTML 屬性是寫在一個元素的開始標籤中的特殊詞彙，它們用於控制這個元素的行爲。 在 `img` 元素中的 `src` 屬性明確了一個圖片的 URL（圖片所在的位置）。 -在現有的 `img` 元素中，添加具有以下 URL 的 `src` 屬性： +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -你的代碼應該有一個 `img` 元素。 你可能已經刪除了 `img` 元素，或者你沒有用引號將 `src` 屬性的值括起來。 +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -你的 `img` 元素應該有一個 `src` 屬性。 你要麼省略了該屬性，要麼有錯字。 請確保元素名稱和屬性名稱之間有一個空格。 +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -你的 `img` 元素的 `src` 屬性應設置爲 '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'。 你可能省略了這個 URL 或者有拼寫錯誤。 URL 的大小寫很重要。 +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -儘管你已將 `img` 元素的 `src` 設置爲正確的 URL，但建議始終用引號將屬性的值括起來。 +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\运算符的左边和右边都是 true，逻辑与运算符（`&&`）才会返回 `true`。 -同样的效果可以通过 if 语句的嵌套来实现： +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -只有当 `num` 的值大于 `5` 并且小于`10` 时才会返回 `Yes`。 相同的逻辑可被写为： +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 7245658a2d3..412844204b4 100644 --- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ dashedName: comparisons-with-the-logical-or-operator 逻辑或运算符由两个竖线（`||`）组成。 这个按键位于退格键和回车键之间。 -下面这样的语句你应该很熟悉： +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -只有当 `num` 大于等于 `5` 或小于等于 `10` 时，函数才返回 `Yes`。 相同的逻辑可以简写成： +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 071f42a400d..728694a2ef2 100644 --- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -HTML 属性是写在一个元素的开始标签中的特殊词汇，它们用于控制这个元素的行为。 在 `img` 元素中的 `src` 属性明确了一个图片的 URL（图片所在的位置）。 使用 `src` 属性的 `img` 元素示例：``。 +HTML 属性是写在一个元素的开始标签中的特殊词汇，它们用于控制这个元素的行为。 在 `img` 元素中的 `src` 属性明确了一个图片的 URL（图片所在的位置）。 -在现有的 `img` 元素中，添加具有以下 URL 的 `src` 属性： +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -你的代码应该有一个 `img` 元素。 你可能已经删除了 `img` 元素，或者你没有用引号将 `src` 属性的值括起来。 +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -你的 `img` 元素应该有一个 `src` 属性。 你要么省略了该属性，要么有错字。 请确保元素名称和属性名称之间有一个空格。 +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -你的 `img` 元素的 `src` 属性应设置为 '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'。 你可能省略了这个 URL 或者有拼写错误。 URL 的大小写很重要。 +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -尽管你已将 `img` 元素的 `src` 设置为正确的 URL，但建议始终用引号将属性的值括起来。 +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\lógico and (`&&`) devuelve `true` si y solo si los operandos a la izquierda y a la derecha son verdaderos. -El mismo efecto se podría lograr anidando una sentencia if dentro de otra sentencia if: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -solo devolverá `Yes` si `num` es mayor que `5` y menor que `10`. La misma lógica se puede escribir como: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 0abcb29e402..dd1619bf0c7 100644 --- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ El operador lógico or (`||`) devuelve `true` si cualquiera de los lógico or se compone de dos símbolos de barra vertical: (`||`). Este se puede encontrar normalmente entre las teclas de tabulación y escape. -El patrón de abajo debería parecer familiar desde los puntos de referencia anteriores: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -devolverá `Yes` sólo si `num` está entre `5` y `10` (5 y 10 incluidos). La misma lógica se puede escribir como: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 49ce0645a0d..6e45dad9972 100644 --- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -Los atributos HTML son palabras especiales usadas dentro de la etiqueta de apertura de un elemento para controlar el comportamiento del elemento. El atributo `src` en un elemento `img` especifica la URL (donde se localiza la imagen). Un ejemplo de un elemento `img` usando un atributo `src`: ``. +Los atributos HTML son palabras especiales usadas dentro de la etiqueta de apertura de un elemento para controlar el comportamiento del elemento. El atributo `src` en un elemento `img` especifica la URL (donde se localiza la imagen). -Dentro del elemento `img` existente, añade un atributo `src` con esta URL: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -Tu código debe tener un elemento `img`. Pudiste haber borrado el elemento `img` o no pusiste entre comillas el valor del atributo `src`. +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -Tu elemento `img` debe tener un atributo `src`. Probablemente no has añadido el atributo o tienes un error tipográfico. Asegúrate e de que hay un espacio entre el nombre del elemento y el nombre del atributo. +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -El atributo `src` del elemento `img` debe tener el valor '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. Probablemente no has añadido la URL o tienes un error tipográfico. La URL debe ser exactamente igual, cuidando mayúsculas y minúsculas. +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -Aunque le has dado la URL correcta al atributo `src` del elemento `img`, se recomienda siempre poner el valor de un atributo entre comillas. +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\logische Und-Operator (`&&`) gibt `true` zurück, wenn und nur wenn die Operanden links und rechts von ihm wahr sind. -Den gleichen Effekt kannst du erzielen, indem du eine if-Anweisung in eine andere if-Anweisung verschachtelst: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -gibt nur `Yes` zurück, wenn `num` größer als `5` und kleiner als `10` ist. Die gleiche Logik lässt sich wie folgt formulieren: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 86cbc5abf32..fb4b20f55d1 100644 --- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ Der logische Oder-Operator (`||`) gibt `true` zurück, wenn einer der Der logische Oder-Operator besteht aus zwei Pipe-Symbolen: (`||`). Diese befindet sich normalerweise zwischen der Backspace- und der Enter-Taste. -Das folgende Muster sollte dir von früheren Hinweisen bekannt vorkommen: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -gibt nur dann `Yes` zurück, wenn `num` zwischen `5` und `10` liegt (einschließlich 5 und 10). Die gleiche Logik lässt sich wie folgt formulieren: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index eae0b133d5f..7b9770af530 100644 --- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,7 +7,13 @@ dashedName: step-8 # --description-- -HTML attributes are special words used inside the opening tag of an element to control the element's behavior. The `src` attribute in an `img` element specifies the image's URL (where the image is located). An example of an `img` element using an `src` attribute: ``. +HTML attributes are special words used inside the opening tag of an element to control the element's behavior. The `src` attribute in an `img` element specifies the image's URL (where the image is located). + +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` Inside the existing `img` element, add an `src` attribute with this URL: @@ -27,7 +33,7 @@ Your `img` element should have an `src` attribute. You have either omitted the a assert(document.querySelector('img').src); ``` -Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. Die Groß- und Kleinschreibung der URL ist wichtig. +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md index 81e71e36e31..ea9f279da42 100644 --- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md +++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md @@ -27,7 +27,7 @@ Your `fieldset:last-of-type` should have `border-bottom` set as `none`. ```js const borderBottom = new __helpers.CSSHelp(document).getStyle('fieldset:last-of-type')?.borderBottom; -assert(borderBottom === 'none' || borderBottom === 'medium none'); +assert(borderBottom === 'none' || borderBottom === 'medium none' || borderBottom === 'medium'); ``` # --seed-- diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md index d9c20f1b83e..65cf86386d9 100644 --- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md +++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md @@ -11,7 +11,7 @@ dashedName: comparisons-with-the-logical-and-operator A volte dovrai testare più di una cosa alla volta. L'operatore logico and (`&&`) restituisce `true` se e solo se gli operandi a sinistra e a destra di esso sono veri. -Lo stesso effetto può essere ottenuto annidando un'istruzione if all'interno di un altro if: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -restituirà `Yes` solo se `num` è maggiore di `5` e minore a `10`. La stessa logica può essere scritta come: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 7b5e8040668..cfc6e486442 100644 --- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ L'operatore Or logico (`||`) restituisce `true` se uno degli ope L'operatore or logico è composto da due simboli "pipe": (`||`). Questo in genere può essere trovato tra i tuoi tasti Backspace e Enter. -Lo schema sottostante dovrebbe esserti familiare dai punti visti in precedenza: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -Esso restituirà `Yes` solo se `num` è compreso tra `5` e `10` (5 e 10 inclusi). La stessa logica può essere scritta come: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 4705551edde..d83a182a819 100644 --- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -Gli attributi HTML sono parole speciali utilizzate all'interno del tag di apertura di un elemento per controllarne il comportamento. L'attributo `src` in un elemento `img` specifica l'URL dell'immagine (dove l'immagine è localizzata). Un esempio di un elemento `img` con un attributo `src` è: ``. +Gli attributi HTML sono parole speciali utilizzate all'interno del tag di apertura di un elemento per controllarne il comportamento. L'attributo `src` in un elemento `img` specifica l'URL dell'immagine (dove l'immagine è localizzata). -Aggiungi un attributo `src` all'elemento `img` esistente con il seguente URL: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -Il codice dovrebbe avere un elemento `img`. Potresti aver rimosso l'elemento `img` o non hai circondato il valore dell'attributo `src` con le virgolette. +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -L'elemento `img` dovrebbe avere un attributo `src`. Hai omesso l'attributo o hai un refuso. Assicurati che ci sia uno spazio tra il nome dell'elemento e il nome dell'attributo. +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -L'attributo `src` dell'elemento `img` dovrebbe essere '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. Hai omesso l'URL o hai un refuso. Le maiuscole/minuscole nell'URL sono importanti. +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -Anche se hai impostato l'URL corretto per l'`src` dell'elemento `img`, è raccomandato circondare sempre il valore di un attributo con le virgolette. +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\notebook Colab per questo video. -**Here is a link to the textbook you will need to complete the assignment for this video:** +**Ed ecco il link al libro di testo che ti servirà per completare le attività di questo video:** \- Business Math, a Step-by-Step Handbook (2021) di Jean-Paul Oliver @@ -20,27 +20,27 @@ Ecco il notebook Colab usato in questo video. diff --git a/curriculum/challenges/italian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md b/curriculum/challenges/italian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md index ca106ce72f7..6aa158fa658 100644 --- a/curriculum/challenges/italian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md +++ b/curriculum/challenges/italian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md @@ -36,7 +36,7 @@ Graficare un'equazione o due --- -Show tic marks on the graph +Mostrare i segni di graduazione nel grafico ## --video-solution-- diff --git a/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs-and-polynomials-extra.md b/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs-and-polynomials-extra.md index f404ad254a0..0a8798c1483 100644 --- a/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs-and-polynomials-extra.md +++ b/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs-and-polynomials-extra.md @@ -1,6 +1,6 @@ --- id: 6363d25c9078df117ce4c403 -title: "Parent Graphs and Polynomials: Extra" +title: "Grafici Genitori e Polinomi: Extra" challengeType: 15 videoId: YDlXmmRgQJI dashedName: parent-graphs-and-polynomials-extra @@ -8,7 +8,7 @@ dashedName: parent-graphs-and-polynomials-extra # --description-- -Questo video ti mostrerà come aggiungere cursori ai grafici, per vederli cambiare in tempo reale. You will also see ways to use loops to find the roots of a graph, and how this method is different from factoring. +Questo video ti mostrerà come aggiungere cursori ai grafici, per vederli cambiare in tempo reale. Vedrai anche dei modi per usare i loop per trovare le radici di un grafico e come questo metodo è diverso dalla fattorizzazione. Ecco il notebook Colab per questo video. diff --git a/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs.md b/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs.md index 17e65a4c723..99ca79f039f 100644 --- a/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs.md +++ b/curriculum/challenges/italian/17-college-algebra-with-python/learn-parent-graphs-and-polynomials/parent-graphs.md @@ -1,6 +1,6 @@ --- id: 6363d2529078df117ce4c402 -title: "Parent Graphs" +title: "Grafici Genitori" challengeType: 15 videoId: 6S2QhY8rIcw dashedName: parent-graphs @@ -8,7 +8,7 @@ dashedName: parent-graphs # --description-- -In this video, you will see what these parent graphs look like, how to modify them, and how to do this all with Python code. +In questo video vedrai come appaiono i grafici genitori, come modificarli e come fare tutto ciò con il codice Python. Ecco il notebook Colab per questo video. diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md index b53ef258385..da3a2dd4541 100644 --- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md +++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md @@ -1,6 +1,6 @@ --- id: 5900f3b61000cf542c50fec8 -title: 'Problem 73: Counting fractions in a range' +title: 'Problema 73: contare frazioni in un range' challengeType: 1 forumTopicId: 302186 dashedName: problem-73-counting-fractions-in-a-range @@ -8,43 +8,43 @@ dashedName: problem-73-counting-fractions-in-a-range # --description-- -Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` < `d` and highest common factor, ${HCF}(n, d) = 1$, it is called a reduced proper fraction. +Considera la frazione, $\frac{n}{d}$, dove `n` e `d` sono numeri interi positivi. Se `n` < `d` e il fattore comune più alto, ${HCF}(n, d) = 1$, viene chiamata frazione ridotta propria. -If we list the set of reduced proper fractions for `d` ≤ 8 in ascending order of size, we get: +Se elenchiamo la lista delle frazioni proprie ridotte per `d` ≤ 8 in ordine decrescente di dimensioni, otteniamo: $$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \mathbf{\frac{3}{8}, \frac{2}{5}, \frac{3}{7}}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$ -It can be seen that there are `3` fractions between $\frac{1}{3}$ and $\frac{1}{2}$. +Si vede che ci sono `3` frazioni tra $\frac{1}{3}$ e $\frac{1}{2}$. -How many fractions lie between $\frac{1}{3}$ and $\frac{1}{2}$ in the sorted set of reduced proper fractions for `d` ≤ `limit`? +Quante frazioni ci sono tra $\frac{1}{3}$ e $\frac{1}{2}$ nel set ordinato di frazioni proprie ridotte per `d` ≤ `limit`? # --hints-- -`countingFractionsInARange(8)` should return a number. +`countingFractionsInARange(8)` dovrebbe restituire un numero. ```js assert(typeof countingFractionsInARange(8) === 'number'); ``` -`countingFractionsInARange(8)` should return `3`. +`countingFractionsInARange(8)` dovrebbe restituire `3`. ```js assert.strictEqual(countingFractionsInARange(8), 3); ``` -`countingFractionsInARange(1000)` should return `50695`. +`countingFractionsInARange(1000)` dovrebbe restituire `50695`. ```js assert.strictEqual(countingFractionsInARange(1000), 50695); ``` -`countingFractionsInARange(6000)` should return `1823861`. +`countingFractionsInARange(6000)` dovrebbe restituire `1823861`. ```js assert.strictEqual(countingFractionsInARange(6000), 1823861); ``` -`countingFractionsInARange(12000)` should return `7295372`. +`countingFractionsInARange(12000)` dovrebbe restituire `7295372`. ```js assert.strictEqual(countingFractionsInARange(12000), 7295372); diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md index ad0b35c8fdf..b455c43f52e 100644 --- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md +++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md @@ -11,7 +11,7 @@ dashedName: comparisons-with-the-logical-and-operator 一度に複数の条件をテストしなければならない場合があります。 論理積演算子 (`&&`) は、左側と右側のオペランドの両方が true である場合にのみ `true` を返します。 -if ステートメントを別の if ステートメントにネストしても、同じ効果が得られます。 +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -上の例は、`num` が `5` より大きく `10` より小さい場合にのみ `Yes` を返します。 同じロジックを次のように記述することができます。 +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 919008c0005..0c844da84e1 100644 --- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ dashedName: comparisons-with-the-logical-or-operator 論理和演算子は 2 本のパイプ記号 (`||`) で構成されます。 この記号のキーは通常、バックスペースキーと Enter キーの間近くにあります。 -次のようなパターンは以前のチャレンジでも登場しています。 +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -上の例は、`num` が `5` と `10` の間 (5 と 10 を含む) の場合のみ、`Yes` を返します。 同じロジックを次のように記述することができます。 +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index fde099181ff..be92018e9a5 100644 --- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -HTML の属性 (attributes) とは、要素の開始タグ内で使用され、要素の動作を制御する特別な単語です。 `img` 要素の `src` 属性は、画像の URL (画像がある場所) を指定します。 `src` 属性を使用している `img` 要素の例は `` のようになります。 +HTML の属性 (attributes) とは、要素の開始タグ内で使用され、要素の動作を制御する特別な単語です。 `img` 要素の `src` 属性は、画像の URL (画像がある場所) を指定します。 -既存の `img` 要素に、`src` 属性を追加してこの URL を指定してください: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -コードには `img` 要素が 1 つ必要です。 `img` 要素を削除してしまったか、`src` 属性の値を引用符 (") で囲んでいない可能性があります。 +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -`img` 要素には `src` 属性が必要です。 属性が設定されていないか、誤字脱字があります。 要素名と属性名の間には必ず半角スペースを入れてください。 +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -`img` 要素の `src` 属性は '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`' に設定される必要があります。 URL が設定されていないか、誤字脱字があります。 URL の大文字小文字も関係があります。 +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -`img` 要素の `src` は正しい URL に設定されていますが、属性の値は常に引用符 (") で囲むことが推奨されています。 +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\operador lógico AND (`&&`) retornará `true` apenas se os operadores à esquerda e à direita forem verdadeiros. -O mesmo efeito pode ser alcançado aninhando uma instrução if dentro de outro if: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -só retornará `Yes` se `num` for maior que `5` e menor que `10`. A mesma lógica pode ser escrita assim: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index a060a7c98b8..da69b47a9cb 100644 --- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ O operador lógico OR (`||`) retorna `true` se qualquer um dos o O operador lógico ou é composto por dois símbolos de pipe: (`||`). Normalmente, ele pode ser encontrado entre as teclas Backspace e Enter. -O padrão abaixo deve parecer familiar aos pontos das passagens anteriores: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -retornará `Yes` apenas se `num` for entre `5` e `10` (5 e 10 incluídos). A mesma lógica pode ser escrita assim: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 83d22fcb188..f8e19b741cf 100644 --- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -Atributos em HTML são palavras especiais usadas dentro da tag de abertura de um elemento para controlar o comportamento dele. O atributo `src` em um elemento `img` especifica o URL da imagem (onde a imagem está localizada). Um exemplo de um elemento `img` usando o atributo `src` é: ``. +Atributos em HTML são palavras especiais usadas dentro da tag de abertura de um elemento para controlar o comportamento dele. O atributo `src` em um elemento `img` especifica o URL da imagem (onde a imagem está localizada). -Dentro do elemento existente `img`, adicione um atributo `src` com este URL: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -O código deve ter um elemento `img`. Você pode ter removido o elemento `img` ou não cercou o valor do atributo `src` com aspas. +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -O elemento `img` deve ter um atributo `src`. Você omitiu o atributo ou tem um erro de digitação. Certifique-se de que haja um espaço entre o nome do elemento e o nome do atributo. +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -O atributo `src` do elemento `img` deve estar definido como '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. Você omitiu o URL ou tem um erro de digitação. As verificações distinguem maiúsculas e minúsculas no URL. +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -Embora você tenha definido o `src` do elemento `img` com o URL correto, é recomendável sempre cercar o valor de um atributo com aspas. +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\Логічний оператор and (`&&`) повертає `true` лише за умови, що операнди зліва та справа істинні. -Такого ж результату можна досягнути, вклавши одну інструкцію if в іншу: +The same effect could be achieved by nesting an `if` statement inside another `if`. ```js if (num > 5) { @@ -22,7 +22,7 @@ if (num > 5) { return "No"; ``` -поверне `Yes`, якщо `num` більше ніж `5` та менше ніж `10`. Цю саму логіку можна записати як: +This code will return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written with the logical and operator. ```js if (num > 5 && num < 10) { diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md index 337804dea19..89976d9a977 100644 --- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md +++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md @@ -13,7 +13,7 @@ dashedName: comparisons-with-the-logical-or-operator Логічний оператор or складається з двох вертикальних рисок: (`||`). Як правило, цей символ можна знайти на клавіатурі між клавішами backspace та enter. -Наведений нижче шаблон має виглядати знайомим за пунктами з попередніх уривків: +The pattern below should look familiar from prior waypoints. ```js if (num > 10) { @@ -25,7 +25,7 @@ if (num < 5) { return "Yes"; ``` -поверне `Yes` лише за умови, що `num` знаходиться між `5` та `10` (включно з 5 і 10). Цю саму логіку можна записати як: +This code will return `Yes` if `num` is between `5` and `10` (`5` and `10` included). The same logic can be written with the logical or operator. ```js if (num > 10 || num < 5) { diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md index 1c6113aec52..14f0324eea4 100644 --- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md +++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md @@ -7,33 +7,39 @@ dashedName: step-8 # --description-- -HTML атрибути – це спеціальні слова, які використовують всередині початкового теґа елемента для керування поведінкою елемента. Атрибут `src` в елементі `img` зазначає URL-адресу зображення (де локалізовано зображення). Приклад використання елементом `img` атрибута `src`: ``. +HTML атрибути – це спеціальні слова, які використовують всередині початкового теґа елемента для керування поведінкою елемента. Атрибут `src` в елементі `img` зазначає URL-адресу зображення (де локалізовано зображення). -Всередині наявного елемента `img` додайте атрибут `src` з такою URL-адресою: +Here is an example of an `img` element with a `src` attribute pointing to the freeCodeCamp logo: + +```html + +``` + +Inside the existing `img` element, add an `src` attribute with this URL: `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg` # --hints-- -Ваш код повинен мати елемент `img`. Можливо, ви видалили елемент `img` або ви не оточили значення атрибута `src` в лапки. +Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes. ```js assert(document.querySelector('img')); ``` -Елемент `img` повинен мати атрибут `src`. Ви або не додали атрибут, або маєте друкарську помилку. Переконайтеся, що між назвою елемента та назвою атрибуту є пробіл. +Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name. ```js assert(document.querySelector('img').src); ``` -Атрибут `src` вашого елемента `img` повинен мати значення '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. Ви або не написали URL-адресу, або маєте друкарську помилку. Важливо, з якої літери написана URL-адреса (з великої чи малої). +Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important. ```js assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg'); ``` -Хоча ви встановили атрибут `src` елемента `img` як правильну URL-адресу, краще завжди писати значення атрибута в лапках. +Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks. ```js assert(!/\відео протягом виконання проєкту. diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/more-resources-in-colab.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/more-resources-in-colab.md index 3dcdf64ff04..4691614d17c 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/more-resources-in-colab.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/more-resources-in-colab.md @@ -1,6 +1,6 @@ --- id: 6363d2959078df117ce4c408 -title: "More Resources in Colab" +title: "Більше ресурсів у Colab" challengeType: 15 videoId: HNFrRHqpck4 dashedName: more-resources-in-colab @@ -8,25 +8,25 @@ dashedName: more-resources-in-colab # --description-- -One more thing... This brief video will show you some of the resources available to you in Google Colab notebooks. +Ще одне... Це коротке відео повідомить про деякі ресурси, доступні у блокнотах Google Colab. # --question-- ## --text-- -Which code snippets are available in the Google Colaboratory? +Які фрагменти коду доступні у Google Colaboratory? ## --answers-- -Camera capture +Захоплення камери --- -Adding form fields +Додавання поля форми --- -Importing data from Google Sheets +Імпорт даних з гугл-таблиць --- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/spreadsheets-and-additional-resources.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/spreadsheets-and-additional-resources.md index ad5edecd835..d451c7b0fd8 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/spreadsheets-and-additional-resources.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/college-algebra-with-python-conclusion/spreadsheets-and-additional-resources.md @@ -1,6 +1,6 @@ --- id: 6363d2899078df117ce4c407 -title: "Spreadsheets and Additional Resources" +title: "Електронні таблиці та додаткові ресурси" challengeType: 15 videoId: JH9Uk2mi3Dc dashedName: spreadsheets-and-additional-resources @@ -8,13 +8,13 @@ dashedName: spreadsheets-and-additional-resources # --description-- -Let's look at how you can connect your Math and Python knowledge with external data. This video will show you how to get data from other sources, then transform it so that you can graph it and interpret it. +Розглянемо, як ви можете поєднати свої знання з математики та Python із зовнішніми даними. Це відео покаже, як можна отримати дані з інших джерел, а потім перетворити ці дані так, щоб побудувати графік та інтерпретувати його. # --question-- ## --text-- -What library helps you to read data from a .csv and store it as a dataframe where you can select columns? +Яка бібліотека допомагає читати дані з файлів .csv та зберігати їх як dataframe, де можна вибрати стовпці? ## --answers-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems-of-equations-extra.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems-of-equations-extra.md index 96b8f567559..0129cb3d446 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems-of-equations-extra.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems-of-equations-extra.md @@ -1,6 +1,6 @@ --- id: 6331d2a9b51aeedd1a2bd654 -title: "Solving Systems of Equations: Extra" +title: "Розв’язок систем рівнянь: додатково" challengeType: 15 videoId: 856p7t2V9NY dashedName: solving-systems-of-equations-extra @@ -8,31 +8,31 @@ dashedName: solving-systems-of-equations-extra # --description-- -This video will show you one way to create a calculator that solves and graphs. It will also show you how to zoom in or zoom out on the graph and write the code to build that feature. +У цьому відео показано один зі способів створення калькулятора, який виконує розв’язок та будує графік. Ви також побачите, як зменшити/збільшити масштаб графіку та як написати код для цієї функціональності. -Here is the Colab notebook used in this video. This will give you an example of what your notebook could look like so far, as you have some functions in there and create headings for the next few functions. +Ось блокнот Colab для цього відео. Це приклад того, яким повинен бути ваш блокнот наразі, оскільки у вас вже є декілька функцій та ви створили пару заголовків. # --question-- ## --text-- -Which of the following is not true? +Яке з тверджень неправильне? ## --answers-- -When graphing, you can adjust your tic marks on each axis +При побудові графіку ви можете корегувати свої позначки на кожній осі --- -The `nonlinsolve()` function can solve linear equations +Функція `nonlinsolve()` може розв’язувати лінійні рівняння --- -The `linsolve()` function can solve nonlinear equations +Функція `linsolve()` може розв’язувати нелінійні рівняння --- -To zoom in or out on a graph, an interactive slider is useful +Інтерактивний повзунок корисний, щоб зменшити/збільшити масштаб графіка ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md index 08847d0f8a6..8d2ac6c0d32 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-solve-systems-of-equations/solving-systems.md @@ -1,6 +1,6 @@ --- id: 6331d2b0b51aeedd1a2bd655 -title: "Solving Systems" +title: "Розв’язок систем рівнянь" challengeType: 15 videoId: CNGUQzXfC6c dashedName: solving-systems @@ -8,35 +8,35 @@ dashedName: solving-systems # --description-- -The first video will show you the math behind solving a system of two equations without graphing, how you can factor an equation, and solve for a certain variable. +Перше відео покаже, що лежить в основі розв’язку системи двох рівнянь без побудови графіку, як ви можете розкласти рівняння та знайти значення певної змінної. -Here is the Colab notebook used in this video. +Ось блокнот Colab для цього відео. # --question-- ## --assignment-- -Add code to your notebook to solve and graph systems of equations +Додайте код для розв’язку та побудови графіка систем рівнянь до свого блокнота. ## --text-- -Which of the following can SymPy do that matplotlib can't do? +Що з переліченого може виконати SymPy, але не може виконати matplotlib? ## --answers-- -Solve for a variable +Знайти значення змінної --- -Display an x-y axis +Показати вісь x-y --- -Graph an equation or two +Побудувати графік одного чи двох рівнянь --- -Show tic marks on the graph +Показати позначки на графіку ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-equations.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-equations.md index c513b57f2eb..fcab8c91205 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-equations.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-equations.md @@ -1,6 +1,6 @@ --- id: 6331d28ab51aeedd1a2bd650 -title: "Linear Equations" +title: "Лінійні рівняння" challengeType: 15 videoId: u0bgovPh4ME dashedName: linear-equations @@ -8,19 +8,19 @@ dashedName: linear-equations # --description-- -This video will show you the math behind finding the y-intercept in a linear function, so you can develop the whole equation. Then the video will show you how to graph the whole function. You will also see how to do the whole process with Python code. +Це відео покаже, що лежить в основі пошуку точки перетину з віссю y, щоб ви могли записати повне рівняння. Потім ви побачите, як побудувати графік повної функції. Ви також побачите, як це все працює з кодом Python. -Here is the Colab notebook to go with the last two videos, so you can see the formulas. +Ось блокнот Colab для двох останніх відео, що ви могли бачити формули. # --question-- ## --assignment-- -Add code to your algebra Colab notebook to graph a function from points or from equation input. +Додайте код для побудови графіків функції з точок чи вхідних рівнянь до свого блокнота Colab. ## --text-- -If you know the slope ("m") and you have one (x,y) coordinate point, which of the following equations could you use to find "b", representing the y-intercept in Python? +Ви знаєте кутовий коефіцієнт (m) та маєте одну координатну точку (x, y). Яке з перелічених рівнянь ви б використали для пошуку b, що представляє перетин з віссю y в Python? ## --answers-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-functions-extra.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-functions-extra.md index 6f22635d3c8..aadb9887dbe 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-functions-extra.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/linear-functions-extra.md @@ -1,6 +1,6 @@ --- id: 6331d283b51aeedd1a2bd64f -title: "Linear Functions: Extra" +title: "Лінійні функції: додатково" challengeType: 15 videoId: Emeex5gi5uA dashedName: linear-functions-extra @@ -8,15 +8,15 @@ dashedName: linear-functions-extra # --description-- -This video will give you a deeper look into developing equations from word problems (so then you can write the code to solve or graph those equations). The video will also begin to look at data points as (x,y) coordinates. With this, you will begin to see the connection between Algebra and data science. +У цьому відео детальніше розглядається те, як створити рівняння для текстових задач (щоб потім ви могли написати код для розв’язку рівнянь чи побудови графіку). Ви також розглянете експериментальні точки, а саме координати (x, y). Завдяки цьому ви помітите зв’язок між алгеброю та наукою про дані. -Here is the Colab notebook used in this video. +Ось блокнот Colab для цього відео. # --question-- ## --text-- -Which of the following would you not use when displaying a graph? +Що з переліченого ви б не використали при показі графіка? ## --answers-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/slope.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/slope.md index 1cc287bcfee..696ebb58461 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/slope.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-linear-functions/slope.md @@ -1,6 +1,6 @@ --- id: 6331d291b51aeedd1a2bd651 -title: "Slope" +title: "Кутовий коефіцієнт" challengeType: 15 videoId: nURsz7SR5aM dashedName: slope @@ -8,15 +8,15 @@ dashedName: slope # --description-- -This first video will focus on the slope of a line and how to calculate it. +Перше відео фокусуватиметься на кутовому коефіцієнті прямої та його розрахунку. -Here is the Colab notebook used in this and the next videos. +Ось блокнот Colab для цього та наступних відео. # --question-- ## --text-- -If you have already defined these variables, which of the following is the correct slope formula? +Якщо ви вже визначили ці змінні, що з переліченого є правильною формулою кутового коефіцієнта? ## --answers-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest-extra.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest-extra.md index 2152a749bf5..4a04ac06271 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest-extra.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest-extra.md @@ -1,6 +1,6 @@ --- id: 63dbd1335d93712ff177d96a -title: "Simple and Compound Interest: Extra" +title: "Прості та складні відсотки: додатково" challengeType: 15 videoId: 2cbrstoKNSc dashedName: simple-and-compound-interest-extra @@ -8,13 +8,13 @@ dashedName: simple-and-compound-interest-extra # --description-- -Here is a detour from the Python code, as this video shows you how to create mortgage payment amortization tables in Google Sheets. You will also learn about how to use a very similar setup to estimate retirement account investment returns. This is the video that shows you where your money is going. +Зараз ви обійдете Python іншою дорогою, оскільки це відео покаже, як створити таблиці амортизації платежів у гугл-таблицях. Ви також дізнаєтесь, як використовувати схоже налаштування, щоб визначити пенсійні нарахування. Простими словами: у відео показують, куди йдуть ваші гроші. # --question-- ## --text-- -What marker do you use to attach a formula to a cell in a spreadsheet? +Що використовують для того, щоб додати формулу до клітинки в електронній таблиці? ## --answers-- diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest.md index 7cce6981cca..987a0d8bae9 100644 --- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest.md +++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-simple-and-compound-interest/simple-and-compound-interest.md @@ -1,6 +1,6 @@ --- id: 6363d26c9078df117ce4c405 -title: "Simple and Compound Interest" +title: "Прості та складні відсотки" challengeType: 15 videoId: iMPFK7wXNPg dashedName: simple-and-compound-interest @@ -8,33 +8,33 @@ dashedName: simple-and-compound-interest # --description-- -This video will help you understand the equations of simple and compound interest, and what it all means. +Це відео допоможе зрозуміти прості та складні відсотки, і що вони взагалі означають. -Here is the Colab notebook to go along with this video. +Ось блокнот Colab для цього відео. -Here is an additional Colab notebook that shows you one way to put many of these interest and payment forumlas into Python functions. Also you will see an example of using some formulas to output results, notice a trend, and follow up with other formulas to analyze patterns. +Ось додатковий блокнот Colab, який показує один зі способів додавання відсотків та формул розрахунку до функцій Python. Ви також побачите приклад використання деяких формул для відображення результатів, спостереження за трендами та дотримання інших формул, щоб аналізувати закономірності. # --question-- ## --text-- -In percent increase formulas, what does the "principle" refer to? +Що означає «принцип» у формулах відсоткового збільшення? ## --answers-- -the main amount +основна сума --- -the ending amount +кінцева сума --- -the starting amount +початкова сума --- -the (1 + rate) multiplier +множник (1 + ставка) ## --video-solution-- diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-and-5.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-and-5.md index 5b3f6a44858..a05aace710d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-and-5.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-1-multiples-of-3-and-5.md @@ -14,31 +14,31 @@ Find the sum of all the multiples of 3 or 5 below the provided parameter value ` # --hints-- -`multiplesOf3and5(10)` should return a number. +`multiplesOf3and5(10)` має повернути число. ```js assert(typeof multiplesOf3and5(10) === 'number'); ``` -`multiplesOf3and5(49)` should return 543. +`multiplesOf3and5(49)` має повернути 543. ```js assert.strictEqual(multiplesOf3and5(49), 543); ``` -`multiplesOf3and5(1000)` should return 233168. +`multiplesOf3and5(1000)` має повернути 233168. ```js assert.strictEqual(multiplesOf3and5(1000), 233168); ``` -`multiplesOf3and5(8456)` should return 16687353. +`multiplesOf3and5(8456)` має повернути 16687353. ```js assert.strictEqual(multiplesOf3and5(8456), 16687353); ``` -`multiplesOf3and5(19564)` should return 89301183. +`multiplesOf3and5(19564)` має повернути 89301183. ```js assert.strictEqual(multiplesOf3and5(19564), 89301183); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md index 39ab831dad7..2068efd2c13 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-10-summation-of-primes.md @@ -14,31 +14,31 @@ Find the sum of all the primes below `n`. # --hints-- -`primeSummation(17)` should return a number. +`primeSummation(17)` має повернути число. ```js assert(typeof primeSummation(17) === 'number'); ``` -`primeSummation(17)` should return 41. +`primeSummation(17)` має повернути 41. ```js assert.strictEqual(primeSummation(17), 41); ``` -`primeSummation(2001)` should return 277050. +`primeSummation(2001)` має повернути 277050. ```js assert.strictEqual(primeSummation(2001), 277050); ``` -`primeSummation(140759)` should return 873608362. +`primeSummation(140759)` має повернути 873608362. ```js assert.strictEqual(primeSummation(140759), 873608362); ``` -`primeSummation(2000000)` should return 142913828922. +`primeSummation(2000000)` має повернути 142913828922. ```js assert.strictEqual(primeSummation(2000000), 142913828922); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-100-arranged-probability.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-100-arranged-probability.md index 4507fa49c56..1b37f9eb897 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-100-arranged-probability.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-100-arranged-probability.md @@ -18,37 +18,37 @@ By finding the first arrangement to contain over `limit` discs in total, determi # --hints-- -`arrangedProbability(20)` should return a number. +`arrangedProbability(20)` має повернути число. ```js assert(typeof arrangedProbability(10) === 'number'); ``` -`arrangedProbability(20)` should return `15`. +`arrangedProbability(20)` має повернути `15`. ```js assert.strictEqual(arrangedProbability(20), 15); ``` -`arrangedProbability(100)` should return `85`. +`arrangedProbability(100)` має повернути `85`. ```js assert.strictEqual(arrangedProbability(100), 85); ``` -`arrangedProbability(100000)` should return `97513`. +`arrangedProbability(100000)` має повернути `97513`. ```js assert.strictEqual(arrangedProbability(100000), 97513); ``` -`arrangedProbability(1000000000)` should return `3822685023`. +`arrangedProbability(1000000000)` має повернути `3822685023`. ```js assert.strictEqual(arrangedProbability(1000000000), 3822685023); ``` -`arrangedProbability(1000000000000)` should return `756872327473`. +`arrangedProbability(1000000000000)` має повернути `756872327473`. ```js assert.strictEqual(arrangedProbability(1000000000000), 756872327473); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-11-largest-product-in-a-grid.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-11-largest-product-in-a-grid.md index 507d9a56ea8..514fdb988aa 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-11-largest-product-in-a-grid.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-11-largest-product-in-a-grid.md @@ -39,19 +39,19 @@ What is the greatest product of four adjacent numbers in the same direction (up, # --hints-- -`largestGridProduct(testGrid)` should return a number. +`largestGridProduct(testGrid)` має повернути число. ```js assert(typeof largestGridProduct(testGrid) === 'number'); ``` -`largestGridProduct(testGrid)` should return 14169081. +`largestGridProduct(testGrid)` має повернути 14169081. ```js assert.strictEqual(largestGridProduct(testGrid), 14169081); ``` -`largestGridProduct(grid)` should return 70600674. +`largestGridProduct(grid)` має повернути 70600674. ```js assert.strictEqual(largestGridProduct(grid), 70600674); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-12-highly-divisible-triangular-number.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-12-highly-divisible-triangular-number.md index 2fa68e80276..19096ff4a50 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-12-highly-divisible-triangular-number.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-12-highly-divisible-triangular-number.md @@ -28,37 +28,37 @@ What is the value of the first triangle number to have over `n` divisors? # --hints-- -`divisibleTriangleNumber(5)` should return a number. +`divisibleTriangleNumber(5)` має повернути число. ```js assert(typeof divisibleTriangleNumber(5) === 'number'); ``` -`divisibleTriangleNumber(5)` should return 28. +`divisibleTriangleNumber(5)` має повернути 28. ```js assert.strictEqual(divisibleTriangleNumber(5), 28); ``` -`divisibleTriangleNumber(23)` should return 630. +`divisibleTriangleNumber(23)` має повернути 630. ```js assert.strictEqual(divisibleTriangleNumber(23), 630); ``` -`divisibleTriangleNumber(167)` should return 1385280. +`divisibleTriangleNumber(167)` має повернути 1385280. ```js assert.strictEqual(divisibleTriangleNumber(167), 1385280); ``` -`divisibleTriangleNumber(374)` should return 17907120. +`divisibleTriangleNumber(374)` має повернути 17907120. ```js assert.strictEqual(divisibleTriangleNumber(374), 17907120); ``` -`divisibleTriangleNumber(500)` should return 76576500. +`divisibleTriangleNumber(500)` має повернути 76576500. ```js assert.strictEqual(divisibleTriangleNumber(500), 76576500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-13-large-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-13-large-sum.md index 7e4db74fcb7..338bdd718c6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-13-large-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-13-large-sum.md @@ -115,19 +115,19 @@ Work out the first ten digits of the sum of the following one-hundred 50-digit n # --hints-- -`largeSum(testNums)` should return a number. +`largeSum(testNums)` має повернути число. ```js assert(typeof largeSum(testNums) === 'number'); ``` -`largeSum(testNums)` should return 8348422521. +`largeSum(testNums)` має повернути 8348422521. ```js assert.strictEqual(largeSum(testNums), 8348422521); ``` -`largeSum(fiftyDigitNums)` should return 5537376230. +`largeSum(fiftyDigitNums)` має повернути 5537376230. ```js assert.strictEqual(largeSum(fiftyDigitNums), 5537376230); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-14-longest-collatz-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-14-longest-collatz-sequence.md index cac70d3bb29..520f7ef982d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-14-longest-collatz-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-14-longest-collatz-sequence.md @@ -26,43 +26,43 @@ Which starting number, under the given `limit`, produces the longest chain? # --hints-- -`longestCollatzSequence(14)` should return a number. +`longestCollatzSequence(14)` має повернути число. ```js assert(typeof longestCollatzSequence(14) === 'number'); ``` -`longestCollatzSequence(14)` should return 9. +`longestCollatzSequence(14)` має повернути 9. ```js assert.strictEqual(longestCollatzSequence(14), 9); ``` -`longestCollatzSequence(5847)` should return 3711. +`longestCollatzSequence(5847)` має повернути 3711. ```js assert.strictEqual(longestCollatzSequence(5847), 3711); ``` -`longestCollatzSequence(46500)` should return 35655. +`longestCollatzSequence(46500)` має повернути 35655. ```js assert.strictEqual(longestCollatzSequence(46500), 35655); ``` -`longestCollatzSequence(54512)` should return 52527. +`longestCollatzSequence(54512)` має повернути 52527. ```js assert.strictEqual(longestCollatzSequence(54512), 52527); ``` -`longestCollatzSequence(100000)` should return 77031. +`longestCollatzSequence(100000)` має повернути 77031. ```js assert.strictEqual(longestCollatzSequence(100000), 77031); ``` -`longestCollatzSequence(1000000)` should return 837799. +`longestCollatzSequence(1000000)` має повернути 837799. ```js assert.strictEqual(longestCollatzSequence(1000000), 837799); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-15-lattice-paths.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-15-lattice-paths.md index 225eddd68e7..45008bd3b47 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-15-lattice-paths.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-15-lattice-paths.md @@ -16,25 +16,25 @@ How many such routes are there through a given `gridSize`? # --hints-- -`latticePaths(4)` should return a number. +`latticePaths(4)` має повернути число. ```js assert(typeof latticePaths(4) === 'number'); ``` -`latticePaths(4)` should return 70. +`latticePaths(4)` має повернути 70. ```js assert.strictEqual(latticePaths(4), 70); ``` -`latticePaths(9)` should return 48620. +`latticePaths(9)` має повернути 48620. ```js assert.strictEqual(latticePaths(9), 48620); ``` -`latticePaths(20)` should return 137846528820. +`latticePaths(20)` має повернути 137846528820. ```js assert.strictEqual(latticePaths(20), 137846528820); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-16-power-digit-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-16-power-digit-sum.md index 8ef1c137f88..c5b073e72fb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-16-power-digit-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-16-power-digit-sum.md @@ -14,25 +14,25 @@ What is the sum of the digits of the number 2exponent? # --hints-- -`powerDigitSum(15)` should return a number. +`powerDigitSum(15)` має повернути число. ```js assert(typeof powerDigitSum(15) === 'number'); ``` -`powerDigitSum(15)` should return 26. +`powerDigitSum(15)` має повернути 26. ```js assert.strictEqual(powerDigitSum(15), 26); ``` -`powerDigitSum(128)` should return 166. +`powerDigitSum(128)` має повернути 166. ```js assert.strictEqual(powerDigitSum(128), 166); ``` -`powerDigitSum(1000)` should return 1366. +`powerDigitSum(1000)` має повернути 1366. ```js assert.strictEqual(powerDigitSum(1000), 1366); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md index c64e9f073f6..8557ecae44f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-17-number-letter-counts.md @@ -16,25 +16,25 @@ If all the numbers from 1 to given `limit` inclusive were written out in words, # --hints-- -`numberLetterCounts(5)` should return a number. +`numberLetterCounts(5)` має повернути число. ```js assert(typeof numberLetterCounts(5) === 'number'); ``` -`numberLetterCounts(5)` should return 19. +`numberLetterCounts(5)` має повернути 19. ```js assert.strictEqual(numberLetterCounts(5), 19); ``` -`numberLetterCounts(150)` should return 1903. +`numberLetterCounts(150)` має повернути 1903. ```js assert.strictEqual(numberLetterCounts(150), 1903); ``` -`numberLetterCounts(1000)` should return 21124. +`numberLetterCounts(1000)` має повернути 21124. ```js assert.strictEqual(numberLetterCounts(1000), 21124); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-18-maximum-path-sum-i.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-18-maximum-path-sum-i.md index f0d97a950b2..3f12c2c70d3 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-18-maximum-path-sum-i.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-18-maximum-path-sum-i.md @@ -41,19 +41,19 @@ Find the maximum total from top to bottom of the triangle below: # --hints-- -`maximumPathSumI(testTriangle)` should return a number. +`maximumPathSumI(testTriangle)` має повернути число. ```js assert(typeof maximumPathSumI(testTriangle) === 'number'); ``` -`maximumPathSumI(testTriangle)` should return 23. +`maximumPathSumI(testTriangle)` має повернути 23. ```js assert.strictEqual(maximumPathSumI(testTriangle), 23); ``` -`maximumPathSumI(numTriangle)` should return 1074. +`maximumPathSumI(numTriangle)` має повернути 1074. ```js assert.strictEqual(maximumPathSumI(numTriangle), 1074); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md index 5a3e24cc431..515f109843a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-19-counting-sundays.md @@ -20,25 +20,25 @@ How many Sundays fell on the first of the month during the twentieth century (1 # --hints-- -`countingSundays(1943, 1946)` should return a number. +`countingSundays(1943, 1946)` має повернути число. ```js assert(typeof countingSundays(1943, 1946) === 'number'); ``` -`countingSundays(1943, 1946)` should return 6. +`countingSundays(1943, 1946)` має повернути 6. ```js assert.strictEqual(countingSundays(1943, 1946), 6); ``` -`countingSundays(1995, 2000)` should return 10. +`countingSundays(1995, 2000)` має повернути 10. ```js assert.strictEqual(countingSundays(1995, 2000), 10); ``` -`countingSundays(1901, 2000)` should return 171. +`countingSundays(1901, 2000)` має повернути 171. ```js assert.strictEqual(countingSundays(1901, 2000), 171); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md index 4376672786b..d91a111353e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-2-even-fibonacci-numbers.md @@ -16,7 +16,7 @@ By considering the terms in the Fibonacci sequence whose values do not exceed `n # --hints-- -`fiboEvenSum(10)` should return a number. +`fiboEvenSum(10)` має повернути число. ```js assert(typeof fiboEvenSum(10) === 'number'); @@ -34,37 +34,37 @@ Your function should sum the even-valued Fibonacci numbers: `fiboEvenSum(8)` sho assert.strictEqual(fiboEvenSum(8), 10); ``` -`fiboEvenSum(10)` should return 10. +`fiboEvenSum(10)` має повернути 10. ```js assert.strictEqual(fiboEvenSum(10), 10); ``` -`fiboEvenSum(34)` should return 44. +`fiboEvenSum(34)` має повернути 44. ```js assert.strictEqual(fiboEvenSum(34), 44); ``` -`fiboEvenSum(60)` should return 44. +`fiboEvenSum(60)` має повернути 44. ```js assert.strictEqual(fiboEvenSum(60), 44); ``` -`fiboEvenSum(1000)` should return 798. +`fiboEvenSum(1000)` має повернути 798. ```js assert.strictEqual(fiboEvenSum(1000), 798); ``` -`fiboEvenSum(100000)` should return 60696. +`fiboEvenSum(100000)` має повернути 60696. ```js assert.strictEqual(fiboEvenSum(100000), 60696); ``` -`fiboEvenSum(4000000)` should return 4613732. +`fiboEvenSum(4000000)` має повернути 4613732. ```js assert.strictEqual(fiboEvenSum(4000000), 4613732); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md index a109ff5f9b2..b1bd451be65 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-20-factorial-digit-sum.md @@ -17,37 +17,37 @@ Find the sum of the digits `n`! # --hints-- -`sumFactorialDigits(10)` should return a number. +`sumFactorialDigits(10)` має повернути число. ```js assert(typeof sumFactorialDigits(10) === 'number'); ``` -`sumFactorialDigits(10)` should return 27. +`sumFactorialDigits(10)` має повернути 27. ```js assert.strictEqual(sumFactorialDigits(10), 27); ``` -`sumFactorialDigits(25)` should return 72. +`sumFactorialDigits(25)` має повернути 72. ```js assert.strictEqual(sumFactorialDigits(25), 72); ``` -`sumFactorialDigits(50)` should return 216. +`sumFactorialDigits(50)` має повернути 216. ```js assert.strictEqual(sumFactorialDigits(50), 216); ``` -`sumFactorialDigits(75)` should return 432. +`sumFactorialDigits(75)` має повернути 432. ```js assert.strictEqual(sumFactorialDigits(75), 432); ``` -`sumFactorialDigits(100)` should return 648. +`sumFactorialDigits(100)` має повернути 648. ```js assert.strictEqual(sumFactorialDigits(100), 648); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md index df19c7d7c20..d1440dafb94 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-21-amicable-numbers.md @@ -18,31 +18,31 @@ Evaluate the sum of all the amicable numbers under `n`. # --hints-- -`sumAmicableNum(1000)` should return a number. +`sumAmicableNum(1000)` має повернути число. ```js assert(typeof sumAmicableNum(1000) === 'number'); ``` -`sumAmicableNum(1000)` should return 504. +`sumAmicableNum(1000)` має повернути 504. ```js assert.strictEqual(sumAmicableNum(1000), 504); ``` -`sumAmicableNum(2000)` should return 2898. +`sumAmicableNum(2000)` має повернути 2898. ```js assert.strictEqual(sumAmicableNum(2000), 2898); ``` -`sumAmicableNum(5000)` should return 8442. +`sumAmicableNum(5000)` має повернути 8442. ```js assert.strictEqual(sumAmicableNum(5000), 8442); ``` -`sumAmicableNum(10000)` should return 31626. +`sumAmicableNum(10000)` має повернути 31626. ```js assert.strictEqual(sumAmicableNum(10000), 31626); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md index 4c8df4383a7..50b794c190b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-22-names-scores.md @@ -16,25 +16,25 @@ What is the total of all the name scores in the array? # --hints-- -`namesScores(test1)` should return a number. +`namesScores(test1)` має повернути число. ```js assert(typeof namesScores(test1) === 'number'); ``` -`namesScores(test1)` should return 791. +`namesScores(test1)` має повернути 791. ```js assert.strictEqual(namesScores(test1), 791); ``` -`namesScores(test2)` should return 1468. +`namesScores(test2)` має повернути 1468. ```js assert.strictEqual(namesScores(test2), 1468); ``` -`namesScores(names)` should return 871198282. +`namesScores(names)` має повернути 871198282. ```js assert.strictEqual(namesScores(names), 871198282); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-23-non-abundant-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-23-non-abundant-sums.md index cc7079af8c4..46e16760540 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-23-non-abundant-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-23-non-abundant-sums.md @@ -18,31 +18,31 @@ Find the sum of all positive integers <= `n` which cannot be written as the s # --hints-- -`sumOfNonAbundantNumbers(10000)` should return a number. +`sumOfNonAbundantNumbers(10000)` має повернути число. ```js assert(typeof sumOfNonAbundantNumbers(10000) === 'number'); ``` -`sumOfNonAbundantNumbers(10000)` should return 3731004. +`sumOfNonAbundantNumbers(10000)` має повернути 3731004. ```js assert(sumOfNonAbundantNumbers(10000) === 3731004); ``` -`sumOfNonAbundantNumbers(15000)` should return 4039939. +`sumOfNonAbundantNumbers(15000)` має повернути 4039939. ```js assert(sumOfNonAbundantNumbers(15000) === 4039939); ``` -`sumOfNonAbundantNumbers(20000)` should return 4159710. +`sumOfNonAbundantNumbers(20000)` має повернути 4159710. ```js assert(sumOfNonAbundantNumbers(20000) === 4159710); ``` -`sumOfNonAbundantNumbers(28123)` should return 4179871. +`sumOfNonAbundantNumbers(28123)` має повернути 4179871. ```js assert(sumOfNonAbundantNumbers(28123) === 4179871); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md index 91572e2dd40..a569dbf88c9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-24-lexicographic-permutations.md @@ -16,31 +16,31 @@ What is the `n`th lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7 # --hints-- -`lexicographicPermutations(699999)` should return a number. +`lexicographicPermutations(699999)` має повернути число. ```js assert(typeof lexicographicPermutations(699999) === 'number'); ``` -`lexicographicPermutations(699999)` should return 1938246570. +`lexicographicPermutations(699999)` має повернути 1938246570. ```js assert(lexicographicPermutations(699999) == 1938246570); ``` -`lexicographicPermutations(899999)` should return 2536987410. +`lexicographicPermutations(899999)` має повернути 2536987410. ```js assert(lexicographicPermutations(899999) == 2536987410); ``` -`lexicographicPermutations(900000)` should return 2537014689. +`lexicographicPermutations(900000)` має повернути 2537014689. ```js assert(lexicographicPermutations(900000) == 2537014689); ``` -`lexicographicPermutations(999999)` should return 2783915460. +`lexicographicPermutations(999999)` має повернути 2783915460. ```js assert(lexicographicPermutations(999999) == 2783915460); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md index 25d18d786ef..9df63e20e28 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-25-1000-digit-fibonacci-number.md @@ -22,31 +22,31 @@ What is the index of the first term in the Fibonacci sequence to contain `n` dig # --hints-- -`digitFibonacci(5)` should return a number. +`digitFibonacci(5)` має повернути число. ```js assert(typeof digitFibonacci(5) === 'number'); ``` -`digitFibonacci(5)` should return 21. +`digitFibonacci(5)` має повернути 21. ```js assert.strictEqual(digitFibonacci(5), 21); ``` -`digitFibonacci(10)` should return 45. +`digitFibonacci(10)` має повернути 45. ```js assert.strictEqual(digitFibonacci(10), 45); ``` -`digitFibonacci(15)` should return 69. +`digitFibonacci(15)` має повернути 69. ```js assert.strictEqual(digitFibonacci(15), 69); ``` -`digitFibonacci(20)` should return 93. +`digitFibonacci(20)` має повернути 93. ```js assert.strictEqual(digitFibonacci(20), 93); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md index 580ba5807a3..d0268b867df 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md @@ -18,31 +18,31 @@ Find the value of `d` < `n` for which 1/d contains the # --hints-- -`reciprocalCycles(700)` should return a number. +`reciprocalCycles(700)` має повернути число. ```js assert(typeof reciprocalCycles(700) === 'number'); ``` -`reciprocalCycles(700)` should return 659. +`reciprocalCycles(700)` має повернути 659. ```js assert(reciprocalCycles(700) == 659); ``` -`reciprocalCycles(800)` should return 743. +`reciprocalCycles(800)` має повернути 743. ```js assert(reciprocalCycles(800) == 743); ``` -`reciprocalCycles(900)` should return 887. +`reciprocalCycles(900)` має повернути 887. ```js assert(reciprocalCycles(900) == 887); ``` -`reciprocalCycles(1000)` should return 983. +`reciprocalCycles(1000)` має повернути 983. ```js assert(reciprocalCycles(1000) == 983); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md index e7c8ebe01eb..18509216ad5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md @@ -28,31 +28,31 @@ Find the product of the coefficients, $a$ and $b$, for the quadratic expression # --hints-- -`quadraticPrimes(200)` should return a number. +`quadraticPrimes(200)` має повернути число. ```js assert(typeof quadraticPrimes(200) === 'number'); ``` -`quadraticPrimes(200)` should return -4925. +`quadraticPrimes(200)` має повернути -4925. ```js assert(quadraticPrimes(200) == -4925); ``` -`quadraticPrimes(500)` should return -18901. +`quadraticPrimes(500)` має повернути -18901. ```js assert(quadraticPrimes(500) == -18901); ``` -`quadraticPrimes(800)` should return -43835. +`quadraticPrimes(800)` має повернути -43835. ```js assert(quadraticPrimes(800) == -43835); ``` -`quadraticPrimes(1000)` should return -59231. +`quadraticPrimes(1000)` має повернути -59231. ```js assert(quadraticPrimes(1000) == -59231); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md index eee50073f68..4108f6f9ee5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md @@ -24,31 +24,31 @@ What is the sum of the numbers on the diagonals in an `n` by `n` spiral formed i # --hints-- -`spiralDiagonals(101)` should return a number. +`spiralDiagonals(101)` має повернути число. ```js assert(typeof spiralDiagonals(101) === 'number'); ``` -`spiralDiagonals(101)` should return 692101. +`spiralDiagonals(101)` має повернути 692101. ```js assert(spiralDiagonals(101) == 692101); ``` -`spiralDiagonals(303)` should return 18591725. +`spiralDiagonals(303)` має повернути 18591725. ```js assert(spiralDiagonals(303) == 18591725); ``` -`spiralDiagonals(505)` should return 85986601. +`spiralDiagonals(505)` має повернути 85986601. ```js assert(spiralDiagonals(505) == 85986601); ``` -`spiralDiagonals(1001)` should return 669171001. +`spiralDiagonals(1001)` має повернути 669171001. ```js assert(spiralDiagonals(1001) == 669171001); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md index 4b8f00162ee..3bea40fd45a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md @@ -27,31 +27,31 @@ How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ # --hints-- -`distinctPowers(15)` should return a number. +`distinctPowers(15)` має повернути число. ```js assert(typeof distinctPowers(15) === 'number'); ``` -`distinctPowers(15)` should return 177. +`distinctPowers(15)` має повернути 177. ```js assert.strictEqual(distinctPowers(15), 177); ``` -`distinctPowers(20)` should return 324. +`distinctPowers(20)` має повернути 324. ```js assert.strictEqual(distinctPowers(20), 324); ``` -`distinctPowers(25)` should return 519. +`distinctPowers(25)` має повернути 519. ```js assert.strictEqual(distinctPowers(25), 519); ``` -`distinctPowers(30)` should return 755. +`distinctPowers(30)` має повернути 755. ```js assert.strictEqual(distinctPowers(30), 755); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md index 2961ac6b9c0..f081b2ed40d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-3-largest-prime-factor.md @@ -14,49 +14,49 @@ What is the largest prime factor of the given `number`? # --hints-- -`largestPrimeFactor(2)` should return a number. +`largestPrimeFactor(2)` має повернути число. ```js assert(typeof largestPrimeFactor(2) === 'number'); ``` -`largestPrimeFactor(2)` should return 2. +`largestPrimeFactor(2)` має повернути 2. ```js assert.strictEqual(largestPrimeFactor(2), 2); ``` -`largestPrimeFactor(3)` should return 3. +`largestPrimeFactor(3)` має повернути 3. ```js assert.strictEqual(largestPrimeFactor(3), 3); ``` -`largestPrimeFactor(5)` should return 5. +`largestPrimeFactor(5)` має повернути 5. ```js assert.strictEqual(largestPrimeFactor(5), 5); ``` -`largestPrimeFactor(7)` should return 7. +`largestPrimeFactor(7)` має повернути 7. ```js assert.strictEqual(largestPrimeFactor(7), 7); ``` -`largestPrimeFactor(8)` should return 2. +`largestPrimeFactor(8)` має повернути 2. ```js assert.strictEqual(largestPrimeFactor(8), 2); ``` -`largestPrimeFactor(13195)` should return 29. +`largestPrimeFactor(13195)` має повернути 29. ```js assert.strictEqual(largestPrimeFactor(13195), 29); ``` -`largestPrimeFactor(600851475143)` should return 6857. +`largestPrimeFactor(600851475143)` має повернути 6857. ```js assert.strictEqual(largestPrimeFactor(600851475143), 6857); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md index 1e7472bce84..92f0308840f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md @@ -24,31 +24,31 @@ Find the sum of all the numbers that can be written as the sum of `n` powers of # --hints-- -`digitnPowers(2)` should return a number. +`digitnPowers(2)` має повернути число. ```js assert(typeof digitnPowers(2) === 'number'); ``` -`digitnPowers(2)` should return 0. +`digitnPowers(2)` має повернути 0. ```js assert(digitnPowers(2) == 0); ``` -`digitnPowers(3)` should return 1301. +`digitnPowers(3)` має повернути 1301. ```js assert(digitnPowers(3) == 1301); ``` -`digitnPowers(4)` should return 19316. +`digitnPowers(4)` має повернути 19316. ```js assert(digitnPowers(4) == 19316); ``` -`digitnPowers(5)` should return 443839. +`digitnPowers(5)` має повернути 443839. ```js assert(digitnPowers(5) == 443839); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md index ae4372cd69f..b4a75fe3d6a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md @@ -20,31 +20,31 @@ How many different ways can `n` pence be made using any number of coins? # --hints-- -`coinSums(50)` should return a number. +`coinSums(50)` має повернути число. ```js assert(typeof coinSums(50) === 'number'); ``` -`coinSums(50)` should return 451. +`coinSums(50)` має повернути 451. ```js assert(coinSums(50) == 451); ``` -`coinSums(100)` should return 4563. +`coinSums(100)` має повернути 4563. ```js assert(coinSums(100) == 4563); ``` -`coinSums(150)` should return 21873. +`coinSums(150)` має повернути 21873. ```js assert(coinSums(150) == 21873); ``` -`coinSums(200)` should return 73682. +`coinSums(200)` має повернути 73682. ```js assert(coinSums(200) == 73682); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md index 5fe7d0495c5..cf64a66ace0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md @@ -18,37 +18,37 @@ Find the sum of all products whose multiplicand/multiplier/product identity can # --hints-- -`pandigitalProducts(4)` should return a number. +`pandigitalProducts(4)` має повернути число. ```js assert(typeof pandigitalProducts(4) === 'number'); ``` -`pandigitalProducts(4)` should return `12`. +`pandigitalProducts(4)` має повернути `12`. ```js assert.strictEqual(pandigitalProducts(4), 12); ``` -`pandigitalProducts(6)` should return `162`. +`pandigitalProducts(6)` має повернути `162`. ```js assert.strictEqual(pandigitalProducts(6), 162); ``` -`pandigitalProducts(7)` should return `0`. +`pandigitalProducts(7)` має повернути `0`. ```js assert.strictEqual(pandigitalProducts(7), 0); ``` -`pandigitalProducts(8)` should return `13458`. +`pandigitalProducts(8)` має повернути `13458`. ```js assert.strictEqual(pandigitalProducts(8), 13458); ``` -`pandigitalProducts(9)` should return `45228`. +`pandigitalProducts(9)` має повернути `45228`. ```js assert.strictEqual(pandigitalProducts(9), 45228); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md index 5419f2f8270..a833211dac2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md @@ -18,13 +18,13 @@ If the product of these four fractions is given in its lowest common terms, find # --hints-- -`digitCancellingFractions()` should return a number. +`digitCancellingFractions()` має повернути число. ```js assert(typeof digitCancellingFractions() === 'number'); ``` -`digitCancellingFractions()` should return 100. +`digitCancellingFractions()` має повернути 100. ```js assert.strictEqual(digitCancellingFractions(), 100); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md index 2eb87f93ba1..400272a4f6c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md @@ -16,13 +16,13 @@ Find the numbers and the sum of the numbers which are equal to the sum of the fa # --hints-- -`digitFactorial()` should return an object. +`digitFactorial()` має повернути об’єкт. ```js assert.typeOf(digitFactorial(), 'object'); ``` -`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }. +`digitFactorial()` має повернути { sum: 40730, numbers: [145, 40585] }. ```js assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] }); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md index aaae9562bb0..df245b7fa81 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md @@ -20,43 +20,43 @@ Circular primes individual rotation can exceed `n`. # --hints-- -`circularPrimes(100)` should return a number. +`circularPrimes(100)` має повернути число. ```js assert(typeof circularPrimes(100) === 'number'); ``` -`circularPrimes(100)` should return 13. +`circularPrimes(100)` має повернути 13. ```js assert(circularPrimes(100) == 13); ``` -`circularPrimes(100000)` should return 43. +`circularPrimes(100000)` має повернути 43. ```js assert(circularPrimes(100000) == 43); ``` -`circularPrimes(250000)` should return 45. +`circularPrimes(250000)` має повернути 45. ```js assert(circularPrimes(250000) == 45); ``` -`circularPrimes(500000)` should return 49. +`circularPrimes(500000)` має повернути 49. ```js assert(circularPrimes(500000) == 49); ``` -`circularPrimes(750000)` should return 49. +`circularPrimes(750000)` має повернути 49. ```js assert(circularPrimes(750000) == 49); ``` -`circularPrimes(1000000)` should return 55. +`circularPrimes(1000000)` має повернути 55. ```js assert(circularPrimes(1000000) == 55); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md index 9793d760c20..15444a14e8d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md @@ -16,31 +16,31 @@ Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, wh # --hints-- -`doubleBasePalindromes(1000)` should return a number. +`doubleBasePalindromes(1000)` має повернути число. ```js assert(typeof doubleBasePalindromes(1000) === 'number'); ``` -`doubleBasePalindromes(1000)` should return 1772. +`doubleBasePalindromes(1000)` має повернути 1772. ```js assert(doubleBasePalindromes(1000) == 1772); ``` -`doubleBasePalindromes(50000)` should return 105795. +`doubleBasePalindromes(50000)` має повернути 105795. ```js assert(doubleBasePalindromes(50000) == 105795); ``` -`doubleBasePalindromes(500000)` should return 286602. +`doubleBasePalindromes(500000)` має повернути 286602. ```js assert(doubleBasePalindromes(500000) == 286602); ``` -`doubleBasePalindromes(1000000)` should return 872187. +`doubleBasePalindromes(1000000)` має повернути 872187. ```js assert(doubleBasePalindromes(1000000) == 872187); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md index 5d4c80d5252..45df786c952 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md @@ -16,31 +16,31 @@ NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes. # --hints-- -`truncatablePrimes(8)` should return a number. +`truncatablePrimes(8)` має повернути число. ```js assert(typeof truncatablePrimes(8) === 'number'); ``` -`truncatablePrimes(8)` should return 1986. +`truncatablePrimes(8)` має повернути 1986. ```js assert(truncatablePrimes(8) == 1986); ``` -`truncatablePrimes(9)` should return 5123. +`truncatablePrimes(9)` має повернути 5123. ```js assert(truncatablePrimes(9) == 5123); ``` -`truncatablePrimes(10)` should return 8920. +`truncatablePrimes(10)` має повернути 8920. ```js assert(truncatablePrimes(10) == 8920); ``` -`truncatablePrimes(11)` should return 748317. +`truncatablePrimes(11)` має повернути 748317. ```js assert(truncatablePrimes(11) == 748317); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md index a1190e84f39..be1bbe7f243 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md @@ -22,19 +22,19 @@ What is the largest 1 to `k` pandigital `k`-digit number that can be formed as t # --hints-- -`pandigitalMultiples(8)` should return a number. +`pandigitalMultiples(8)` має повернути число. ```js assert(typeof pandigitalMultiples(8) === 'number'); ``` -`pandigitalMultiples(8)` should return `78156234`. +`pandigitalMultiples(8)` має повернути `78156234`. ```js assert.strictEqual(pandigitalMultiples(8), 78156234); ``` -`pandigitalMultiples(9)` should return `932718654`. +`pandigitalMultiples(9)` має повернути `932718654`. ```js assert.strictEqual(pandigitalMultiples(9), 932718654); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md index f1957262624..553c018bca4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md @@ -16,31 +16,31 @@ For which value of `p` ≤ `n`, is the number of solutions maximized? # --hints-- -`intRightTriangles(500)` should return a number. +`intRightTriangles(500)` має повернути число. ```js assert(typeof intRightTriangles(500) === 'number'); ``` -`intRightTriangles(500)` should return 420. +`intRightTriangles(500)` має повернути 420. ```js assert(intRightTriangles(500) == 420); ``` -`intRightTriangles(800)` should return 720. +`intRightTriangles(800)` має повернути 720. ```js assert(intRightTriangles(800) == 720); ``` -`intRightTriangles(900)` should return 840. +`intRightTriangles(900)` має повернути 840. ```js assert(intRightTriangles(900) == 840); ``` -`intRightTriangles(1000)` should return 840. +`intRightTriangles(1000)` має повернути 840. ```js assert(intRightTriangles(1000) == 840); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md index 9e436255531..0f65407b21d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-4-largest-palindrome-product.md @@ -14,19 +14,19 @@ Find the largest palindrome made from the product of two `n`-digit numbers. # --hints-- -`largestPalindromeProduct(2)` should return a number. +`largestPalindromeProduct(2)` має повернути число. ```js assert(typeof largestPalindromeProduct(2) === 'number'); ``` -`largestPalindromeProduct(2)` should return 9009. +`largestPalindromeProduct(2)` має повернути 9009. ```js assert.strictEqual(largestPalindromeProduct(2), 9009); ``` -`largestPalindromeProduct(3)` should return 906609. +`largestPalindromeProduct(3)` має повернути 906609. ```js assert.strictEqual(largestPalindromeProduct(3), 906609); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md index c4386bd2d91..1628a5a08b2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md @@ -20,25 +20,25 @@ d1 × d10 × d100 × d1000 × d # --hints-- -`champernownesConstant(100)` should return a number. +`champernownesConstant(100)` має повернути число. ```js assert(typeof champernownesConstant(100) === 'number'); ``` -`champernownesConstant(100)` should return 5. +`champernownesConstant(100)` має повернути 5. ```js assert.strictEqual(champernownesConstant(100), 5); ``` -`champernownesConstant(1000)` should return 15. +`champernownesConstant(1000)` має повернути 15. ```js assert.strictEqual(champernownesConstant(1000), 15); ``` -`champernownesConstant(1000000)` should return 210. +`champernownesConstant(1000000)` має повернути 210. ```js assert.strictEqual(champernownesConstant(1000000), 210); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md index a774fa31167..65a26a425f2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md @@ -14,19 +14,19 @@ What is the largest `n`-length digit pandigital prime that exists? # --hints-- -`pandigitalPrime(4)` should return a number. +`pandigitalPrime(4)` має повернути число. ```js assert(typeof pandigitalPrime(4) === 'number'); ``` -`pandigitalPrime(4)` should return 4231. +`pandigitalPrime(4)` має повернути 4231. ```js assert(pandigitalPrime(4) == 4231); ``` -`pandigitalPrime(7)` should return 7652413. +`pandigitalPrime(7)` має повернути 7652413. ```js assert(pandigitalPrime(7) == 7652413); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md index abda6f2d137..e0810744ccf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md @@ -18,31 +18,31 @@ Using words array of `n`-length, how many are triangle words? # --hints-- -`codedTriangleNumbers(1400)` should return a number. +`codedTriangleNumbers(1400)` має повернути число. ```js assert(typeof codedTriangleNumbers(1400) === 'number'); ``` -`codedTriangleNumbers(1400)` should return 129. +`codedTriangleNumbers(1400)` має повернути 129. ```js assert(codedTriangleNumbers(1400) == 129); ``` -`codedTriangleNumbers(1500)` should return 137. +`codedTriangleNumbers(1500)` має повернути 137. ```js assert(codedTriangleNumbers(1500) == 137); ``` -`codedTriangleNumbers(1600)` should return 141. +`codedTriangleNumbers(1600)` має повернути 141. ```js assert(codedTriangleNumbers(1600) == 141); ``` -`codedTriangleNumbers(1786)` should return 162. +`codedTriangleNumbers(1786)` має повернути 162. ```js assert(codedTriangleNumbers(1786) == 162); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md index 53ae7b50350..c5e7fe0d826 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md @@ -26,31 +26,31 @@ Find the sum of all 0 to `n` pandigital numbers with sub-strings fulfilling `n - # --hints-- -`substringDivisibility(5)` should return a number. +`substringDivisibility(5)` має повернути число. ```js assert(typeof substringDivisibility(5) === 'number'); ``` -`substringDivisibility(5)` should return `12444480`. +`substringDivisibility(5)` має повернути `12444480`. ```js assert.strictEqual(substringDivisibility(5), 12444480) ``` -`substringDivisibility(7)` should return `1099210170`. +`substringDivisibility(7)` має повернути `1099210170`. ```js assert.strictEqual(substringDivisibility(7), 1099210170) ``` -`substringDivisibility(8)` should return `1113342912`. +`substringDivisibility(8)` має повернути `1113342912`. ```js assert.strictEqual(substringDivisibility(8), 1113342912) ``` -`substringDivisibility(9)` should return `16695334890`. +`substringDivisibility(9)` має повернути `16695334890`. ```js assert.strictEqual(substringDivisibility(9), 16695334890) diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md index 44905c1be79..6573c720fdf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md @@ -18,13 +18,13 @@ Find the pair of pentagonal numbers, Pj and Pk, for which # --hints-- -`pentagonNumbers()` should return a number. +`pentagonNumbers()` має повернути число. ```js assert(typeof pentagonNumbers() === 'number'); ``` -`pentagonNumbers()` should return 5482660. +`pentagonNumbers()` має повернути 5482660. ```js assert.strictEqual(pentagonNumbers(), 5482660); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md index e80bcc8dd50..f4215885005 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md @@ -20,13 +20,13 @@ Find the next triangle number that is also pentagonal and hexagonal. # --hints-- -`triPentaHexa(40756)` should return a number. +`triPentaHexa(40756)` має повернути число. ```js assert(typeof triPentaHexa(40756) === 'number'); ``` -`triPentaHexa(40756)` should return 1533776805. +`triPentaHexa(40756)` має повернути 1533776805. ```js assert.strictEqual(triPentaHexa(40756), 1533776805); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md index 1bcc859d05e..b0b338ed8a8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md @@ -25,13 +25,13 @@ What is the smallest odd composite that cannot be written as the sum of a prime # --hints-- -`goldbachsOtherConjecture()` should return a number. +`goldbachsOtherConjecture()` має повернути число. ```js assert(typeof goldbachsOtherConjecture() === 'number'); ``` -`goldbachsOtherConjecture()` should return 5777. +`goldbachsOtherConjecture()` має повернути 5777. ```js assert.strictEqual(goldbachsOtherConjecture(), 5777); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md index 3b79403a4ea..f2a4828324b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md @@ -27,25 +27,25 @@ Find the first four consecutive integers to have four distinct prime factors eac # --hints-- -`distinctPrimeFactors(2, 2)` should return a number. +`distinctPrimeFactors(2, 2)` має повернути число. ```js assert(typeof distinctPrimeFactors(2, 2) === 'number'); ``` -`distinctPrimeFactors(2, 2)` should return 14. +`distinctPrimeFactors(2, 2)` має повернути 14. ```js assert.strictEqual(distinctPrimeFactors(2, 2), 14); ``` -`distinctPrimeFactors(3, 3)` should return 644. +`distinctPrimeFactors(3, 3)` має повернути 644. ```js assert.strictEqual(distinctPrimeFactors(3, 3), 644); ``` -`distinctPrimeFactors(4, 4)` should return 134043. +`distinctPrimeFactors(4, 4)` має повернути 134043. ```js assert.strictEqual(distinctPrimeFactors(4, 4), 134043); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md index d429c978791..9b06e5d3856 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md @@ -14,31 +14,31 @@ Find the last ten digits of the series, 11 + 22 + 33< # --hints-- -`selfPowers(10, 3)` should return a number. +`selfPowers(10, 3)` має повернути число. ```js assert(typeof selfPowers(10, 3) === 'number'); ``` -`selfPowers(10, 3)` should return 317. +`selfPowers(10, 3)` має повернути 317. ```js assert.strictEqual(selfPowers(10, 3), 317); ``` -`selfPowers(150, 6)` should return 29045. +`selfPowers(150, 6)` має повернути 29045. ```js assert.strictEqual(selfPowers(150, 6), 29045); ``` -`selfPowers(673, 7)` should return 2473989. +`selfPowers(673, 7)` має повернути 2473989. ```js assert.strictEqual(selfPowers(673, 7), 2473989); ``` -`selfPowers(1000, 10)` should return 9110846700. +`selfPowers(1000, 10)` має повернути 9110846700. ```js assert.strictEqual(selfPowers(1000, 10), 9110846700); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md index 3c0c1d3d362..5fb4d7d8ba9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md @@ -16,13 +16,13 @@ What 12-digit number do you form by concatenating the three terms in this sequen # --hints-- -`primePermutations()` should return a number. +`primePermutations()` має повернути число. ```js assert(typeof primePermutations() === 'number'); ``` -`primePermutations()` should return 296962999629. +`primePermutations()` має повернути 296962999629. ```js assert.strictEqual(primePermutations(), 296962999629); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md index 2f20bceaadf..9980d7d2d44 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-5-smallest-multiple.md @@ -14,37 +14,37 @@ What is the smallest positive number that is evenly divisible by all of the numb # --hints-- -`smallestMult(5)` should return a number. +`smallestMult(5)` має повернути число. ```js assert(typeof smallestMult(5) === 'number'); ``` -`smallestMult(5)` should return 60. +`smallestMult(5)` має повернути 60. ```js assert.strictEqual(smallestMult(5), 60); ``` -`smallestMult(7)` should return 420. +`smallestMult(7)` має повернути 420. ```js assert.strictEqual(smallestMult(7), 420); ``` -`smallestMult(10)` should return 2520. +`smallestMult(10)` має повернути 2520. ```js assert.strictEqual(smallestMult(10), 2520); ``` -`smallestMult(13)` should return 360360. +`smallestMult(13)` має повернути 360360. ```js assert.strictEqual(smallestMult(13), 360360); ``` -`smallestMult(20)` should return 232792560. +`smallestMult(20)` має повернути 232792560. ```js assert.strictEqual(smallestMult(20), 232792560); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md index 7cd5bc67b14..5eb1ef0212f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md @@ -20,19 +20,19 @@ Which prime, below one-million, can be written as the sum of the most consecutiv # --hints-- -`consecutivePrimeSum(1000)` should return a number. +`consecutivePrimeSum(1000)` має повернути число. ```js assert(typeof consecutivePrimeSum(1000) === 'number'); ``` -`consecutivePrimeSum(1000)` should return 953. +`consecutivePrimeSum(1000)` має повернути 953. ```js assert.strictEqual(consecutivePrimeSum(1000), 953); ``` -`consecutivePrimeSum(1000000)` should return 997651. +`consecutivePrimeSum(1000000)` має повернути 997651. ```js assert.strictEqual(consecutivePrimeSum(1000000), 997651); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md index cdbfc3e568b..5dc50b05564 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md @@ -16,25 +16,25 @@ Find the smallest prime which, by replacing part of the number (not necessarily # --hints-- -`primeDigitReplacements(6)` should return a number. +`primeDigitReplacements(6)` має повернути число. ```js assert(typeof primeDigitReplacements(6) === 'number'); ``` -`primeDigitReplacements(6)` should return `13`. +`primeDigitReplacements(6)` має повернути `13`. ```js assert.strictEqual(primeDigitReplacements(6), 13); ``` -`primeDigitReplacements(7)` should return `56003`. +`primeDigitReplacements(7)` має повернути `56003`. ```js assert.strictEqual(primeDigitReplacements(7), 56003); ``` -`primeDigitReplacements(8)` should return `121313`. +`primeDigitReplacements(8)` має повернути `121313`. ```js assert.strictEqual(primeDigitReplacements(8), 121313); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md index 7a3886a6e27..ced9bc90234 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md @@ -14,19 +14,19 @@ Find the smallest positive integer, such that multiplied by integers $\\{2, 3, \ # --hints-- -`permutedMultiples(2)` should return a number. +`permutedMultiples(2)` має повернути число. ```js assert(typeof permutedMultiples(2) === 'number'); ``` -`permutedMultiples(2)` should return `125874`. +`permutedMultiples(2)` має повернути `125874`. ```js assert.strictEqual(permutedMultiples(2), 125874); ``` -`permutedMultiples(6)` should return `142857`. +`permutedMultiples(6)` має повернути `142857`. ```js assert.strictEqual(permutedMultiples(6), 142857); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md index 8d96ff14392..40eb4fd1a20 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md @@ -22,31 +22,31 @@ How many, not necessarily distinct, values of $\\displaystyle \\binom n r$ for $ # --hints-- -`combinatoricSelections(1000)` should return a number. +`combinatoricSelections(1000)` має повернути число. ```js assert(typeof combinatoricSelections(1000) === 'number'); ``` -`combinatoricSelections(1000)` should return 4626. +`combinatoricSelections(1000)` має повернути 4626. ```js assert.strictEqual(combinatoricSelections(1000), 4626); ``` -`combinatoricSelections(10000)` should return 4431. +`combinatoricSelections(10000)` має повернути 4431. ```js assert.strictEqual(combinatoricSelections(10000), 4431); ``` -`combinatoricSelections(100000)` should return 4255. +`combinatoricSelections(100000)` має повернути 4255. ```js assert.strictEqual(combinatoricSelections(100000), 4255); ``` -`combinatoricSelections(1000000)` should return 4075. +`combinatoricSelections(1000000)` має повернути 4075. ```js assert.strictEqual(combinatoricSelections(1000000), 4075); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md index b08e9a13bda..82fbf33c3e2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md @@ -43,19 +43,19 @@ How many hands does Player 1 win? # --hints-- -`pokerHands(testArr)` should return a number. +`pokerHands(testArr)` має повернути число. ```js assert(typeof pokerHands(testArr) === 'number'); ``` -`pokerHands(testArr)` should return 2. +`pokerHands(testArr)` має повернути 2. ```js assert.strictEqual(pokerHands(testArr), 2); ``` -`pokerHands(handsArr)` should return 376. +`pokerHands(handsArr)` має повернути 376. ```js assert.strictEqual(pokerHands(handsArr), 376); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md index 890c5b0997d..c4c72b7abec 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md @@ -30,37 +30,37 @@ How many Lychrel numbers are there below `num`? # --hints-- -`countLychrelNumbers(1000)` should return a number. +`countLychrelNumbers(1000)` має повернути число. ```js assert(typeof countLychrelNumbers(1000) === 'number'); ``` -`countLychrelNumbers(1000)` should return 13. +`countLychrelNumbers(1000)` має повернути 13. ```js assert.strictEqual(countLychrelNumbers(1000), 13); ``` -`countLychrelNumbers(3243)` should return 39. +`countLychrelNumbers(3243)` має повернути 39. ```js assert.strictEqual(countLychrelNumbers(3243), 39); ``` -`countLychrelNumbers(5000)` should return 76. +`countLychrelNumbers(5000)` має повернути 76. ```js assert.strictEqual(countLychrelNumbers(5000), 76); ``` -`countLychrelNumbers(7654)` should return 140. +`countLychrelNumbers(7654)` має повернути 140. ```js assert.strictEqual(countLychrelNumbers(7654), 140); ``` -`countLychrelNumbers(10000)` should return 249. +`countLychrelNumbers(10000)` має повернути 249. ```js assert.strictEqual(countLychrelNumbers(10000), 249); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md index e445973f332..a84dbb2ccc5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md @@ -14,37 +14,37 @@ Considering natural numbers of the form, $a^b$, where `a`, `b` < `n`, what is # --hints-- -`powerfulDigitSum(3)` should return a number. +`powerfulDigitSum(3)` має повернути число. ```js assert(typeof powerfulDigitSum(3) === 'number'); ``` -`powerfulDigitSum(3)` should return `4`. +`powerfulDigitSum(3)` має повернути `4`. ```js assert.strictEqual(powerfulDigitSum(3), 4); ``` -`powerfulDigitSum(10)` should return `45`. +`powerfulDigitSum(10)` має повернути `45`. ```js assert.strictEqual(powerfulDigitSum(10), 45); ``` -`powerfulDigitSum(50)` should return `406`. +`powerfulDigitSum(50)` має повернути `406`. ```js assert.strictEqual(powerfulDigitSum(50), 406); ``` -`powerfulDigitSum(75)` should return `684`. +`powerfulDigitSum(75)` має повернути `684`. ```js assert.strictEqual(powerfulDigitSum(75), 684); ``` -`powerfulDigitSum(100)` should return `972`. +`powerfulDigitSum(100)` має повернути `972`. ```js assert.strictEqual(powerfulDigitSum(100), 972); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md index 034974d882c..a49bdc6a27a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md @@ -28,25 +28,25 @@ In the first `n` expansions, how many fractions contain a numerator with more di # --hints-- -`squareRootConvergents(10)` should return a number. +`squareRootConvergents(10)` має повернути число. ```js assert(typeof squareRootConvergents(10) === 'number'); ``` -`squareRootConvergents(10)` should return 1. +`squareRootConvergents(10)` має повернути 1. ```js assert.strictEqual(squareRootConvergents(10), 1); ``` -`squareRootConvergents(100)` should return 15. +`squareRootConvergents(100)` має повернути 15. ```js assert.strictEqual(squareRootConvergents(100), 15); ``` -`squareRootConvergents(1000)` should return 153. +`squareRootConvergents(1000)` має повернути 153. ```js assert.strictEqual(squareRootConvergents(1000), 153); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md index 70b80ebf2a1..47b89559e23 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md @@ -26,25 +26,25 @@ If one complete new layer is wrapped around the spiral above, a square spiral wi # --hints-- -`spiralPrimes(50)` should return a number. +`spiralPrimes(50)` має повернути число. ```js assert(typeof spiralPrimes(50) === 'number'); ``` -`spiralPrimes(50)` should return `11`. +`spiralPrimes(50)` має повернути `11`. ```js assert.strictEqual(spiralPrimes(50), 11); ``` -`spiralPrimes(15)` should return `981`. +`spiralPrimes(15)` має повернути `981`. ```js assert.strictEqual(spiralPrimes(15), 981); ``` -`spiralPrimes(10)` should return `26241`. +`spiralPrimes(10)` має повернути `26241`. ```js assert.strictEqual(spiralPrimes(10), 26241); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md index 0784e292908..27bb5037e9a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md @@ -20,13 +20,13 @@ Your task has been made easy, as the encryption key consists of three lower case # --hints-- -`XORDecryption(cipher)` should return a number. +`XORDecryption(cipher)` має повернути число. ```js assert(typeof XORDecryption(cipher) === 'number'); ``` -`XORDecryption(cipher)` should return 129448. +`XORDecryption(cipher)` має повернути 129448. ```js assert.strictEqual(XORDecryption(cipher), 129448); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md index 65a460bd803..9f86d28b329 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-6-sum-square-difference.md @@ -22,25 +22,25 @@ Find the difference between the sum of the squares of the first `n` natural numb # --hints-- -`sumSquareDifference(10)` should return a number. +`sumSquareDifference(10)` має повернути число. ```js assert(typeof sumSquareDifference(10) === 'number'); ``` -`sumSquareDifference(10)` should return 2640. +`sumSquareDifference(10)` має повернути 2640. ```js assert.strictEqual(sumSquareDifference(10), 2640); ``` -`sumSquareDifference(20)` should return 41230. +`sumSquareDifference(20)` має повернути 41230. ```js assert.strictEqual(sumSquareDifference(20), 41230); ``` -`sumSquareDifference(100)` should return 25164150. +`sumSquareDifference(100)` має повернути 25164150. ```js assert.strictEqual(sumSquareDifference(100), 25164150); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md index dc4a88c2cfb..285d049ce77 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md @@ -14,13 +14,13 @@ Find the lowest sum for a set of five primes for which any two primes concatenat # --hints-- -`primePairSets()` should return a number. +`primePairSets()` має повернути число. ```js assert(typeof primePairSets() === 'number'); ``` -`primePairSets()` should return 26033. +`primePairSets()` має повернути 26033. ```js assert.strictEqual(primePairSets(), 26033); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md index 99fee7255e8..5ada2c7c45a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md @@ -29,31 +29,31 @@ Find the sum of all numbers in ordered sets of `n` cyclic 4-digit numbers for wh # --hints-- -`cyclicalFigurateNums(3)` should return a number. +`cyclicalFigurateNums(3)` має повернути число. ```js assert(typeof cyclicalFigurateNums(3) === 'number'); ``` -`cyclicalFigurateNums(3)` should return `19291`. +`cyclicalFigurateNums(3)` має повернути `19291`. ```js assert.strictEqual(cyclicalFigurateNums(3), 19291); ``` -`cyclicalFigurateNums(4)` should return `28684`. +`cyclicalFigurateNums(4)` має повернути `28684`. ```js assert.strictEqual(cyclicalFigurateNums(4), 28684); ``` -`cyclicalFigurateNums(5)` should return `76255`. +`cyclicalFigurateNums(5)` має повернути `76255`. ```js assert.strictEqual(cyclicalFigurateNums(5), 76255); ``` -`cyclicalFigurateNums(6)` should return `28684`. +`cyclicalFigurateNums(6)` має повернути `28684`. ```js assert.strictEqual(cyclicalFigurateNums(6), 28684); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md index a89d136f83c..a57b0116551 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md @@ -14,31 +14,31 @@ Find the smallest cube for which exactly `n` permutations of its digits are cube # --hints-- -`cubicPermutations(2)` should return a number. +`cubicPermutations(2)` має повернути число. ```js assert(typeof cubicPermutations(2) === 'number'); ``` -`cubicPermutations(2)` should return `125`. +`cubicPermutations(2)` має повернути `125`. ```js assert.strictEqual(cubicPermutations(2), 125); ``` -`cubicPermutations(3)` should return `41063625`. +`cubicPermutations(3)` має повернути `41063625`. ```js assert.strictEqual(cubicPermutations(3), 41063625); ``` -`cubicPermutations(4)` should return `1006012008`. +`cubicPermutations(4)` має повернути `1006012008`. ```js assert.strictEqual(cubicPermutations(4), 1006012008); ``` -`cubicPermutations(5)` should return `127035954683`. +`cubicPermutations(5)` має повернути `127035954683`. ```js assert.strictEqual(cubicPermutations(5), 127035954683); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md index 2c8b0bb8cd6..b9b532def64 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md @@ -14,67 +14,67 @@ Complete the function so that it returns how many positive integers are of lengt # --hints-- -`powerfulDigitCounts(1)` should return a number. +`powerfulDigitCounts(1)` має повернути число. ```js assert(typeof powerfulDigitCounts(1) === 'number'); ``` -`powerfulDigitCounts(1)` should return `9`. +`powerfulDigitCounts(1)` має повернути `9`. ```js assert.strictEqual(powerfulDigitCounts(1), 9); ``` -`powerfulDigitCounts(2)` should return `6`. +`powerfulDigitCounts(2)` має повернути `6`. ```js assert.strictEqual(powerfulDigitCounts(2), 6); ``` -`powerfulDigitCounts(3)` should return `5`. +`powerfulDigitCounts(3)` має повернути `5`. ```js assert.strictEqual(powerfulDigitCounts(3), 5); ``` -`powerfulDigitCounts(4)` should return `4`. +`powerfulDigitCounts(4)` має повернути `4`. ```js assert.strictEqual(powerfulDigitCounts(4), 4); ``` -`powerfulDigitCounts(5)` should return `3`. +`powerfulDigitCounts(5)` має повернути `3`. ```js assert.strictEqual(powerfulDigitCounts(5), 3); ``` -`powerfulDigitCounts(6)` should return `3`. +`powerfulDigitCounts(6)` має повернути `3`. ```js assert.strictEqual(powerfulDigitCounts(6), 3); ``` -`powerfulDigitCounts(7)` should return `2`. +`powerfulDigitCounts(7)` має повернути `2`. ```js assert.strictEqual(powerfulDigitCounts(7), 2); ``` -`powerfulDigitCounts(8)` should return `2`. +`powerfulDigitCounts(8)` має повернути `2`. ```js assert.strictEqual(powerfulDigitCounts(8), 2); ``` -`powerfulDigitCounts(10)` should return `2`. +`powerfulDigitCounts(10)` має повернути `2`. ```js assert.strictEqual(powerfulDigitCounts(10), 2); ``` -`powerfulDigitCounts(21)` should return `1`. +`powerfulDigitCounts(21)` має повернути `1`. ```js assert.strictEqual(powerfulDigitCounts(21), 1); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md index a6acdfc610e..fd68a96d962 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md @@ -68,31 +68,31 @@ How many continued fractions for $N \\le n$ have an odd period? # --hints-- -`oddPeriodSqrts(13)` should return a number. +`oddPeriodSqrts(13)` має повернути число. ```js assert(typeof oddPeriodSqrts(13) === 'number'); ``` -`oddPeriodSqrts(500)` should return `83`. +`oddPeriodSqrts(500)` має повернути `83`. ```js assert.strictEqual(oddPeriodSqrts(500), 83); ``` -`oddPeriodSqrts(1000)` should return `152`. +`oddPeriodSqrts(1000)` має повернути `152`. ```js assert.strictEqual(oddPeriodSqrts(1000), 152); ``` -`oddPeriodSqrts(5000)` should return `690`. +`oddPeriodSqrts(5000)` має повернути `690`. ```js assert.strictEqual(oddPeriodSqrts(5000), 690); ``` -`oddPeriodSqrts(10000)` should return `1322`. +`oddPeriodSqrts(10000)` має повернути `1322`. ```js assert.strictEqual(oddPeriodSqrts(10000), 1322); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md index 9aa62302442..cad04b6edbd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md @@ -30,37 +30,37 @@ Find the sum of digits in the numerator of the `n`th convergent of th # --hints-- -`convergentsOfE(10)` should return a number. +`convergentsOfE(10)` має повернути число. ```js assert(typeof convergentsOfE(10) === 'number'); ``` -`convergentsOfE(10)` should return `17`. +`convergentsOfE(10)` має повернути `17`. ```js assert.strictEqual(convergentsOfE(10), 17); ``` -`convergentsOfE(30)` should return `53`. +`convergentsOfE(30)` має повернути `53`. ```js assert.strictEqual(convergentsOfE(30), 53); ``` -`convergentsOfE(50)` should return `91`. +`convergentsOfE(50)` має повернути `91`. ```js assert.strictEqual(convergentsOfE(50), 91); ``` -`convergentsOfE(70)` should return `169`. +`convergentsOfE(70)` має повернути `169`. ```js assert.strictEqual(convergentsOfE(70), 169); ``` -`convergentsOfE(100)` should return `272`. +`convergentsOfE(100)` має повернути `272`. ```js assert.strictEqual(convergentsOfE(100), 272); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md index 9e01ce1b0c5..dde509c6658 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md @@ -32,37 +32,37 @@ Find the value of D ≤ `n` in minimal solutions of `x` for which the largest va # --hints-- -`diophantineEquation(7)` should return a number. +`diophantineEquation(7)` має повернути число. ```js assert(typeof diophantineEquation(7) === 'number'); ``` -`diophantineEquation(7)` should return `5`. +`diophantineEquation(7)` має повернути `5`. ```js assert.strictEqual(diophantineEquation(7), 5); ``` -`diophantineEquation(100)` should return `61`. +`diophantineEquation(100)` має повернути `61`. ```js assert.strictEqual(diophantineEquation(100), 61); ``` -`diophantineEquation(409)` should return `409`. +`diophantineEquation(409)` має повернути `409`. ```js assert.strictEqual(diophantineEquation(409), 409); ``` -`diophantineEquation(500)` should return `421`. +`diophantineEquation(500)` має повернути `421`. ```js assert.strictEqual(diophantineEquation(500), 421); ``` -`diophantineEquation(1000)` should return `661`. +`diophantineEquation(1000)` має повернути `661`. ```js assert.strictEqual(diophantineEquation(1000), 661); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md index c3aa2fb6e3b..7b616bcf901 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md @@ -25,19 +25,19 @@ Find the maximum total from top to bottom in `numTriangle`, a 2D array defined i # --hints-- -`maximumPathSumII(testTriangle)` should return a number. +`maximumPathSumII(testTriangle)` має повернути число. ```js assert(typeof maximumPathSumII(_testTriangle) === 'number'); ``` -`maximumPathSumII(testTriangle)` should return 23. +`maximumPathSumII(testTriangle)` має повернути 23. ```js assert.strictEqual(maximumPathSumII(_testTriangle), 23); ``` -`maximumPathSumII(numTriangle)` should return 7273. +`maximumPathSumII(numTriangle)` має повернути 7273. ```js assert.strictEqual(maximumPathSumII(_numTriangle), 7273); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md index 7d8984cc7f8..ad70f1266c7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md @@ -39,13 +39,13 @@ Using the numbers 1 to 10, and depending on arrangements, it is possible to form # --hints-- -`magic5GonRing()` should return a number. +`magic5GonRing()` має повернути число. ```js assert(typeof magic5GonRing() === 'number'); ``` -`magic5GonRing()` should return 6531031914842725. +`magic5GonRing()` має повернути 6531031914842725. ```js assert.strictEqual(magic5GonRing(), 6531031914842725); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md index e57b133fbe7..0c4aee83c44 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md @@ -32,31 +32,31 @@ Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ i # --hints-- -`totientMaximum(10)` should return a number. +`totientMaximum(10)` має повернути число. ```js assert(typeof totientMaximum(10) === 'number'); ``` -`totientMaximum(10)` should return `6`. +`totientMaximum(10)` має повернути `6`. ```js assert.strictEqual(totientMaximum(10), 6); ``` -`totientMaximum(10000)` should return `2310`. +`totientMaximum(10000)` має повернути `2310`. ```js assert.strictEqual(totientMaximum(10000), 2310); ``` -`totientMaximum(500000)` should return `30030`. +`totientMaximum(500000)` має повернути `30030`. ```js assert.strictEqual(totientMaximum(500000), 30030); ``` -`totientMaximum(1000000)` should return `510510`. +`totientMaximum(1000000)` має повернути `510510`. ```js assert.strictEqual(totientMaximum(1000000), 510510); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md index 6780c8fa2d1..2e1311cb0a1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-7-10001st-prime.md @@ -14,37 +14,37 @@ What is the `n`th prime number? # --hints-- -`nthPrime(6)` should return a number. +`nthPrime(6)` має повернути число. ```js assert(typeof nthPrime(6) === 'number'); ``` -`nthPrime(6)` should return 13. +`nthPrime(6)` має повернути 13. ```js assert.strictEqual(nthPrime(6), 13); ``` -`nthPrime(10)` should return 29. +`nthPrime(10)` має повернути 29. ```js assert.strictEqual(nthPrime(10), 29); ``` -`nthPrime(100)` should return 541. +`nthPrime(100)` має повернути 541. ```js assert.strictEqual(nthPrime(100), 541); ``` -`nthPrime(1000)` should return 7919. +`nthPrime(1000)` має повернути 7919. ```js assert.strictEqual(nthPrime(1000), 7919); ``` -`nthPrime(10001)` should return 104743. +`nthPrime(10001)` має повернути 104743. ```js assert.strictEqual(nthPrime(10001), 104743); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md index 1328f1ca1e7..92b6293d05a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md @@ -16,31 +16,31 @@ Find the value of `n`, 1 < `n` < `limit`, for which ${\phi}(n)$ is a permu # --hints-- -`totientPermutation(10000)` should return a number. +`totientPermutation(10000)` має повернути число. ```js assert(typeof totientPermutation(10000) === 'number'); ``` -`totientPermutation(10000)` should return `4435`. +`totientPermutation(10000)` має повернути `4435`. ```js assert.strictEqual(totientPermutation(10000), 4435); ``` -`totientPermutation(100000)` should return `75841`. +`totientPermutation(100000)` має повернути `75841`. ```js assert.strictEqual(totientPermutation(100000), 75841); ``` -`totientPermutation(500000)` should return `474883`. +`totientPermutation(500000)` має повернути `474883`. ```js assert.strictEqual(totientPermutation(500000), 474883); ``` -`totientPermutation(10000000)` should return `8319823`. +`totientPermutation(10000000)` має повернути `8319823`. ```js assert.strictEqual(totientPermutation(10000000), 8319823); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md index 267a17669b0..a9a1c091f43 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md @@ -20,37 +20,37 @@ By listing the set of reduced proper fractions for `d` ≤ `limit` in ascending # --hints-- -`orderedFractions(8)` should return a number. +`orderedFractions(8)` має повернути число. ```js assert(typeof orderedFractions(8) === 'number'); ``` -`orderedFractions(8)` should return `2`. +`orderedFractions(8)` має повернути `2`. ```js assert.strictEqual(orderedFractions(8), 2); ``` -`orderedFractions(10)` should return `2`. +`orderedFractions(10)` має повернути `2`. ```js assert.strictEqual(orderedFractions(10), 2); ``` -`orderedFractions(9994)` should return `4283`. +`orderedFractions(9994)` має повернути `4283`. ```js assert.strictEqual(orderedFractions(9994), 4283); ``` -`orderedFractions(500000)` should return `214283`. +`orderedFractions(500000)` має повернути `214283`. ```js assert.strictEqual(orderedFractions(500000), 214283); ``` -`orderedFractions(1000000)` should return `428570`. +`orderedFractions(1000000)` має повернути `428570`. ```js assert.strictEqual(orderedFractions(1000000), 428570); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md index dab392ae0ae..a3c1a8719c2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md @@ -20,31 +20,31 @@ How many elements would be contained in the set of reduced proper fractions for # --hints-- -`countingFractions(8)` should return a number. +`countingFractions(8)` має повернути число. ```js assert(typeof countingFractions(8) === 'number'); ``` -`countingFractions(8)` should return `21`. +`countingFractions(8)` має повернути `21`. ```js assert.strictEqual(countingFractions(8), 21); ``` -`countingFractions(20000)` should return `121590395`. +`countingFractions(20000)` має повернути `121590395`. ```js assert.strictEqual(countingFractions(20000), 121590395); ``` -`countingFractions(500000)` should return `75991039675`. +`countingFractions(500000)` має повернути `75991039675`. ```js assert.strictEqual(countingFractions(500000), 75991039675); ``` -`countingFractions(1000000)` should return `303963552391`. +`countingFractions(1000000)` має повернути `303963552391`. ```js assert.strictEqual(countingFractions(1000000), 303963552391); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md index b53ef258385..c7014376e71 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-73-counting-fractions-in-a-range.md @@ -20,31 +20,31 @@ How many fractions lie between $\frac{1}{3}$ and $\frac{1}{2}$ in the sorted set # --hints-- -`countingFractionsInARange(8)` should return a number. +`countingFractionsInARange(8)` має повернути число. ```js assert(typeof countingFractionsInARange(8) === 'number'); ``` -`countingFractionsInARange(8)` should return `3`. +`countingFractionsInARange(8)` має повернути `3`. ```js assert.strictEqual(countingFractionsInARange(8), 3); ``` -`countingFractionsInARange(1000)` should return `50695`. +`countingFractionsInARange(1000)` має повернути `50695`. ```js assert.strictEqual(countingFractionsInARange(1000), 50695); ``` -`countingFractionsInARange(6000)` should return `1823861`. +`countingFractionsInARange(6000)` має повернути `1823861`. ```js assert.strictEqual(countingFractionsInARange(6000), 1823861); ``` -`countingFractionsInARange(12000)` should return `7295372`. +`countingFractionsInARange(12000)` має повернути `7295372`. ```js assert.strictEqual(countingFractionsInARange(12000), 7295372); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md index 0b94dee88dd..380ca5b0078 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-74-digit-factorial-chains.md @@ -30,31 +30,31 @@ How many chains, with a starting number below `n`, contain exactly sixty non-rep # --hints-- -`digitFactorialChains(2000)` should return a number. +`digitFactorialChains(2000)` має повернути число. ```js assert(typeof digitFactorialChains(2000) === 'number'); ``` -`digitFactorialChains(2000)` should return `6`. +`digitFactorialChains(2000)` має повернути `6`. ```js assert.strictEqual(digitFactorialChains(2000), 6); ``` -`digitFactorialChains(100000)` should return `42`. +`digitFactorialChains(100000)` має повернути `42`. ```js assert.strictEqual(digitFactorialChains(100000), 42); ``` -`digitFactorialChains(500000)` should return `282`. +`digitFactorialChains(500000)` має повернути `282`. ```js assert.strictEqual(digitFactorialChains(500000), 282); ``` -`digitFactorialChains(1000000)` should return `402`. +`digitFactorialChains(1000000)` має повернути `402`. ```js assert.strictEqual(digitFactorialChains(1000000), 402); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-75-singular-integer-right-triangles.md index 40ab4fb3e00..52351dd44b8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-75-singular-integer-right-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-75-singular-integer-right-triangles.md @@ -29,31 +29,31 @@ Given that L is the length of the wire, for how many values of L ≤ `n` can exa # --hints-- -`singularIntRightTriangles(48)` should return a number. +`singularIntRightTriangles(48)` має повернути число. ```js assert(typeof singularIntRightTriangles(48) === 'number'); ``` -`singularIntRightTriangles(48)` should return `6`. +`singularIntRightTriangles(48)` має повернути `6`. ```js assert.strictEqual(singularIntRightTriangles(48), 6); ``` -`singularIntRightTriangles(700000)` should return `75783`. +`singularIntRightTriangles(700000)` має повернути `75783`. ```js assert.strictEqual(singularIntRightTriangles(700000), 75783); ``` -`singularIntRightTriangles(1000000)` should return `107876`. +`singularIntRightTriangles(1000000)` має повернути `107876`. ```js assert.strictEqual(singularIntRightTriangles(1000000), 107876); ``` -`singularIntRightTriangles(1500000)` should return `161667`. +`singularIntRightTriangles(1500000)` має повернути `161667`. ```js assert.strictEqual(singularIntRightTriangles(1500000), 161667); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md index 04a358b584d..44b40ab26bf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-76-counting-summations.md @@ -23,31 +23,31 @@ How many different ways can `n` be written as a sum of at least two positive int # --hints-- -`countingSummations(5)` should return a number. +`countingSummations(5)` має повернути число. ```js assert(typeof countingSummations(5) === 'number'); ``` -`countingSummations(5)` should return `6`. +`countingSummations(5)` має повернути `6`. ```js assert.strictEqual(countingSummations(5), 6); ``` -`countingSummations(20)` should return `626`. +`countingSummations(20)` має повернути `626`. ```js assert.strictEqual(countingSummations(20), 626); ``` -`countingSummations(50)` should return `204225`. +`countingSummations(50)` має повернути `204225`. ```js assert.strictEqual(countingSummations(50), 204225); ``` -`countingSummations(100)` should return `190569291`. +`countingSummations(100)` має повернути `190569291`. ```js assert.strictEqual(countingSummations(100), 190569291); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md index a5639dc73a4..5e6407481b2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-77-prime-summations.md @@ -22,31 +22,31 @@ What is the first value which can be written as the sum of primes in over `n` wa # --hints-- -`primeSummations(5)` should return a number. +`primeSummations(5)` має повернути число. ```js assert(typeof primeSummations(5) === 'number'); ``` -`primeSummations(5)` should return `11`. +`primeSummations(5)` має повернути `11`. ```js assert.strictEqual(primeSummations(5), 11); ``` -`primeSummations(100)` should return `31`. +`primeSummations(100)` має повернути `31`. ```js assert.strictEqual(primeSummations(100), 31); ``` -`primeSummations(1000)` should return `53`. +`primeSummations(1000)` має повернути `53`. ```js assert.strictEqual(primeSummations(1000), 53); ``` -`primeSummations(5000)` should return `71`. +`primeSummations(5000)` має повернути `71`. ```js assert.strictEqual(primeSummations(5000), 71); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md index 65d3ebad7e4..40357f3681c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-78-coin-partitions.md @@ -28,31 +28,31 @@ Find the least value of `n` for which ${p}(n)$ is divisible by `divisor`. # --hints-- -`coinPartitions(7)` should return a number. +`coinPartitions(7)` має повернути число. ```js assert(typeof coinPartitions(7) === 'number'); ``` -`coinPartitions(7)` should return `5`. +`coinPartitions(7)` має повернути `5`. ```js assert.strictEqual(coinPartitions(7), 5); ``` -`coinPartitions(10000)` should return `599`. +`coinPartitions(10000)` має повернути `599`. ```js assert.strictEqual(coinPartitions(10000), 599); ``` -`coinPartitions(100000)` should return `11224`. +`coinPartitions(100000)` має повернути `11224`. ```js assert.strictEqual(coinPartitions(100000), 11224); ``` -`coinPartitions(1000000)` should return `55374`. +`coinPartitions(1000000)` має повернути `55374`. ```js assert.strictEqual(coinPartitions(1000000), 55374); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-79-passcode-derivation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-79-passcode-derivation.md index a17babe3520..850e6c7e9ae 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-79-passcode-derivation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-79-passcode-derivation.md @@ -16,25 +16,25 @@ Given that the three characters are always asked for in order, analyze the array # --hints-- -`passcodeDerivation(keylog1)` should return a number. +`passcodeDerivation(keylog1)` має повернути число. ```js assert(typeof passcodeDerivation(_keylog1) === 'number'); ``` -`passcodeDerivation(keylog1)` should return `531278`. +`passcodeDerivation(keylog1)` має повернути `531278`. ```js assert.strictEqual(passcodeDerivation(_keylog1), 531278); ``` -`passcodeDerivation(keylog2)` should return `1230567`. +`passcodeDerivation(keylog2)` має повернути `1230567`. ```js assert.strictEqual(passcodeDerivation(_keylog2), 1230567); ``` -`passcodeDerivation(keylog3)` should return `73162890`. +`passcodeDerivation(keylog3)` має повернути `73162890`. ```js assert.strictEqual(passcodeDerivation(_keylog3), 73162890); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md index c84d410e207..4b4dc35dc6d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-8-largest-product-in-a-series.md @@ -35,19 +35,19 @@ Find the `n` adjacent digits in the 1000-digit number that have the greatest pro # --hints-- -`largestProductinaSeries(4)` should return a number. +`largestProductinaSeries(4)` має повернути число. ```js assert(typeof largestProductinaSeries(4) === 'number'); ``` -`largestProductinaSeries(4)` should return 5832. +`largestProductinaSeries(4)` має повернути 5832. ```js assert.strictEqual(largestProductinaSeries(4), 5832); ``` -`largestProductinaSeries(13)` should return 23514624000. +`largestProductinaSeries(13)` має повернути 23514624000. ```js assert.strictEqual(largestProductinaSeries(13), 23514624000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md index 34d7dd6eea4..3ed79fa6be8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-80-square-root-digital-expansion.md @@ -16,25 +16,25 @@ For the first `n` natural numbers, find the total of the digital sums of the fir # --hints-- -`sqrtDigitalExpansion(2)` should return a number. +`sqrtDigitalExpansion(2)` має повернути число. ```js assert(typeof sqrtDigitalExpansion(2) === 'number'); ``` -`sqrtDigitalExpansion(2)` should return `475`. +`sqrtDigitalExpansion(2)` має повернути `475`. ```js assert.strictEqual(sqrtDigitalExpansion(2), 475); ``` -`sqrtDigitalExpansion(50)` should return `19543`. +`sqrtDigitalExpansion(50)` має повернути `19543`. ```js assert.strictEqual(sqrtDigitalExpansion(50), 19543); ``` -`sqrtDigitalExpansion(100)` should return `40886`. +`sqrtDigitalExpansion(100)` має повернути `40886`. ```js assert.strictEqual(sqrtDigitalExpansion(100), 40886); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md index 5fe3982048f..180c918a74a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-81-path-sum-two-ways.md @@ -18,19 +18,19 @@ Find the minimal path sum from the top left to the bottom right by only moving r # --hints-- -`pathSumTwoWays(testMatrix1)` should return a number. +`pathSumTwoWays(testMatrix1)` має повернути число. ```js assert(typeof pathSumTwoWays(_testMatrix1) === 'number'); ``` -`pathSumTwoWays(testMatrix1)` should return `2427`. +`pathSumTwoWays(testMatrix1)` має повернути `2427`. ```js assert.strictEqual(pathSumTwoWays(_testMatrix1), 2427); ``` -`pathSumTwoWays(testMatrix2)` should return `427337`. +`pathSumTwoWays(testMatrix2)` має повернути `427337`. ```js assert.strictEqual(pathSumTwoWays(_testMatrix2), 427337); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md index 0895540d468..4cfc9d4570a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-82-path-sum-three-ways.md @@ -20,19 +20,19 @@ Find the minimal path sum from the left column to the right column in `matrix`, # --hints-- -`pathSumThreeWays(testMatrix1)` should return a number. +`pathSumThreeWays(testMatrix1)` має повернути число. ```js assert(typeof pathSumThreeWays(_testMatrix1) === 'number'); ``` -`pathSumThreeWays(testMatrix1)` should return `994`. +`pathSumThreeWays(testMatrix1)` має повернути `994`. ```js assert.strictEqual(pathSumThreeWays(_testMatrix1), 994); ``` -`pathSumThreeWays(testMatrix2)` should return `260324`. +`pathSumThreeWays(testMatrix2)` має повернути `260324`. ```js assert.strictEqual(pathSumThreeWays(_testMatrix2), 260324); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md index 8d3b60e0c0b..15cbf887a81 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-83-path-sum-four-ways.md @@ -20,19 +20,19 @@ Find the minimal path sum from the top left to the bottom right by moving left, # --hints-- -`pathSumFourWays(testMatrix1)` should return a number. +`pathSumFourWays(testMatrix1)` має повернути число. ```js assert(typeof pathSumFourWays(_testMatrix1) === 'number'); ``` -`pathSumFourWays(testMatrix1)` should return `2297`. +`pathSumFourWays(testMatrix1)` має повернути `2297`. ```js assert.strictEqual(pathSumFourWays(_testMatrix1), 2297); ``` -`pathSumFourWays(testMatrix2)` should return `425185`. +`pathSumFourWays(testMatrix2)` має повернути `425185`. ```js assert.strictEqual(pathSumFourWays(_testMatrix2), 425185); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md index 92c630f9429..3f8c5843344 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-84-monopoly-odds.md @@ -126,31 +126,31 @@ If, instead of using two 6-sided dice, two `n`-sided dice are used, find the six # --hints-- -`monopolyOdds(8)` should return a string. +`monopolyOdds(8)` має повернути рядок. ```js assert(typeof monopolyOdds(8) === 'string'); ``` -`monopolyOdds(8)` should return string `102400`. +`monopolyOdds(8)` має повернути рядок `102400`. ```js assert.strictEqual(monopolyOdds(8), '102400'); ``` -`monopolyOdds(10)` should return string `100024`. +`monopolyOdds(10)` має повернути рядок `100024`. ```js assert.strictEqual(monopolyOdds(10), '100024'); ``` -`monopolyOdds(20)` should return string `100005`. +`monopolyOdds(20)` має повернути рядок `100005`. ```js assert.strictEqual(monopolyOdds(20), '100005'); ``` -`monopolyOdds(4)` should return string `101524`. +`monopolyOdds(4)` має повернути рядок `101524`. ```js assert.strictEqual(monopolyOdds(4), '101524'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md index eafbccb8aee..170a1a29ec2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-85-counting-rectangles.md @@ -16,37 +16,37 @@ Although there may not exists a rectangular grid that contains exactly `n` recta # --hints-- -`countingRectangles(18)` should return a number. +`countingRectangles(18)` має повернути число. ```js assert(typeof countingRectangles(18) === 'number'); ``` -`countingRectangles(18)` should return `6`. +`countingRectangles(18)` має повернути `6`. ```js assert.strictEqual(countingRectangles(18), 6); ``` -`countingRectangles(250)` should return `22`. +`countingRectangles(250)` має повернути `22`. ```js assert.strictEqual(countingRectangles(250), 22); ``` -`countingRectangles(50000)` should return `364`. +`countingRectangles(50000)` має повернути `364`. ```js assert.strictEqual(countingRectangles(50000), 364); ``` -`countingRectangles(1000000)` should return `1632`. +`countingRectangles(1000000)` має повернути `1632`. ```js assert.strictEqual(countingRectangles(1000000), 1632); ``` -`countingRectangles(2000000)` should return `2772`. +`countingRectangles(2000000)` має повернути `2772`. ```js assert.strictEqual(countingRectangles(2000000), 2772); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md index 39a860bd794..cdd877c39f5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-86-cuboid-route.md @@ -20,31 +20,31 @@ Find the least value of M such that the number of solutions first exceeds `n`. # --hints-- -`cuboidRoute(2000)` should return a number. +`cuboidRoute(2000)` має повернути число. ```js assert(typeof cuboidRoute(2000) === 'number'); ``` -`cuboidRoute(2000)` should return `100`. +`cuboidRoute(2000)` має повернути `100`. ```js assert.strictEqual(cuboidRoute(2000), 100); ``` -`cuboidRoute(25000)` should return `320`. +`cuboidRoute(25000)` має повернути `320`. ```js assert.strictEqual(cuboidRoute(25000), 320); ``` -`cuboidRoute(500000)` should return `1309`. +`cuboidRoute(500000)` має повернути `1309`. ```js assert.strictEqual(cuboidRoute(500000), 1309); ``` -`cuboidRoute(1000000)` should return `1818`. +`cuboidRoute(1000000)` має повернути `1818`. ```js assert.strictEqual(cuboidRoute(1000000), 1818); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md index a6c51eff68d..4a3fa8762dc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-87-prime-power-triples.md @@ -21,37 +21,37 @@ How many numbers below `n` can be expressed as the sum of a prime square, prime # --hints-- -`primePowerTriples(50)` should return a number. +`primePowerTriples(50)` має повернути число. ```js assert(typeof primePowerTriples(50) === 'number'); ``` -`primePowerTriples(50)` should return `4`. +`primePowerTriples(50)` має повернути `4`. ```js assert.strictEqual(primePowerTriples(50), 4); ``` -`primePowerTriples(10035)` should return `684`. +`primePowerTriples(10035)` має повернути `684`. ```js assert.strictEqual(primePowerTriples(10035), 684); ``` -`primePowerTriples(500000)` should return `18899`. +`primePowerTriples(500000)` має повернути `18899`. ```js assert.strictEqual(primePowerTriples(500000), 18899); ``` -`primePowerTriples(5000000)` should return `138932`. +`primePowerTriples(5000000)` має повернути `138932`. ```js assert.strictEqual(primePowerTriples(5000000), 138932); ``` -`primePowerTriples(50000000)` should return `1097343`. +`primePowerTriples(50000000)` має повернути `1097343`. ```js assert.strictEqual(primePowerTriples(50000000), 1097343); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md index 46779896396..02b6fde6de9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-88-product-sum-numbers.md @@ -30,37 +30,37 @@ What is the sum of all the minimal product-sum numbers for 2 ≤ `k` ≤ `limit` # --hints-- -`productSumNumbers(6)` should return a number. +`productSumNumbers(6)` має повернути число. ```js assert(typeof productSumNumbers(6) === 'number'); ``` -`productSumNumbers(6)` should return `30`. +`productSumNumbers(6)` має повернути `30`. ```js assert.strictEqual(productSumNumbers(6), 30); ``` -`productSumNumbers(12)` should return `61`. +`productSumNumbers(12)` має повернути `61`. ```js assert.strictEqual(productSumNumbers(12), 61); ``` -`productSumNumbers(300)` should return `12686`. +`productSumNumbers(300)` має повернути `12686`. ```js assert.strictEqual(productSumNumbers(300), 12686); ``` -`productSumNumbers(6000)` should return `2125990`. +`productSumNumbers(6000)` має повернути `2125990`. ```js assert.strictEqual(productSumNumbers(6000), 2125990); ``` -`productSumNumbers(12000)` should return `7587457`. +`productSumNumbers(12000)` має повернути `7587457`. ```js assert.strictEqual(productSumNumbers(12000), 7587457); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md index 52c03847a6b..7eeba67648e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-89-roman-numerals.md @@ -42,19 +42,19 @@ Find the number of characters saved by writing each of these in their minimal fo # --hints-- -`romanNumerals(testNumerals1)` should return a number. +`romanNumerals(testNumerals1)` має повернути число. ```js assert(typeof romanNumerals(_testNumerals1) === 'number'); ``` -`romanNumerals(testNumerals1)` should return `19`. +`romanNumerals(testNumerals1)` має повернути `19`. ```js assert.strictEqual(romanNumerals(_testNumerals1), 19); ``` -`romanNumerals(testNumerals2)` should return `743`. +`romanNumerals(testNumerals2)` має повернути `743`. ```js assert.strictEqual(romanNumerals(_testNumerals2), 743); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md index a853dd4415e..f6a10cf9deb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-9-special-pythagorean-triplet.md @@ -18,25 +18,25 @@ There exists exactly one Pythagorean triplet for which `a` + `b` + `c` = 1000. F # --hints-- -`specialPythagoreanTriplet(24)` should return a number. +`specialPythagoreanTriplet(24)` має повернути число. ```js assert(typeof specialPythagoreanTriplet(24) === 'number'); ``` -`specialPythagoreanTriplet(24)` should return 480. +`specialPythagoreanTriplet(24)` має повернути 480. ```js assert.strictEqual(specialPythagoreanTriplet(24), 480); ``` -`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000. +`specialPythagoreanTriplet(120)` має повернути 49920, 55080 або 60000. ```js assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120))); ``` -`specialPythagoreanTriplet(1000)` should return 31875000. +`specialPythagoreanTriplet(1000)` має повернути 31875000. ```js assert.strictEqual(specialPythagoreanTriplet(1000), 31875000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md index 3e1206b4c4f..aade0665727 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-90-cube-digit-pairs.md @@ -33,13 +33,13 @@ How many distinct arrangements of the two cubes allow for all of the square numb # --hints-- -`cubeDigitPairs()` should return a number. +`cubeDigitPairs()` має повернути число. ```js assert(typeof cubeDigitPairs() === 'number'); ``` -`cubeDigitPairs()` should return 1217. +`cubeDigitPairs()` має повернути 1217. ```js assert.strictEqual(cubeDigitPairs(), 1217); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-91-right-triangles-with-integer-coordinates.md index 7874cbab3fc..c36a3bb7a3d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-91-right-triangles-with-integer-coordinates.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-91-right-triangles-with-integer-coordinates.md @@ -20,31 +20,31 @@ Given that $0 ≤ x_1, y_1, x_2, y_2 ≤ limit$, how many right triangles can be # --hints-- -`rightTrianglesIntCoords(2)` should return a number. +`rightTrianglesIntCoords(2)` має повернути число. ```js assert(typeof rightTrianglesIntCoords(2) === 'number'); ``` -`rightTrianglesIntCoords(2)` should return `14`. +`rightTrianglesIntCoords(2)` має повернути `14`. ```js assert.strictEqual(rightTrianglesIntCoords(2), 14); ``` -`rightTrianglesIntCoords(10)` should return `448`. +`rightTrianglesIntCoords(10)` має повернути `448`. ```js assert.strictEqual(rightTrianglesIntCoords(10), 448); ``` -`rightTrianglesIntCoords(25)` should return `3207`. +`rightTrianglesIntCoords(25)` має повернути `3207`. ```js assert.strictEqual(rightTrianglesIntCoords(25), 3207); ``` -`rightTrianglesIntCoords(50)` should return `14234`. +`rightTrianglesIntCoords(50)` має повернути `14234`. ```js assert.strictEqual(rightTrianglesIntCoords(50), 14234); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md index c560f06847c..163d62f68bc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-92-square-digit-chains.md @@ -21,31 +21,31 @@ How many starting numbers below `limit` will arrive at 89? # --hints-- -`squareDigitChains(100)` should return a number. +`squareDigitChains(100)` має повернути число. ```js assert(typeof squareDigitChains(100) === 'number'); ``` -`squareDigitChains(100)` should return `80`. +`squareDigitChains(100)` має повернути `80`. ```js assert.strictEqual(squareDigitChains(100), 80); ``` -`squareDigitChains(1000)` should return `857`. +`squareDigitChains(1000)` має повернути `857`. ```js assert.strictEqual(squareDigitChains(1000), 857); ``` -`squareDigitChains(100000)` should return `85623`. +`squareDigitChains(100000)` має повернути `85623`. ```js assert.strictEqual(squareDigitChains(100000), 85623); ``` -`squareDigitChains(10000000)` should return `8581146`. +`squareDigitChains(10000000)` має повернути `8581146`. ```js assert.strictEqual(squareDigitChains(10000000), 8581146); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md index 5a8afb7d782..2e2e5f2593f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-93-arithmetic-expressions.md @@ -27,13 +27,13 @@ Find the set of four distinct digits, `a` < `b` < `c` < `d`, for which # --hints-- -`arithmeticExpressions()` should return a number. +`arithmeticExpressions()` має повернути число. ```js assert(typeof arithmeticExpressions() === 'number'); ``` -`arithmeticExpressions()` should return 1258. +`arithmeticExpressions()` має повернути 1258. ```js assert.strictEqual(arithmeticExpressions(), 1258); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-94-almost-equilateral-triangles.md index 4b3ab85e079..f6908ef0ae1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-94-almost-equilateral-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-94-almost-equilateral-triangles.md @@ -16,31 +16,31 @@ Find the sum of the perimeters of all almost equilateral triangles with integral # --hints-- -`almostEquilateralTriangles(50)` should return a number. +`almostEquilateralTriangles(50)` має повернути число. ```js assert(typeof almostEquilateralTriangles(50) === 'number'); ``` -`almostEquilateralTriangles(50)` should return `66`. +`almostEquilateralTriangles(50)` має повернути `66`. ```js assert.strictEqual(almostEquilateralTriangles(50), 66); ``` -`almostEquilateralTriangles(10000)` should return `3688`. +`almostEquilateralTriangles(10000)` має повернути `3688`. ```js assert.strictEqual(almostEquilateralTriangles(10000), 3688); ``` -`almostEquilateralTriangles(10000000)` should return `9973078`. +`almostEquilateralTriangles(10000000)` має повернути `9973078`. ```js assert.strictEqual(almostEquilateralTriangles(10000000), 9973078); ``` -`almostEquilateralTriangles(1000000000)` should return `518408346`. +`almostEquilateralTriangles(1000000000)` має повернути `518408346`. ```js assert.strictEqual(almostEquilateralTriangles(1000000000), 518408346); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md index fe2d422a206..d1e27b74501 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-95-amicable-chains.md @@ -22,31 +22,31 @@ Find the smallest member of the longest amicable chain with no element exceeding # --hints-- -`amicableChains(300)` should return a number. +`amicableChains(300)` має повернути число. ```js assert(typeof amicableChains(300) === 'number'); ``` -`amicableChains(300)` should return `220`. +`amicableChains(300)` має повернути `220`. ```js assert.strictEqual(amicableChains(300), 220); ``` -`amicableChains(15000)` should return `220`. +`amicableChains(15000)` має повернути `220`. ```js assert.strictEqual(amicableChains(15000), 220); ``` -`amicableChains(100000)` should return `12496`. +`amicableChains(100000)` має повернути `12496`. ```js assert.strictEqual(amicableChains(100000), 12496); ``` -`amicableChains(1000000)` should return `14316`. +`amicableChains(1000000)` має повернути `14316`. ```js assert.strictEqual(amicableChains(1000000), 14316); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md index 098fdb0d398..8fa4f0746df 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-96-su-doku.md @@ -108,19 +108,19 @@ By solving all puzzles in `puzzlesArr`, find the sum of the 3-digit numbers foun # --hints-- -`suDoku(testPuzzles1)` should return a number. +`suDoku(testPuzzles1)` має повернути число. ```js assert(typeof suDoku(_testPuzzles1) === 'number'); ``` -`suDoku(testPuzzles1)` should return `1190`. +`suDoku(testPuzzles1)` має повернути `1190`. ```js assert.strictEqual(suDoku(_testPuzzles1), 1190); ``` -`suDoku(testPuzzles2)` should return `24702`. +`suDoku(testPuzzles2)` має повернути `24702`. ```js assert.strictEqual(suDoku(_testPuzzles2), 24702); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md index cabdb3486c9..8837d2ffd9b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-97-large-non-mersenne-prime.md @@ -16,31 +16,31 @@ Find the last ten digits of that non-Mersenne prime in the form $multiplier × 2 # --hints-- -`largeNonMersennePrime(19, 6833086)` should return a string. +`largeNonMersennePrime(19, 6833086)` має повернути рядок. ```js assert(typeof largeNonMersennePrime(19, 6833086) === 'string'); ``` -`largeNonMersennePrime(19, 6833086)` should return the string `3637590017`. +`largeNonMersennePrime(19, 6833086)` має повернути рядок `3637590017`. ```js assert.strictEqual(largeNonMersennePrime(19, 6833086), '3637590017'); ``` -`largeNonMersennePrime(27, 7046834)` should return the string `0130771969`. +`largeNonMersennePrime(27, 7046834)` має повернути рядок `0130771969`. ```js assert.strictEqual(largeNonMersennePrime(27, 7046834), '0130771969'); ``` -`largeNonMersennePrime(6679881, 6679881)` should return the string `4455386113`. +`largeNonMersennePrime(6679881, 6679881)` має повернути рядок `4455386113`. ```js assert.strictEqual(largeNonMersennePrime(6679881, 6679881), '4455386113'); ``` -`largeNonMersennePrime(28433, 7830457)` should return the string `8739992577`. +`largeNonMersennePrime(28433, 7830457)` має повернути рядок `8739992577`. ```js assert.strictEqual(largeNonMersennePrime(28433, 7830457), '8739992577'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-98-anagramic-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-98-anagramic-squares.md index f54ab71dd62..6467d9d82e0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-98-anagramic-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-98-anagramic-squares.md @@ -18,25 +18,25 @@ What is the largest square number formed by any member of such a pair? # --hints-- -`anagramicSquares(['CARE', 'RACE'])` should return a number. +`anagramicSquares(['CARE', 'RACE'])` має повернути число. ```js assert(typeof anagramicSquares(['CARE', 'RACE']) === 'number'); ``` -`anagramicSquares(['CARE', 'RACE'])` should return `9216`. +`anagramicSquares(['CARE', 'RACE'])` має повернути `9216`. ```js assert.strictEqual(anagramicSquares(['CARE', 'RACE']), 9216); ``` -`anagramicSquares(testWords1)` should return `4761`. +`anagramicSquares(testWords1)` має повернути `4761`. ```js assert.strictEqual(anagramicSquares(_testWords1), 4761); ``` -`anagramicSquares(testWords2)` should return `18769`. +`anagramicSquares(testWords2)` має повернути `18769`. ```js assert.strictEqual(anagramicSquares(_testWords2), 18769); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md index af44a7d0bd7..18bd252c1c9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-1-to-100/problem-99-largest-exponential.md @@ -16,19 +16,19 @@ Using the 2D `baseExp` array of base/exponent pairs, determine pair with the gre # --hints-- -`largestExponential(testArray1)` should return an array. +`largestExponential(testArray1)` має повернути масив. ```js assert(Array.isArray(largestExponential(_testArray1))); ``` -`largestExponential(testArray1)` should return `[840237, 507276]`. +`largestExponential(testArray1)` має повернути `[840237, 507276]`. ```js assert.deepEqual(largestExponential(_testArray1), [840237, 507276]); ``` -`largestExponential(testArray2)` should return `[895447, 504922]`. +`largestExponential(testArray2)` має повернути `[895447, 504922]`. ```js assert.deepEqual(largestExponential(_testArray2), [895447, 504922]); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md index 803f95dc33e..e072df4ac18 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-101-optimum-polynomial.md @@ -32,7 +32,7 @@ Find the sum of FITs for the BOPs. # --hints-- -`optimumPolynomial()` should return `37076114526`. +`optimumPolynomial()` має повернути `37076114526`. ```js assert.strictEqual(optimumPolynomial(), 37076114526); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md index c90a827dda3..dd04c0b0ff8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-102-triangle-containment.md @@ -25,25 +25,25 @@ Using the `triangles` array containing coordinates of triangles, find the number # --hints-- -`triangleContainment(exampleTriangles)` should return a number. +`triangleContainment(exampleTriangles)` має повернути число. ```js assert(typeof triangleContainment(_exampleTriangles) === 'number'); ``` -`triangleContainment(exampleTriangles)` should return `1`. +`triangleContainment(exampleTriangles)` має повернути `1`. ```js assert.strictEqual(triangleContainment(_exampleTriangles), 1); ``` -`triangleContainment(testTriangles1)` should return `19`. +`triangleContainment(testTriangles1)` має повернути `19`. ```js assert.strictEqual(triangleContainment(_testTriangles1), 19); ``` -`triangleContainment(testTriangles2)` should return `228`. +`triangleContainment(testTriangles2)` має повернути `228`. ```js assert.strictEqual(triangleContainment(_testTriangles2), 228); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md index bf85eef1f76..8faa042a5b9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-103-special-subset-sums-optimum.md @@ -30,7 +30,7 @@ Given that A is an optimum special sum set for $n = 7$, find its set string. # --hints-- -`optimumSpecialSumSet()` should return the string `20313839404245`. +`optimumSpecialSumSet()` має повернути рядок `20313839404245`. ```js assert.strictEqual(optimumSpecialSumSet(), '20313839404245'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md index baa7dcbfdbd..e58c976d549 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-104-pandigital-fibonacci-ends.md @@ -18,7 +18,7 @@ Given that $F_k$ is the first Fibonacci number for which the first nine digits A # --hints-- -`pandigitalFibonacciEnds()` should return `329468`. +`pandigitalFibonacciEnds()` має повернути `329468`. ```js assert.strictEqual(pandigitalFibonacciEnds(), 329468); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md index 1636463728d..b2204c5bea5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-105-special-subset-sums-testing.md @@ -21,7 +21,7 @@ Using `sets`, an array with one-hundred sets, containing seven to twelve element # --hints-- -`testingSpecialSubsetSums(testSets)` should return `73702`. +`testingSpecialSubsetSums(testSets)` має повернути `73702`. ```js assert.strictEqual(testingSpecialSubsetSums(_testSets), 73702); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md index 67638b56e90..b5ddad2cb6e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-106-special-subset-sums-meta-testing.md @@ -23,7 +23,7 @@ For n = 12, how many of the 261625 subset pairs that can be obtained need to be # --hints-- -`subsetSumsMetaTesting()` should return `21384`. +`subsetSumsMetaTesting()` має повернути `21384`. ```js assert.strictEqual(subsetSumsMetaTesting(), 21384); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md index 3b69363096d..82963384523 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-107-minimal-network.md @@ -33,7 +33,7 @@ Using `network`, an 2D array representing network in matrix form, find the maxim # --hints-- -`minimalNetwork(testNetwork)` should return `259679`. +`minimalNetwork(testNetwork)` має повернути `259679`. ```js assert.strictEqual(minimalNetwork(_testNetwork), 259679); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md index 56fbe532238..e63e8ffe306 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-108-diophantine-reciprocals-i.md @@ -22,7 +22,7 @@ What is the least value of `n` for which the number of distinct solutions exceed # --hints-- -`diophantineOne()` should return `180180`. +`diophantineOne()` має повернути `180180`. ```js assert.strictEqual(diophantineOne(), 180180); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md index 5064f7e146c..f79cbb08db0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-109-darts.md @@ -31,7 +31,7 @@ Note that D1 D2 is considered different from D2 D1 as they finish on different d # --hints-- -`darts()` should return `38182`. +`darts()` має повернути `38182`. ```js assert.strictEqual(darts(), 38182); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md index 9bbeb3dd075..b8bfa809c71 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-110-diophantine-reciprocals-ii.md @@ -20,7 +20,7 @@ What is the least value of `n` for which the number of distinct solutions exceed # --hints-- -`diophantineTwo()` should return `9350130049860600`. +`diophantineTwo()` має повернути `9350130049860600`. ```js assert.strictEqual(diophantineTwo(), 9350130049860600); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md index 7f22fbffb6c..dfb227da5ce 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-111-primes-with-runs.md @@ -35,7 +35,7 @@ For d = 0 to 9, the sum of all $S(4, d)$ is 273700. Find the sum of all $S(10, d # --hints-- -`primesWithRuns()` should return `612407567715`. +`primesWithRuns()` має повернути `612407567715`. ```js assert.strictEqual(primesWithRuns(), 612407567715); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md index 7599de29978..156d0c46cf0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-112-bouncy-numbers.md @@ -22,7 +22,7 @@ Find the least number for which the proportion of bouncy numbers is exactly 99%. # --hints-- -`bouncyNumbers()` should return `1587000`. +`bouncyNumbers()` має повернути `1587000`. ```js assert.strictEqual(bouncyNumbers(), 1587000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md index 868909ef6b2..31414e3e9d9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-113-non-bouncy-numbers.md @@ -20,7 +20,7 @@ How many numbers below a googol (${10}^{100}$) are not bouncy? # --hints-- -`nonBouncyNumbers()` should return `51161058134250`. +`nonBouncyNumbers()` має повернути `51161058134250`. ```js assert.strictEqual(nonBouncyNumbers(), 51161058134250); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md index 3e1b2f85927..fdac05da125 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-114-counting-block-combinations-i.md @@ -18,7 +18,7 @@ How many ways can a row measuring fifty units in length be filled? # --hints-- -`countingBlockOne()` should return `16475640049`. +`countingBlockOne()` має повернути `16475640049`. ```js assert.strictEqual(countingBlockOne(), 16475640049); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md index a659ea34ad1..260c70a9b85 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-115-counting-block-combinations-ii.md @@ -24,7 +24,7 @@ For m = 50, find the least value of `n` for which the fill-count function first # --hints-- -`countingBlockTwo()` should return `168`. +`countingBlockTwo()` має повернути `168`. ```js assert.strictEqual(countingBlockTwo(), 168); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md index b0b1969a3df..5951ae1c9f1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-116-red-green-or-blue-tiles.md @@ -28,7 +28,7 @@ Assuming that colors cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing # --hints-- -`redGreenBlueOne()` should return `20492570929`. +`redGreenBlueOne()` має повернути `20492570929`. ```js assert.strictEqual(redGreenBlueOne(), 20492570929); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md index 4a4873aac95..6f52d98a95d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-117-red-green-and-blue-tiles.md @@ -18,7 +18,7 @@ How many ways can a row measuring fifty units in length be tiled? # --hints-- -`redGreenBlueTilesTwo()` should return `100808458960497`. +`redGreenBlueTilesTwo()` має повернути `100808458960497`. ```js assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md index 195d39136ed..45f0d2c3b4b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-118-pandigital-prime-sets.md @@ -14,7 +14,7 @@ How many distinct sets containing each of the digits one through nine exactly on # --hints-- -`pandigitalPrimeSets()` should return `44680`. +`pandigitalPrimeSets()` має повернути `44680`. ```js assert.strictEqual(pandigitalPrimeSets(), 44680); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md index 87bf836b33a..17bb0a8785d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-119-digit-power-sum.md @@ -18,7 +18,7 @@ Find $a_{30}$. # --hints-- -`digitPowerSum()` should return `248155780267521`. +`digitPowerSum()` має повернути `248155780267521`. ```js assert.strictEqual(digitPowerSum(), 248155780267521); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md index d42c224e3db..015f493243d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-120-square-remainders.md @@ -16,7 +16,7 @@ For $3 ≤ a ≤ 1000$, find $\sum{r}_{max}$. # --hints-- -`squareRemainders()` should return `333082500`. +`squareRemainders()` має повернути `333082500`. ```js assert.strictEqual(squareRemainders(), 333082500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md index 0f23b7fdd50..70647887d34 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-121-disc-game-prize-fund.md @@ -18,7 +18,7 @@ Find the maximum prize fund that should be allocated to a single game in which f # --hints-- -`discGamePrize()` should return `2269`. +`discGamePrize()` має повернути `2269`. ```js assert.strictEqual(discGamePrize(), 2269); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md index 78c29aa7952..c5c4269968f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-122-efficient-exponentiation.md @@ -31,7 +31,7 @@ For $1 ≤ k ≤ 200$, find $\sum{m(k)}$. # --hints-- -`efficientExponentation()` should return `1582`. +`efficientExponentation()` має повернути `1582`. ```js assert.strictEqual(efficientExponentation(), 1582); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md index 743089b64e3..3ec2475377c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-123-prime-square-remainders.md @@ -18,7 +18,7 @@ Find the least value of $n$ for which the remainder first exceeds $10^{10}$. # --hints-- -`primeSquareRemainders()` should return `21035`. +`primeSquareRemainders()` має повернути `21035`. ```js assert.strictEqual(primeSquareRemainders(), 21035); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md index 899171a9731..69eb7a9c31c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-124-ordered-radicals.md @@ -116,7 +116,7 @@ Let $E(k)$ be the $k$th element in the sorted $n$ column; for example, $E(4) = 8 # --hints-- -`orderedRadicals()` should return `21417`. +`orderedRadicals()` має повернути `21417`. ```js assert.strictEqual(orderedRadicals(), 21417); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md index eb499c13931..81cb77c31d5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-125-palindromic-sums.md @@ -15,7 +15,7 @@ There are exactly eleven palindromes below one-thousand that can be written as c Find the sum of all the numbers less than the `limit` that are both palindromic and can be written as the sum of consecutive squares. # --hints-- -`palindromicSums(100000000)` should return `2906969179`. +`palindromicSums(100000000)` має повернути `2906969179`. ```js @@ -23,13 +23,13 @@ assert.strictEqual(palindromicSums(100000000), 2906969179); ``` -`palindromicSums(100)` should return `137`. +`palindromicSums(100)` має повернути `137`. ```js assert.strictEqual(palindromicSums(100), 137); ``` -`palindromicSums(1000)` should return `4164`. +`palindromicSums(1000)` має повернути `4164`. ```js assert.strictEqual(palindromicSums(1000),4164); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md index d089c18aff0..b412823e951 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-126-cuboid-layers.md @@ -24,7 +24,7 @@ Find the least value of $n$ for which $C(n) = 1000$. # --hints-- -`cuboidLayers()` should return `18522`. +`cuboidLayers()` має повернути `18522`. ```js assert.strictEqual(cuboidLayers(), 18522); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md index 2f7f927858e..468e8f201a1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-127-abc-hits.md @@ -30,7 +30,7 @@ Find $\sum{c}$ for $c < 120000$. # --hints-- -`abcHits()` should return `18407904`. +`abcHits()` має повернути `18407904`. ```js assert.strictEqual(abcHits(), 18407904); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md index 49d59948762..0dbd8c86c69 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-128-hexagonal-tile-differences.md @@ -28,13 +28,13 @@ Find the 2000th tile in this sequence. # --hints-- -`hexagonalTile(10)` should return `271`. +`hexagonalTile(10)` має повернути `271`. ```js assert.strictEqual(hexagonalTile(10), 271); ``` -`hexagonalTile(2000)` should return `14516824220`. +`hexagonalTile(2000)` має повернути `14516824220`. ```js assert.strictEqual(hexagonalTile(2000), 14516824220); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md index e7f423f96d5..237352a4c67 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-129-repunit-divisibility.md @@ -18,7 +18,7 @@ Find the least value of $n$ for which $A(n)$ first exceeds one-million. # --hints-- -`repunitDivisibility()` should return `1000023`. +`repunitDivisibility()` має повернути `1000023`. ```js assert.strictEqual(repunitDivisibility(), 1000023); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md index 48f7149e5a6..fd8df202500 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-130-composites-with-prime-repunit-property.md @@ -20,7 +20,7 @@ Find the sum of the first twenty-five composite values of $n$ for which $GCD(n, # --hints-- -`compositeRepunit()` should return `149253`. +`compositeRepunit()` має повернути `149253`. ```js assert.strictEqual(compositeRepunit(), 149253); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-131-prime-cube-partnership.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-131-prime-cube-partnership.md index 73e7e8e7490..2606fced987 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-131-prime-cube-partnership.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-131-prime-cube-partnership.md @@ -18,7 +18,7 @@ How many primes below one million have this remarkable property? # --hints-- -`primeCubePartnership()` should return `173`. +`primeCubePartnership()` має повернути `173`. ```js assert.strictEqual(primeCubePartnership(), 173); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md index 5ca7c0760fd..d6cecc16a4e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-132-large-repunit-factors.md @@ -16,7 +16,7 @@ Find the sum of the first forty prime factors of $R({10}^9)$. # --hints-- -`largeRepunitFactors()` should return `843296`. +`largeRepunitFactors()` має повернути `843296`. ```js assert.strictEqual(largeRepunitFactors(), 843296); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md index ee861a14420..aeba348a27a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-133-repunit-nonfactors.md @@ -18,7 +18,7 @@ Find the sum of all the primes below one-hundred thousand that will never be a f # --hints-- -`repunitNonfactors()` should return `453647705`. +`repunitNonfactors()` має повернути `453647705`. ```js assert.strictEqual(repunitNonfactors(), 453647705); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md index d6629ef1579..c01f7dd004f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-134-prime-pair-connection.md @@ -16,7 +16,7 @@ Find $\sum{S}$ for every pair of consecutive primes with $5 ≤ p_1 ≤ 1000000$ # --hints-- -`primePairConnection()` should return `18613426663617120`. +`primePairConnection()` має повернути `18613426663617120`. ```js assert.strictEqual(primePairConnection(), 18613426663617120); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md index 3045467d61e..18c233af8cd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-135-same-differences.md @@ -18,7 +18,7 @@ How many values of $n$ less than one million have exactly ten distinct solutions # --hints-- -`sameDifferences()` should return `4989`. +`sameDifferences()` має повернути `4989`. ```js assert.strictEqual(sameDifferences(), 4989); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md index d73ff59f63b..f532975cebe 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-136-singleton-difference.md @@ -18,7 +18,7 @@ How many values of $n$ less than fifty million have exactly one solution? # --hints-- -`singletonDifference()` should return `2544559`. +`singletonDifference()` має повернути `2544559`. ```js assert.strictEqual(singletonDifference(), 2544559); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md index b700dba62d0..3ad96bdb148 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-137-fibonacci-golden-nuggets.md @@ -33,7 +33,7 @@ Find the 15th golden nugget. # --hints-- -`goldenNugget()` should return `1120149658760`. +`goldenNugget()` має повернути `1120149658760`. ```js assert.strictEqual(goldenNugget(), 1120149658760); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md index 6391b7523c4..f6f7dac4cb7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-138-special-isosceles-triangles.md @@ -20,7 +20,7 @@ Find $\sum{L}$ for the twelve smallest isosceles triangles for which $h = b ± 1 # --hints-- -`isoscelesTriangles()` should return `1118049290473932`. +`isoscelesTriangles()` має повернути `1118049290473932`. ```js assert.strictEqual(isoscelesTriangles(), 1118049290473932); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md index 19f12579cb2..edd06ade2cb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-139-pythagorean-tiles.md @@ -20,7 +20,7 @@ Given that the perimeter of the right triangle is less than one-hundred million, # --hints-- -`pythagoreanTiles()` should return `10057761`. +`pythagoreanTiles()` має повернути `10057761`. ```js assert.strictEqual(pythagoreanTiles(), 10057761); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md index bdd6612a63c..13a9550a7d5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-140-modified-fibonacci-golden-nuggets.md @@ -26,7 +26,7 @@ We shall call $A_G(x)$ a golden nugget if $x$ is rational because they become in # --hints-- -`modifiedGoldenNuggets()` should return `5673835352990` +`modifiedGoldenNuggets()` має повернути `5673835352990` ```js assert.strictEqual(modifiedGoldenNuggets(), 5673835352990); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md index 9f1e9d3bb45..ffb76b9d42e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-141-investigating-progressive-numbers-n-which-are-also-square.md @@ -20,7 +20,7 @@ Find the sum of all progressive perfect squares below one trillion (${10}^{12}$) # --hints-- -`progressivePerfectSquares()` should return `878454337159`. +`progressivePerfectSquares()` має повернути `878454337159`. ```js assert.strictEqual(progressivePerfectSquares(), 878454337159); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md index 17a07958833..1632c3daa09 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-142-perfect-square-collection.md @@ -12,7 +12,7 @@ Find the smallest $x + y + z$ with integers $x > y > z > 0$ such that $x + y$, $ # --hints-- -`perfectSquareCollection()` should return `1006193`. +`perfectSquareCollection()` має повернути `1006193`. ```js assert.strictEqual(perfectSquareCollection(), 1006193); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md index 8051dd4317d..e5f3d1a12f1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-143-investigating-the-torricelli-point-of-a-triangle.md @@ -20,7 +20,7 @@ If the sum is minimised and a, b, c, p, q and r are all positive integers we sha # --hints-- -`sumTorricelliTriangles()` should return `30758397`. +`sumTorricelliTriangles()` має повернути `30758397`. ```js assert.strictEqual(sumTorricelliTriangles(), 30758397); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-144-investigating-multiple-reflections-of-a-laser-beam.md index 935df9d895d..8e0ed2a6f16 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-144-investigating-multiple-reflections-of-a-laser-beam.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-144-investigating-multiple-reflections-of-a-laser-beam.md @@ -35,7 +35,7 @@ How many times does the beam hit the internal surface of the white cell before e # --hints-- -`laserBeamReflections()` should return `354`. +`laserBeamReflections()` має повернути `354`. ```js assert.strictEqual(laserBeamReflections(), 354); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md index f30799446b2..14f9a273857 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md @@ -16,7 +16,7 @@ How many reversible numbers are there below one-billion (${10}^9$)? # --hints-- -`reversibleNumbers()` should return `608720`. +`reversibleNumbers()` має повернути `608720`. ```js assert.strictEqual(reversibleNumbers(), 608720); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md index 6407520a81a..5a3c79b3f9a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-146-investigating-a-prime-pattern.md @@ -14,7 +14,7 @@ What is the sum of all such integers $n$ below 150 million? # --hints-- -`primePattern()` should return `676333270`. +`primePattern()` має повернути `676333270`. ```js assert.strictEqual(primePattern(), 676333270); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md index dfade844910..a4a8055cdf8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-147-rectangles-in-cross-hatched-grids.md @@ -22,7 +22,7 @@ How many different rectangles could be situated within 47x43 and smaller grids? # --hints-- -`crossHatchedRectangles()` should return `846910284`. +`crossHatchedRectangles()` має повернути `846910284`. ```js assert.strictEqual(crossHatchedRectangles(), 846910284); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md index d30e62b5442..c7cccafb883 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-148-exploring-pascals-triangle.md @@ -28,7 +28,7 @@ Find the number of entries which are not divisible by 7 in the first one billion # --hints-- -`entriesOfPascalsTriangle()` should return `2129970655314432`. +`entriesOfPascalsTriangle()` має повернути `2129970655314432`. ```js assert.strictEqual(entriesOfPascalsTriangle(), 2129970655314432); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md index c1fbd34962d..091d112eeef 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-149-searching-for-a-maximum-sum-subsequence.md @@ -28,7 +28,7 @@ Finally, find the greatest sum of (any number of) adjacent entries in any direct # --hints-- -`maximumSubSequence()` should return `52852124`. +`maximumSubSequence()` має повернути `52852124`. ```js assert.strictEqual(maximumSubSequence(), 52852124); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md index 366d5dd9bd0..f308848782b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md @@ -37,7 +37,7 @@ Find the smallest possible sub-triangle sum. # --hints-- -`smallestSubTriangleSum()` should return `-271248680`. +`smallestSubTriangleSum()` має повернути `-271248680`. ```js assert.strictEqual(smallestSubTriangleSum(), -271248680); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md index 47f785ed97b..4787033776e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md @@ -26,7 +26,7 @@ Give your answer rounded to six decimal places using the format `x.xxxxxx`. # --hints-- -`expectedValueProblem()` should return `0.464399`. +`expectedValueProblem()` має повернути `0.464399`. ```js assert.strictEqual(expectedValueProblem(), 0.464399); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md index c03197b781f..18f60746ee5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md @@ -20,7 +20,7 @@ How many ways are there to write the number $\frac{1}{2}$ as a sum of inverse sq # --hints-- -`sumInverseSquares()` should return `301`. +`sumInverseSquares()` має повернути `301`. ```js assert.strictEqual(sumInverseSquares(), 301); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md index a66c05c4f97..87e06e62fcf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-153-investigating-gaussian-integers.md @@ -58,7 +58,7 @@ What is $\displaystyle\sum_{n=1}^{{10}^8} s(n)$? # --hints-- -`sumGaussianIntegers()` should return `17971254122360636`. +`sumGaussianIntegers()` має повернути `17971254122360636`. ```js assert.strictEqual(sumGaussianIntegers(), 17971254122360636); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md index 40533ba38f8..3e2c9a4da5d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-154-exploring-pascals-pyramid.md @@ -20,7 +20,7 @@ How many coefficients in the expansion of ${(x + y + z)}^{200000}$ are multiples # --hints-- -`pascalsPyramid()` should return `479742450`. +`pascalsPyramid()` має повернути `479742450`. ```js assert.strictEqual(pascalsPyramid(), 479742450); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md index ee1b1f97d9b..b42c6920d26 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-155-counting-capacitor-circuits.md @@ -24,7 +24,7 @@ Reminder: When connecting capacitors $C_1$, $C_2$ etc in parallel, the total cap # --hints-- -`capacitanceValues()` should return `3857447`. +`capacitanceValues()` має повернути `3857447`. ```js assert.strictEqual(capacitanceValues(), 3857447); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md index fb820e64aa0..15af61132cb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-156-counting-digits.md @@ -42,7 +42,7 @@ Note: if, for some $n$, $f(n, d) = n$ for more than one value of $d$ this value # --hints-- -`countingDigits()` should return `21295121502550`. +`countingDigits()` має повернути `21295121502550`. ```js assert.strictEqual(countingDigits(), 21295121502550); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md index aa5e8185547..637c9ccf1a6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-157-solving-the-diophantine-equation.md @@ -21,7 +21,7 @@ How many solutions has this equation for $1 ≤ n ≤ 9$? # --hints-- -`diophantineEquation()` should return `53490`. +`diophantineEquation()` має повернути `53490`. ```js assert.strictEqual(diophantineEquation(), 53490); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md index 845e2be3303..7ab0ea82213 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md @@ -28,7 +28,7 @@ What is the maximum value of $p(n)$? # --hints-- -`lexicographicNeighbours()` should return `409511334375`. +`lexicographicNeighbours()` має повернути `409511334375`. ```js assert.strictEqual(lexicographicNeighbours(), 409511334375); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md index ceec9db70d3..cadbe5c458c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-160-factorial-trailing-digits.md @@ -19,7 +19,7 @@ Find $f(1,000,000,000,000)$ # --hints-- -`factorialTrailingDigits()` should return `16576`. +`factorialTrailingDigits()` має повернути `16576`. ```js assert.strictEqual(factorialTrailingDigits(), 16576); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md index 8e0a070c788..f3cc85747fe 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-161-triominoes.md @@ -26,7 +26,7 @@ In how many ways can a 9 by 12 grid be tiled in this way by triominoes? # --hints-- -`triominoes()` should return `20574308184277972`. +`triominoes()` має повернути `20574308184277972`. ```js assert.strictEqual(triominoes(), 20574308184277972); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md index 9ad940349fe..362648d564d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-162-hexadecimal-numbers.md @@ -26,13 +26,13 @@ Give your answer with hexadecimal number as a string. # --hints-- -`hexadecimalNumbers()` should return a string. +`hexadecimalNumbers()` має повернути рядок. ```js assert(typeof hexadecimalNumbers() === 'string'); ``` -`hexadecimalNumbers()` should return the string `3D58725572C62302`. +`hexadecimalNumbers()` має повернути рядок `3D58725572C62302`. ```js assert.strictEqual(hexadecimalNumbers(), '3D58725572C62302'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-163-cross-hatched-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-163-cross-hatched-triangles.md index e5fa50fb8e9..0ff53dab675 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-163-cross-hatched-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-163-cross-hatched-triangles.md @@ -25,7 +25,7 @@ Find $T(36)$. # --hints-- -`crossHatchedTriangles()` should return `343047`. +`crossHatchedTriangles()` має повернути `343047`. ```js assert.strictEqual(crossHatchedTriangles(), 343047); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md index 83215f99ba4..8b0d4ab3244 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md @@ -14,7 +14,7 @@ How many 20 digit numbers $n$ (without any leading zero) exist such that no thre # --hints-- -`consecutiveDigitsSum()` should return `378158756814587`. +`consecutiveDigitsSum()` має повернути `378158756814587`. ```js assert.strictEqual(consecutiveDigitsSum(), 378158756814587); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md index 04fef3d3e53..2570b39f270 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-165-intersections.md @@ -38,7 +38,7 @@ How many distinct true intersection points are found among the 5000 line segment # --hints-- -`distinctIntersections()` should return `2868868`. +`distinctIntersections()` має повернути `2868868`. ```js assert.strictEqual(distinctIntersections(), 2868868); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md index f413a225835..b72d1b9e8c5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-166-criss-cross.md @@ -22,7 +22,7 @@ In how many ways can you fill a 4x4 grid with the digits $d$, $0 ≤ d ≤ 9$ so # --hints-- -`crissCross()` should return `7130034`. +`crissCross()` має повернути `7130034`. ```js assert.strictEqual(crissCross(), 7130034); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md index 37f3fd53c28..c9b00aed773 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-167-investigating-ulam-sequences.md @@ -20,7 +20,7 @@ Find $\sum {U(2, 2n + 1)_k}$ for $2 ≤ n ≤ 10$, where $k = {10}^{11}$. # --hints-- -`ulamSequences()` should return `3916160068885`. +`ulamSequences()` має повернути `3916160068885`. ```js assert.strictEqual(ulamSequences(), 3916160068885); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md index 50802415375..0003b5f9a7d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-168-number-rotations.md @@ -18,13 +18,13 @@ For integer number of digits $a$ and $b$, find the last 5 digits of the sum of a # --hints-- -`numberRotations(2, 10)` should return `98311`. +`numberRotations(2, 10)` має повернути `98311`. ```js assert.strictEqual(numberRotations(2, 10), 98311); ``` -`numberRotations(2, 100)` should return `59206`. +`numberRotations(2, 100)` має повернути `59206`. ```js assert.strictEqual(numberRotations(2, 100), 59206); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md index 52005157a98..58f578d28c6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md @@ -22,7 +22,7 @@ What is $f({10}^{25})$? # --hints-- -`numberOfWaysToExpress()` should return `178653872807`. +`numberOfWaysToExpress()` має повернути `178653872807`. ```js assert.strictEqual(numberOfWaysToExpress(), 178653872807); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md index b6886e18764..c78f5fac241 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md @@ -23,7 +23,7 @@ What is the largest 0 to 9 pandigital 10-digit concatenated product of an intege # --hints-- -`largestPandigital()` should return `9857164023`. +`largestPandigital()` має повернути `9857164023`. ```js assert.strictEqual(largestPandigital(), 9857164023); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md index 60133bf2e51..0abd23b1040 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md @@ -20,7 +20,7 @@ Find the last nine digits of the sum of all $n$, $0 < n < {10}^{20}$, such # --hints-- -`lastDigitsSumOfPerfectSquare()` should return `142989277`. +`lastDigitsSumOfPerfectSquare()` має повернути `142989277`. ```js assert.strictEqual(lastDigitsSumOfPerfectSquare(), 142989277); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-172-investigating-numbers-with-few-repeated-digits.md index cfc75b9ff19..000cbb3c21a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-172-investigating-numbers-with-few-repeated-digits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-172-investigating-numbers-with-few-repeated-digits.md @@ -12,7 +12,7 @@ How many 18-digit numbers $n$ (without leading zeros) are there such that no dig # --hints-- -`numbersWithRepeatedDigits()` should return `227485267000992000`. +`numbersWithRepeatedDigits()` має повернути `227485267000992000`. ```js assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md index 0488d662943..a3c55b38ed6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md @@ -18,7 +18,7 @@ With one-hundred tiles, and not necessarily using all of the tiles at one time, # --hints-- -`differentHollowSquareLaminae()` should return `1572729`. +`differentHollowSquareLaminae()` має повернути `1572729`. ```js assert.strictEqual(differentHollowSquareLaminae(), 1572729); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md index 48843b6b0a9..2b5fe12d1bd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md @@ -24,7 +24,7 @@ What is $\sum N(n)$ for $1 ≤ n ≤ 10$? # --hints-- -`hollowSquareLaminaeDistinctArrangements()` should return `209566`. +`hollowSquareLaminaeDistinctArrangements()` має повернути `209566`. ```js assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md index b3419c34823..a6a2888eb3c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md @@ -30,13 +30,13 @@ Give your answer as a string with comma separated integers, without any whitespa # --hints-- -`shortenedBinaryExpansionOfNumber()` should return a string. +`shortenedBinaryExpansionOfNumber()` має повернути рядок. ```js assert(typeof shortenedBinaryExpansionOfNumber() === 'string'); ``` -`shortenedBinaryExpansionOfNumber()` should return the string `1,13717420,8`. +`shortenedBinaryExpansionOfNumber()` має повернути рядок `1,13717420,8`. ```js assert.strictEqual(shortenedBinaryExpansionOfNumber(), '1,13717420,8'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-176-right-angled-triangles-that-share-a-cathetus.md index 01056496296..fda88cc67a3 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-176-right-angled-triangles-that-share-a-cathetus.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-176-right-angled-triangles-that-share-a-cathetus.md @@ -14,7 +14,7 @@ Find the smallest integer that can be the length of a cathetus of exactly 47547 # --hints-- -`trianglesSharingCathetus()` should return `96818198400000`. +`trianglesSharingCathetus()` має повернути `96818198400000`. ```js assert.strictEqual(trianglesSharingCathetus(), 96818198400000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md index c6f7b8ee5c4..1534c15ddd1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-177-integer-angled-quadrilaterals.md @@ -22,7 +22,7 @@ What is the total number of non-similar integer angled quadrilaterals? # --hints-- -`integerAngledQuadrilaterals()` should return `129325`. +`integerAngledQuadrilaterals()` має повернути `129325`. ```js assert.strictEqual(integerAngledQuadrilaterals(), 129325); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md index 22f44139de6..75af7cbd49b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-178-step-numbers.md @@ -20,7 +20,7 @@ How many pandigital step numbers less than ${10}^{40}$ are there? # --hints-- -`stepNumbers()` should return `126461847755`. +`stepNumbers()` має повернути `126461847755`. ```js assert.strictEqual(stepNumbers(), 126461847755); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md index a159a7af8f6..bc2c0e7e66f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-179-consecutive-positive-divisors.md @@ -12,7 +12,7 @@ Find the number of integers $1 < n < {10}^7$, for which $n$ and $n + 1$ ha # --hints-- -`consecutivePositiveDivisors()` should return `986262`. +`consecutivePositiveDivisors()` має повернути `986262`. ```js assert.strictEqual(consecutivePositiveDivisors(), 986262); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-180-rational-zeros-of-a-function-of-three-variables.md index 9eed96d38b2..d5772fc8323 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-180-rational-zeros-of-a-function-of-three-variables.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-180-rational-zeros-of-a-function-of-three-variables.md @@ -27,7 +27,7 @@ Find $u + v$. # --hints-- -`rationalZeros()` should return `285196020571078980`. +`rationalZeros()` має повернути `285196020571078980`. ```js assert.strictEqual(rationalZeros(), 285196020571078980); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md index f98d3a71b9e..6ccbf694678 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md @@ -18,7 +18,7 @@ In how many ways can sixty black objects $B$ and forty white objects $W$ be thus # --hints-- -`colorsGrouping()` should return `83735848679360670`. +`colorsGrouping()` має повернути `83735848679360670`. ```js assert.strictEqual(colorsGrouping(), 83735848679360670); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md index e971434b3e7..0790b029692 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-182-rsa-encryption.md @@ -30,25 +30,25 @@ For any given `p` and `q`, find the sum of all values of `e`, `1 < e < φ(p,q)` assert(typeof RSAEncryption === 'function') ``` -`RSAEncryption` should return a number. +`RSAEncryption` має повернути число. ```js assert.strictEqual(typeof RSAEncryption(19, 37), 'number'); ``` -`RSAEncryption(19, 37)` should return `17766`. +`RSAEncryption(19, 37)` має повернути `17766`. ```js assert.strictEqual(RSAEncryption(19, 37), 17766); ``` -`RSAEncryption(283, 409)` should return `466196580`. +`RSAEncryption(283, 409)` має повернути `466196580`. ```js assert.strictEqual(RSAEncryption(283, 409), 466196580); ``` -`RSAEncryption(1009, 3643)` should return `399788195976`. +`RSAEncryption(1009, 3643)` має повернути `399788195976`. ```js assert.strictEqual(RSAEncryption(19, 37), 17766); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md index 7586be421e3..2cf7dd4558e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-183-maximum-product-of-parts.md @@ -28,7 +28,7 @@ Find $\sum D(N)$ for $5 ≤ N ≤ 10000$. # --hints-- -`maximumProductOfParts()` should return `48861552`. +`maximumProductOfParts()` має повернути `48861552`. ```js assert.strictEqual(maximumProductOfParts(), 48861552); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md index 8d3eb0bfc9d..fdc29d5fc2b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-184-triangles-containing-the-origin.md @@ -20,7 +20,7 @@ How many triangles are there containing the origin in the interior and having al # --hints-- -`trianglesContainingOrigin()` should return `1725323624056`. +`trianglesContainingOrigin()` має повернути `1725323624056`. ```js assert.strictEqual(trianglesContainingOrigin(), 1725323624056); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md index 820f0832166..10c7ce29d85 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-185-number-mind.md @@ -40,7 +40,7 @@ Find the unique 16-digit secret sequence. # --hints-- -`numberMind()` should return `4640261571849533`. +`numberMind()` має повернути `4640261571849533`. ```js assert.strictEqual(numberMind(), 4640261571849533); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md index 8d1fed78cdf..c18ff3c3c87 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-186-connectedness-of-a-network.md @@ -31,7 +31,7 @@ The Prime Minister's phone number is 524287. After how many successful calls, no # --hints-- -`connectednessOfANetwork()` should return `2325629`. +`connectednessOfANetwork()` має повернути `2325629`. ```js assert.strictEqual(connectednessOfANetwork(), 2325629); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md index bcd6f324753..36849a5124d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-187-semiprimes.md @@ -16,7 +16,7 @@ How many composite integers, $n < {10}^8$, have precisely two, not necessaril # --hints-- -`semiPrimes()` should return `17427258`. +`semiPrimes()` має повернути `17427258`. ```js assert.strictEqual(euler187(), 17427258); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md index 1e0ae1dc9fa..6d29da96c30 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-188-the-hyperexponentiation-of-a-number.md @@ -18,7 +18,7 @@ Thus we have e.g. $3↑↑2 = 3^3 = 27$, hence $3↑↑3 = 3^{27} = 762559748498 # --hints-- -`hyperexponentation()` should return `95962097`. +`hyperexponentation()` має повернути `95962097`. ```js assert.strictEqual(hyperexponentation(), 95962097); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md index 6ac8cedcec5..e4d355fbf3a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-189-tri-colouring-a-triangular-grid.md @@ -24,7 +24,7 @@ How many distinct valid colourings are there for the above configuration? # --hints-- -`triangularGridColoring()` should return `10834893628237824`. +`triangularGridColoring()` має повернути `10834893628237824`. ```js assert.strictEqual(triangularGridColoring(), 10834893628237824); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md index 806332925e0..a964228c699 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-190-maximising-a-weighted-product.md @@ -16,7 +16,7 @@ Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$. # --hints-- -`maximisingWeightedProduct()` should return `371048281`. +`maximisingWeightedProduct()` має повернути `371048281`. ```js assert.strictEqual(maximisingWeightedProduct(), 371048281); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md index 8e4e35e5736..6c110c1a7f0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-191-prize-strings.md @@ -26,7 +26,7 @@ How many "prize" strings exist over a 30-day period? # --hints-- -`prizeStrings()` should return `1918080160`. +`prizeStrings()` має повернути `1918080160`. ```js assert.strictEqual(prizeStrings(), 1918080160); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md index 61889d4d47b..9dfcf2f8728 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-192-best-approximations.md @@ -20,7 +20,7 @@ Find the sum of all denominators of the best approximations to $\sqrt{n}$ for th # --hints-- -`bestApproximations()` should return `57060635927998344`. +`bestApproximations()` має повернути `57060635927998344`. ```js assert.strictEqual(bestApproximations(), 57060635927998344); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-193-squarefree-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-193-squarefree-numbers.md index 7e17fd27c15..53c84b39ecf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-193-squarefree-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-193-squarefree-numbers.md @@ -14,7 +14,7 @@ How many squarefree numbers are there below $2^{50}$? # --hints-- -`squarefreeNumbers()` should return `684465067343069`. +`squarefreeNumbers()` має повернути `684465067343069`. ```js assert.strictEqual(squarefreeNumbers(), 684465067343069); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md index 4d5b05af3d9..e66d496a698 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-194-coloured-configurations.md @@ -20,7 +20,7 @@ Find the last 8 digits of $N(25,75,1984)$. # --hints-- -`coloredConfigurations()` should return `61190912`. +`coloredConfigurations()` має повернути `61190912`. ```js assert.strictEqual(coloredConfigurations(), 61190912); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md index 18c2acd7592..9e08d4b2a78 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md @@ -20,7 +20,7 @@ Find $T(1053779)$. # --hints-- -`inscribedCirclesOfTriangles()` should return `75085391`. +`inscribedCirclesOfTriangles()` має повернути `75085391`. ```js assert.strictEqual(inscribedCirclesOfTriangles(), 75085391); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md index d072c7689a1..29da1ea2ef1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-196-prime-triplets.md @@ -34,7 +34,7 @@ Find $S(5678027) + S(7208785)$. # --hints-- -`primeTriplets()` should return `322303240771079940`. +`primeTriplets()` має повернути `322303240771079940`. ```js assert.strictEqual(primeTriplets(), 322303240771079940); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md index 608f288e3e9..0df193ded88 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md @@ -14,7 +14,7 @@ Find $u_n + u_{n + 1}$ for $n = {10}^{12}$. Give your answer with 9 digits after # --hints-- -`recursivelyDefinedSequence()` should return `1.710637717`. +`recursivelyDefinedSequence()` має повернути `1.710637717`. ```js assert.strictEqual(recursivelyDefinedSequence(), 1.710637717); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md index 69c2ba856dc..ac5fcf1ef78 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-198-ambiguous-numbers.md @@ -16,7 +16,7 @@ How many ambiguous numbers $x = \frac{p}{q}$, $0 < x < \frac{1}{100}$, are # --hints-- -`ambiguousNumbers()` should return `52374425`. +`ambiguousNumbers()` має повернути `52374425`. ```js assert.strictEqual(ambiguousNumbers(), 52374425); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md index 5c699d70320..8fbeef5b95a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-199-iterative-circle-packing.md @@ -18,19 +18,19 @@ What fraction of the area is not covered by circles after `n` iterations? Give y # --hints-- -`iterativeCirclePacking(10)` should return a number. +`iterativeCirclePacking(10)` має повернути число. ```js assert(typeof iterativeCirclePacking(10) === 'number'); ``` -`iterativeCirclePacking(10)` should return `0.00396087`. +`iterativeCirclePacking(10)` має повернути `0.00396087`. ```js assert.strictEqual(iterativeCirclePacking(10), 0.00396087); ``` -`iterativeCirclePacking(3)` should return `0.06790342`. +`iterativeCirclePacking(3)` має повернути `0.06790342`. ```js assert.strictEqual(iterativeCirclePacking(3), 0.06790342); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md index e35cfa0a550..e20a52f129b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-101-to-200/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md @@ -22,7 +22,7 @@ Find the 200th prime-proof sqube containing the contiguous sub-string `200`. # --hints-- -`primeProofSqubeWithSubString()` should return `229161792008`. +`primeProofSqubeWithSubString()` має повернути `229161792008`. ```js assert.strictEqual(primeProofSqubeWithSubString(), 229161792008); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md index e0513d008ec..7d2540c66c5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-201-subsets-with-a-unique-sum.md @@ -32,7 +32,7 @@ Determine the sum of all integers which are the sum of exactly one of the $50$-e # --hints-- -`uniqueSubsetsSum()` should return `115039000`. +`uniqueSubsetsSum()` має повернути `115039000`. ```js assert.strictEqual(uniqueSubsetsSum(), 115039000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-202-laserbeam.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-202-laserbeam.md index 2090a152b22..1de409a5af3 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-202-laserbeam.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-202-laserbeam.md @@ -20,7 +20,7 @@ In how many ways can a laser beam enter at vertex $C$, bounce off 12017639147 su # --hints-- -`laserbeam()` should return `1209002624`. +`laserbeam()` має повернути `1209002624`. ```js assert.strictEqual(laserbeam(), 1209002624); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md index 4e418715771..b7aff632b1b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-203-squarefree-binomial-coefficients.md @@ -24,7 +24,7 @@ Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's # --hints-- -`squarefreeBinomialCoefficients()` should return `34029210557338`. +`squarefreeBinomialCoefficients()` має повернути `34029210557338`. ```js assert.strictEqual(squarefreeBinomialCoefficients(), 34029210557338); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md index 584cf57c132..b68301b1b34 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-204-generalised-hamming-numbers.md @@ -20,7 +20,7 @@ How many generalised Hamming numbers of type 100 are there which don't exceed ${ # --hints-- -`generalisedHammingNumbers()` should return `2944730`. +`generalisedHammingNumbers()` має повернути `2944730`. ```js assert.strictEqual(generalisedHammingNumbers(), 2944730); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md index 17614dbf03b..18b275962f4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-205-dice-game.md @@ -18,7 +18,7 @@ What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer # --hints-- -`diceGame()` should return `0.5731441`. +`diceGame()` має повернути `0.5731441`. ```js assert.strictEqual(diceGame(), 0.5731441); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md index 596f703da28..9a48594f61e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-206-concealed-square.md @@ -12,7 +12,7 @@ Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, # --hints-- -`concealedSquare()` should return `1389019170`. +`concealedSquare()` має повернути `1389019170`. ```js assert.strictEqual(concealedSquare(), 1389019170); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md index 29efa6bc5f6..36e84b7c7ad 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-207-integer-partition-equations.md @@ -30,7 +30,7 @@ Find the smallest $m$ for which $P(m) < \frac{1}{12\\,345}$ # --hints-- -`integerPartitionEquations()` should return `44043947822`. +`integerPartitionEquations()` має повернути `44043947822`. ```js assert.strictEqual(integerPartitionEquations(), 44043947822); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md index 63c4e63cf53..f29472fcd86 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-208-robot-walks.md @@ -20,7 +20,7 @@ Given that the robot starts facing North, how many journeys of 70 arcs in length # --hints-- -`robotWalks()` should return `331951449665644800`. +`robotWalks()` має повернути `331951449665644800`. ```js assert.strictEqual(robotWalks(), 331951449665644800); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md index 97190a72f20..48d8d066f37 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-209-circular-logic.md @@ -32,7 +32,7 @@ for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)? # --hints-- -`circularLogic()` should return `15964587728784`. +`circularLogic()` має повернути `15964587728784`. ```js assert.strictEqual(circularLogic(), 15964587728784); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md index 0dbbed2f9b0..7b22b6b274c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-210-obtuse-angled-triangles.md @@ -20,7 +20,7 @@ What is $N(1\\,000\\,000\\,000)$? # --hints-- -`obtuseAngledTriangles()` should return `1598174770174689500`. +`obtuseAngledTriangles()` має повернути `1598174770174689500`. ```js assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md index 3dddacaadbb..1d048036564 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-211-divisor-square-sum.md @@ -16,7 +16,7 @@ Find the sum of all $n$, $0 < n < 64\\,000\\,000$ such that $σ_2(n)$ is a # --hints-- -`divisorSquareSum()` should return `1922364685`. +`divisorSquareSum()` має повернути `1922364685`. ```js assert.strictEqual(divisorSquareSum(), 1922364685); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md index 6fd271c483e..86267cbe894 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-212-combined-volume-of-cuboids.md @@ -31,7 +31,7 @@ What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$? # --hints-- -`combinedValueOfCuboids()` should return `328968937309`. +`combinedValueOfCuboids()` має повернути `328968937309`. ```js assert.strictEqual(combinedValueOfCuboids(), 328968937309); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md index a18eb635255..c2e50a021d5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-213-flea-circus.md @@ -16,7 +16,7 @@ What is the expected number of unoccupied squares after 50 rings of the bell? Gi # --hints-- -`fleaCircus()` should return `330.721154`. +`fleaCircus()` має повернути `330.721154`. ```js assert.strictEqual(fleaCircus(), 330.721154); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md index 497d541bc82..92cf59f30ae 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-214-totient-chains.md @@ -24,7 +24,7 @@ What is the sum of all primes less than $40\\,000\\,000$ which generate a chain # --hints-- -`totientChains()` should return `1677366278943`. +`totientChains()` має повернути `1677366278943`. ```js assert.strictEqual(totientChains(), 1677366278943); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md index 4e0f214b938..a76ae9d766f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-215-crack-free-walls.md @@ -20,7 +20,7 @@ Calculate $W(32,10)$. # --hints-- -`crackFreeWalls()` should return `806844323190414`. +`crackFreeWalls()` має повернути `806844323190414`. ```js assert.strictEqual(crackFreeWalls(), 806844323190414); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md index a528915ab9a..8e834151d2a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md @@ -20,7 +20,7 @@ How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$? # --hints-- -`primalityOfNumbers()` should return `5437849`. +`primalityOfNumbers()` має повернути `5437849`. ```js assert.strictEqual(primalityOfNumbers(), 5437849); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md index f685410fcd3..082e2559474 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-217-balanced-numbers.md @@ -20,7 +20,7 @@ Find $T(47)\\,mod\\,3^{15}$ # --hints-- -`balancedNumbers()` should return `6273134`. +`balancedNumbers()` має повернути `6273134`. ```js assert.strictEqual(balancedNumbers(), 6273134); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md index 1d29c005426..2967d98385b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-218-perfect-right-angled-triangles.md @@ -30,7 +30,7 @@ How many perfect right-angled triangles with $c ≤ {10}^{16}$ exist that are no # --hints-- -`perfectRightAngledTriangles()` should return `0`. +`perfectRightAngledTriangles()` має повернути `0`. ```js assert.strictEqual(perfectRightAngledTriangles(), 0); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md index f2d2b0f8721..eaaefe78b69 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-219-skew-cost-coding.md @@ -24,7 +24,7 @@ What is $Cost(10^9)$? # --hints-- -`skewCostCoding()` should return `64564225042`. +`skewCostCoding()` має повернути `64564225042`. ```js assert.strictEqual(skewCostCoding(), 64564225042); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md index e58e3c3f3ec..9260fbbb060 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-220-heighway-dragon.md @@ -25,13 +25,13 @@ What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give you # --hints-- -`heighwayDragon()` should return a string. +`heighwayDragon()` має повернути рядок. ```js assert(typeof heighwayDragon() === 'string'); ``` -`heighwayDragon()` should return the string `139776,963904`. +`heighwayDragon()` має повернути рядок `139776,963904`. ```js assert.strictEqual(heighwayDragon(), '139776,963904'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md index e7fedf26f75..37803adc0aa 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-221-alexandrian-integers.md @@ -23,7 +23,7 @@ Find the 150000th Alexandrian integer. # --hints-- -`alexandrianIntegers()` should return `1884161251122450`. +`alexandrianIntegers()` має повернути `1884161251122450`. ```js assert.strictEqual(alexandrianIntegers(), 1884161251122450); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md index cdb6a9c3977..77d0ab998c4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-222-sphere-packing.md @@ -14,7 +14,7 @@ Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer. # --hints-- -`spherePacking()` should return `1590933`. +`spherePacking()` має повернути `1590933`. ```js assert.strictEqual(spherePacking(), 1590933); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md index 7fdbc36cbc6..d1cc120a90c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-223-almost-right-angled-triangles-i.md @@ -14,7 +14,7 @@ How many barely acute triangles are there with perimeter $≤ 25\\,000\\,000$? # --hints-- -`almostRightAngledTrianglesOne()` should return `61614848`. +`almostRightAngledTrianglesOne()` має повернути `61614848`. ```js assert.strictEqual(almostRightAngledTrianglesOne(), 61614848); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md index c9f9b44cb3f..ee41d2572ee 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-224-almost-right-angled-triangles-ii.md @@ -14,7 +14,7 @@ How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$? # --hints-- -`almostRightAngledTrianglesTwo()` should return `4137330`. +`almostRightAngledTrianglesTwo()` має повернути `4137330`. ```js assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md index 2221b445314..cdc68ad1a63 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-225-tribonacci-non-divisors.md @@ -18,7 +18,7 @@ Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the ab # --hints-- -`tribonacciNonDivisors()` should return `2009`. +`tribonacciNonDivisors()` має повернути `2009`. ```js assert.strictEqual(tribonacciNonDivisors(), 2009); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md index fd8031f2594..cc3625882b4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-226-a-scoop-of-blancmange.md @@ -20,7 +20,7 @@ What area under the blancmange curve is enclosed by $C$? Give your answer rounde # --hints-- -`scoopOfBlancmange()` should return `0.11316017`. +`scoopOfBlancmange()` має повернути `0.11316017`. ```js assert.strictEqual(scoopOfBlancmange(), 0.11316017); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md index 3121c6ac8d8..90dbb8539d4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-227-the-chase.md @@ -24,7 +24,7 @@ In a game with 100 players, what is the expected number of turns the game lasts? # --hints-- -`theChase()` should return `3780.618622`. +`theChase()` має повернути `3780.618622`. ```js assert.strictEqual(theChase(), 3780.618622); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md index 3bccd240ed2..fa1f837e59c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-228-minkowski-sums.md @@ -25,7 +25,7 @@ How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have? # --hints-- -`minkowskiSums()` should return `86226`. +`minkowskiSums()` має повернути `86226`. ```js assert.strictEqual(minkowskiSums(), 86226); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md index 3903d30320f..97e9d20cbca 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-229-four-representations-using-squares.md @@ -30,7 +30,7 @@ How many such numbers are there that do not exceed $2 × {10}^9$? # --hints-- -`representationsUsingSquares()` should return `11325263`. +`representationsUsingSquares()` має повернути `11325263`. ```js assert.strictEqual(representationsUsingSquares(), 11325263); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md index bc6cd70f1cc..67747c07251 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-230-fibonacci-words.md @@ -38,7 +38,7 @@ Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$. # --hints-- -`fibonacciWords()` should return `850481152593119200`. +`fibonacciWords()` має повернути `850481152593119200`. ```js assert.strictEqual(fibonacciWords(), 850481152593119200); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md index 498810cf48c..cefd8fded72 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-231-the-prime-factorisation-of-binomial-coefficients.md @@ -18,7 +18,7 @@ Find the sum of the terms in the prime factorisation of $\binom{20\\,000\\,000}{ # --hints-- -`primeFactorisation()` should return `7526965179680`. +`primeFactorisation()` має повернути `7526965179680`. ```js assert.strictEqual(primeFactorisation(), 7526965179680); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md index c03c0d687b3..16a58069d73 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-232-the-race.md @@ -24,7 +24,7 @@ Give your answer rounded to eight decimal places in the form 0.abcdefgh . # --hints-- -`theRace()` should return `0.83648556`. +`theRace()` має повернути `0.83648556`. ```js assert.strictEqual(theRace(), 0.83648556); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md index db650947233..7c0e3f3bad2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-233-lattice-points-on-a-circle.md @@ -16,7 +16,7 @@ What is the sum of all positive integers $N ≤ {10}^{11}$ such that $f(N) = 420 # --hints-- -`latticePointsOnACircle()` should return `271204031455541300`. +`latticePointsOnACircle()` має повернути `271204031455541300`. ```js assert.strictEqual(latticePointsOnACircle(), 271204031455541300); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md index ec01ca36a28..9e45d750fc7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-234-semidivisible-numbers.md @@ -20,7 +20,7 @@ What is the sum of all semidivisible numbers not exceeding 999966663333? # --hints-- -`semidivisibleNumbers()` should return `1259187438574927000`. +`semidivisibleNumbers()` має повернути `1259187438574927000`. ```js assert.strictEqual(semidivisibleNumbers(), 1259187438574927000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md index 893687367a5..152e2c9c721 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-235-an-arithmetic-geometric-sequence.md @@ -18,7 +18,7 @@ Give your answer rounded to 12 places behind the decimal point. # --hints-- -`arithmeticGeometricSequence()` should return `1.002322108633`. +`arithmeticGeometricSequence()` має повернути `1.002322108633`. ```js assert.strictEqual(arithmeticGeometricSequence(), 1.002322108633); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md index 2ae12a0ab04..387fe499892 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-236-luxury-hampers.md @@ -33,13 +33,13 @@ What's the largest possible value of $m$? Give your answer as a string with frac # --hints-- -`luxuryHampers()` should return a string. +`luxuryHampers()` має повернути рядок. ```js assert(typeof luxuryHampers() === 'string'); ``` -`luxuryHampers()` should return the string `123/59`. +`luxuryHampers()` має повернути рядок `123/59`. ```js assert.strictEqual(luxuryHampers(), '123/59'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md index ef7c2a30c04..598c68ecdf1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-237-tours-on-a-4-x-n-playing-board.md @@ -23,7 +23,7 @@ $T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$? # --hints-- -`toursOnPlayingBoard()` should return `15836928`. +`toursOnPlayingBoard()` має повернути `15836928`. ```js assert.strictEqual(toursOnPlayingBoard(), 15836928); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md index 6f49452d838..791509a5db1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-238-infinite-string-tour.md @@ -33,7 +33,7 @@ Find $\sum p(k)$, for $0 < k ≤ 2 \times {10}^{15}$. # --hints-- -`infiniteStringTour()` should return `9922545104535660`. +`infiniteStringTour()` має повернути `9922545104535660`. ```js assert.strictEqual(infiniteStringTour(), 9922545104535660); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md index 9fff8274ba8..8bef468daad 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-239-twenty-two-foolish-primes.md @@ -16,7 +16,7 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc # --hints-- -`twentyTwoFoolishPrimes()` should return `0.001887854841`. +`twentyTwoFoolishPrimes()` має повернути `0.001887854841`. ```js assert.strictEqual(twentyTwoFoolishPrimes(), 0.001887854841); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md index 97f89f17305..93d31eec8ca 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-240-top-dice.md @@ -18,7 +18,7 @@ In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so # --hints-- -`topDice()` should return `7448717393364182000`. +`topDice()` має повернути `7448717393364182000`. ```js assert.strictEqual(topDice(), 7448717393364182000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md index 492d3f61f8e..970866d23d7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-241-perfection-quotients.md @@ -18,7 +18,7 @@ Find the sum of all positive integers $n ≤ {10}^{18}$ for which $p(n)$ has the # --hints-- -`perfectionQuotients()` should return `482316491800641150`. +`perfectionQuotients()` має повернути `482316491800641150`. ```js assert.strictEqual(perfectionQuotients(), 482316491800641150); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md index abbcfca2a6a..6610132ee10 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-242-odd-triplets.md @@ -18,7 +18,7 @@ How many odd-triplets are there with $n ≤ {10}^{12}$? # --hints-- -`oddTriplets()` should return `997104142249036700`. +`oddTriplets()` має повернути `997104142249036700`. ```js assert.strictEqual(oddTriplets(), 997104142249036700); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md index 67287eac731..2dcd7f42a33 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-243-resilience.md @@ -24,7 +24,7 @@ Find the smallest denominator $d$, having a resilience $R(d) < \frac{15\\,499 # --hints-- -`resilience()` should return `892371480`. +`resilience()` має повернути `892371480`. ```js assert.strictEqual(resilience(), 892371480); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md index ebe4a76b838..621ea9ad652 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-244-sliders.md @@ -32,7 +32,7 @@ What is the sum of all checksums for the paths having the minimal length? # --hints-- -`sliders()` should return `96356848`. +`sliders()` має повернути `96356848`. ```js assert.strictEqual(sliders(), 96356848); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md index c3e090d0edb..287e54a3c85 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-245-coresilience.md @@ -22,7 +22,7 @@ Find the sum of all composite integers $1 < n ≤ 2 × {10}^{11}$, for which # --hints-- -`coresilience()` should return `288084712410001`. +`coresilience()` має повернути `288084712410001`. ```js assert.strictEqual(coresilience(), 288084712410001); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md index 16c5d89e23b..f16204d6c27 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-246-tangents-to-an-ellipse.md @@ -32,7 +32,7 @@ For how many lattice points $P$ is angle $RPS$ greater than 45°? # --hints-- -`tangentsToAnEllipse()` should return `810834388`. +`tangentsToAnEllipse()` має повернути `810834388`. ```js assert.strictEqual(tangentsToAnEllipse(), 810834388); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md index d84036f8701..78a2f1ca382 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-247-squares-under-a-hyperbola.md @@ -30,7 +30,7 @@ What is the largest $n$ for which the index of $S_n$ is (3, 3)? # --hints-- -`squaresUnderAHyperbola()` should return `782252`. +`squaresUnderAHyperbola()` має повернути `782252`. ```js assert.strictEqual(squaresUnderAHyperbola(), 782252); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md index 0df6dd5226a..059bfb17c38 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-248-numbers-for-which-eulers-totient-function-equals-13.md @@ -14,7 +14,7 @@ Find the ${150\\,000}^{\text{th}}$ such number. # --hints-- -`eulersTotientFunctionEquals()` should return `23507044290`. +`eulersTotientFunctionEquals()` має повернути `23507044290`. ```js assert.strictEqual(eulersTotientFunctionEquals(), 23507044290); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md index 09232c7c178..94a1a5644af 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-249-prime-subset-sums.md @@ -16,7 +16,7 @@ Enter the rightmost 16 digits as your answer. # --hints-- -`primeSubsetSums()` should return `9275262564250418`. +`primeSubsetSums()` має повернути `9275262564250418`. ```js assert.strictEqual(primeSubsetSums(), 9275262564250418); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md index c526154b6e7..0581650fd0b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-250-250250.md @@ -12,7 +12,7 @@ Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, { # --hints-- -`twoHundredFifty()` should return `1425480602091519`. +`twoHundredFifty()` має повернути `1425480602091519`. ```js assert.strictEqual(twoHundredFifty(), 1425480602091519); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md index 8f4013595f3..f34dc57280b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-251-cardano-triplets.md @@ -20,7 +20,7 @@ Find how many Cardano Triplets exist such that $a + b + c ≤ 110\\,000\\,000$. # --hints-- -`cardanoTriplets()` should return `18946051`. +`cardanoTriplets()` має повернути `18946051`. ```js assert.strictEqual(cardanoTriplets(), 18946051); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md index ec671c067aa..6848ea0d5c4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-252-convex-holes.md @@ -25,7 +25,7 @@ What is the maximum area for a convex hole on the set containing the first 500 p # --hints-- -`convexHoles()` should return `104924`. +`convexHoles()` має повернути `104924`. ```js assert.strictEqual(convexHoles(), 104924); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-253-tidying-up.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-253-tidying-up.md index 3dbeca51b38..893f0ce9787 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-253-tidying-up.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-253-tidying-up.md @@ -43,7 +43,7 @@ The most likely value of $M$ for a forty-piece caterpillar is 11; but what is th # --hints-- -`tidyingUp()` should return `11.492847`. +`tidyingUp()` має повернути `11.492847`. ```js assert.strictEqual(tidyingUp(), 11.492847); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md index 3d91777d0a4..e4db2542f01 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-254-sums-of-digit-factorials.md @@ -22,7 +22,7 @@ What is $\sum sg(i)$ for $1 ≤ i ≤ 150$? # --hints-- -`sumsOfDigitFactorials()` should return `8184523820510`. +`sumsOfDigitFactorials()` має повернути `8184523820510`. ```js assert.strictEqual(sumsOfDigitFactorials(), 8184523820510); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md index abfbcfe2047..c93e7dbda78 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-255-rounded-square-roots.md @@ -41,7 +41,7 @@ Using the procedure described above, what is the average number of iterations re # --hints-- -`roundedSquareRoots()` should return `4.447401118`. +`roundedSquareRoots()` має повернути `4.447401118`. ```js assert.strictEqual(roundedSquareRoots(), 4.447401118); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md index 170443188b8..8cac514d423 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-256-tatami-free-rooms.md @@ -30,7 +30,7 @@ Find the smallest room-size $s$ for which $T(s) = 200$. # --hints-- -`tatamiFreeRooms()` should return `85765680`. +`tatamiFreeRooms()` має повернути `85765680`. ```js assert.strictEqual(tatamiFreeRooms(), 85765680); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md index 60864ac52e1..f4bba739978 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-257-angular-bisectors.md @@ -20,7 +20,7 @@ How many triangles $ABC$ with perimeter $≤ 100\\,000\\,000$ exist so that the # --hints-- -`angularBisectors()` should return `139012411`. +`angularBisectors()` має повернути `139012411`. ```js assert.strictEqual(angularBisectors(), 139012411); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md index d21eb673b78..4b25c84a37c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-258-a-lagged-fibonacci-sequence.md @@ -17,7 +17,7 @@ Find $g_k$ mod 20092010 for $k = {10}^{18}$. # --hints-- -`laggedFibonacciSequence()` should return `12747994`. +`laggedFibonacciSequence()` має повернути `12747994`. ```js assert.strictEqual(laggedFibonacciSequence(), 12747994); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-259-reachable-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-259-reachable-numbers.md index a8fa3ceb470..a39f7af62f4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-259-reachable-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-259-reachable-numbers.md @@ -23,7 +23,7 @@ What is the sum of all positive reachable integers? # --hints-- -`reachableNumbers()` should return `20101196798`. +`reachableNumbers()` має повернути `20101196798`. ```js assert.strictEqual(reachableNumbers(), 20101196798); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-260-stone-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-260-stone-game.md index d0724fd1214..50d5847fe49 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-260-stone-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-260-stone-game.md @@ -34,7 +34,7 @@ Find $\sum (x_i + y_i + z_i)$ where ($x_i$,$y_i$,$z_i$) ranges over the losing c # --hints-- -`stoneGame()` should return `167542057`. +`stoneGame()` має повернути `167542057`. ```js assert.strictEqual(stoneGame(), 167542057); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md index af6e1b5aa27..6415a8fd063 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-261-pivotal-square-sums.md @@ -22,7 +22,7 @@ Find the sum of all distinct square-pivots $≤ {10}^{10}$. # --hints-- -`pivotalSquareSums()` should return `238890850232021`. +`pivotalSquareSums()` має повернути `238890850232021`. ```js assert.strictEqual(pivotalSquareSums(), 238890850232021); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md index d340e834fa6..d4a2f844c75 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-262-mountain-range.md @@ -24,7 +24,7 @@ Give that length as your answer, rounded to three decimal places. # --hints-- -`mountainRange()` should return `2531.205`. +`mountainRange()` має повернути `2531.205`. ```js assert.strictEqual(mountainRange(), 2531.205); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md index 8fec64cc250..c68db942c00 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-263-an-engineers-dream-come-true.md @@ -31,7 +31,7 @@ Find the sum of the first four engineers’ paradises. # --hints-- -`engineersDreamComeTrue()` should return `2039506520`. +`engineersDreamComeTrue()` має повернути `2039506520`. ```js assert.strictEqual(engineersDreamComeTrue(), 2039506520); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md index dc22c0cf51b..5796048288f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-264-triangle-centres.md @@ -45,7 +45,7 @@ Find all such triangles with a $\text{perimeter} ≤ {10}^5$. Enter as your answ # --hints-- -`triangleCentres()` should return `2816417.1055`. +`triangleCentres()` має повернути `2816417.1055`. ```js assert.strictEqual(triangleCentres(), 2816417.1055); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md index 4262d97c798..59769d6eb9a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-265-binary-circles.md @@ -27,7 +27,7 @@ Find $S(5)$. # --hints-- -`binaryCircles()` should return `209110240768`. +`binaryCircles()` має повернути `209110240768`. ```js assert.strictEqual(binaryCircles(), 209110240768); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md index 2b22e967efb..b2cd2365646 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-266-pseudo-square-root.md @@ -20,7 +20,7 @@ Let $p$ be the product of the primes below 190. Find $PSR(p)\bmod {10}^{16}$. # --hints-- -`pseudoSquareRoot()` should return `1096883702440585`. +`pseudoSquareRoot()` має повернути `1096883702440585`. ```js assert.strictEqual(pseudoSquareRoot(), 1096883702440585); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md index 8dbe1d8ab66..10ed67ea296 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-267-billionaire.md @@ -22,7 +22,7 @@ All computations are assumed to be exact (no rounding), but give your answer rou # --hints-- -`billionaire()` should return `0.999992836187`. +`billionaire()` має повернути `0.999992836187`. ```js assert.strictEqual(billionaire(), 0.999992836187); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md index bd295d89e67..7a92fdd65c5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md @@ -16,7 +16,7 @@ Find how many positive integers less than ${10}^{16}$ are divisible by at least # --hints-- -`fourDistinctPrimeFactors()` should return `785478606870985`. +`fourDistinctPrimeFactors()` має повернути `785478606870985`. ```js assert.strictEqual(fourDistinctPrimeFactors(), 785478606870985); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md index 3b66b2a2ab1..cfd6f8af5cd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-269-polynomials-with-at-least-one-integer-root.md @@ -28,7 +28,7 @@ What is $Z({10}^{16})$? # --hints-- -`polynomialsWithOneIntegerRoot()` should return `1311109198529286`. +`polynomialsWithOneIntegerRoot()` має повернути `1311109198529286`. ```js assert.strictEqual(polynomialsWithOneIntegerRoot(), 1311109198529286); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md index 0458e257f05..7b235e2d315 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-270-cutting-squares.md @@ -22,7 +22,7 @@ What is $C(30)\bmod {10}^8$ ? # --hints-- -`cuttingSquares()` should return `82282080`. +`cuttingSquares()` має повернути `82282080`. ```js assert.strictEqual(cuttingSquares(), 82282080); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md index f1dbf4b5666..23048ca47bd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-271-modular-cubes-part-1.md @@ -16,7 +16,7 @@ Find $S(13\\,082\\,761\\,331\\,670\\,030)$. # --hints-- -`modularCubesOne()` should return `4617456485273130000`. +`modularCubesOne()` має повернути `4617456485273130000`. ```js assert.strictEqual(modularCubesOne(), 4617456485273130000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md index d764ea6563b..275bbaa8e7d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-272-modular-cubes-part-2.md @@ -16,7 +16,7 @@ Find the sum of the positive numbers $n ≤ {10}^{11}$ for which $C(n)=242$. # --hints-- -`modularCubesTwo()` should return `8495585919506151000`. +`modularCubesTwo()` має повернути `8495585919506151000`. ```js assert.strictEqual(modularCubesTwo(), 8495585919506151000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md index d5ffc27c633..6b98ae51140 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-273-sum-of-squares.md @@ -22,7 +22,7 @@ Find $\sum S(N)$, for all squarefree $N$ only divisible by primes of the form $4 # --hints-- -`sumOfSquares()` should return `2032447591196869000`. +`sumOfSquares()` має повернути `2032447591196869000`. ```js assert.strictEqual(sumOfSquares(), 2032447591196869000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md index bf56b697151..1040e6f6feb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-274-divisibility-multipliers.md @@ -26,7 +26,7 @@ The sum of the divisibility multipliers for the primes that are coprime to 10 an # --hints-- -`divisibilityMultipliers()` should return `1601912348822`. +`divisibilityMultipliers()` має повернути `1601912348822`. ```js assert.strictEqual(divisibilityMultipliers(), 1601912348822); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md index decc755a9ee..b14763abf7a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-275-balanced-sculptures.md @@ -25,7 +25,7 @@ How many balanced sculptures are there of order 18? # --hints-- -`balancedSculptures()` should return `15030564`. +`balancedSculptures()` має повернути `15030564`. ```js assert.strictEqual(balancedSculptures(), 15030564); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md index 26ce00839b4..4c7cf3d52dc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-276-primitive-triangles.md @@ -16,7 +16,7 @@ How many primitive integer sided triangles exist with a perimeter not exceeding # --hints-- -`primitiveTriangles()` should return `5777137137739633000`. +`primitiveTriangles()` має повернути `5777137137739633000`. ```js assert.strictEqual(primitiveTriangles(), 5777137137739633000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md index c80635aa3d8..a27d85493e1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-277-a-modified-collatz-sequence.md @@ -30,7 +30,7 @@ What is the smallest $a_1 > {10}^{15}$ that begins with the sequence "UDDDUdddDD # --hints-- -`modifiedCollatzSequence()` should return `1125977393124310`. +`modifiedCollatzSequence()` має повернути `1125977393124310`. ```js assert.strictEqual(modifiedCollatzSequence(), 1125977393124310); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md index 215c51cb036..7f54b6888f7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-278-linear-combinations-of-semiprimes.md @@ -18,7 +18,7 @@ Find $\sum f(pq,pr,qr)$, where $p$, $q$ and $r$ are prime numbers and $p < q # --hints-- -`linearCombinationOfSemiprimes()` should return `1228215747273908500`. +`linearCombinationOfSemiprimes()` має повернути `1228215747273908500`. ```js assert.strictEqual(linearCombinationOfSemiprimes(), 1228215747273908500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md index 9d50a5ebc61..e99a8a5ee07 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-279-triangles-with-integral-sides-and-an-integral-angle.md @@ -12,7 +12,7 @@ How many triangles are there with integral sides, at least one integral angle (m # --hints-- -`trianglesWithIntegralSidesAndAngle()` should return `416577688`. +`trianglesWithIntegralSidesAndAngle()` має повернути `416577688`. ```js assert.strictEqual(trianglesWithIntegralSidesAndAngle(), 416577688); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md index 5057b8bd47c..a1b6eb61d14 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-280-ant-and-seeds.md @@ -16,7 +16,7 @@ What's the expected number of steps until all seeds have been dropped in the top # --hints-- -`antAndSeeds()` should return `430.088247`. +`antAndSeeds()` має повернути `430.088247`. ```js assert.strictEqual(antAndSeeds(), 430.088247); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-281-pizza-toppings.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-281-pizza-toppings.md index 60b84a893f8..6ffea0c019f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-281-pizza-toppings.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-281-pizza-toppings.md @@ -20,7 +20,7 @@ Find the sum of all $f(m,n)$ such that $f(m,n) ≤ {10}^{15}$. # --hints-- -`pizzaToppings()` should return `1485776387445623`. +`pizzaToppings()` має повернути `1485776387445623`. ```js assert.strictEqual(pizzaToppings(), 1485776387445623); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md index c9cbb75087d..1e8cf9eefdf 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-282-the-ackermann-function.md @@ -19,7 +19,7 @@ Find $\displaystyle\sum_{n = 0}^6 A(n, n)$ and give your answer mod ${14}^8$. # --hints-- -`ackermanFunction()` should return `1098988351`. +`ackermanFunction()` має повернути `1098988351`. ```js assert.strictEqual(ackermanFunction(), 1098988351); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md index e32d0d74b9d..fe12f092558 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md @@ -22,7 +22,7 @@ Find the sum of the perimeters of all integer sided triangles for which the area # --hints-- -`integralAreaPerimeterRatio()` should return `28038042525570324`. +`integralAreaPerimeterRatio()` має повернути `28038042525570324`. ```js assert.strictEqual(integralAreaPerimeterRatio(), 28038042525570324); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md index d6c86b00055..7255b2082e9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-284-steady-squares.md @@ -18,13 +18,13 @@ Find the sum of the digits of all the $n$-digit steady squares in the base 14 nu # --hints-- -`steadySquares()` should return a string. +`steadySquares()` має повернути рядок. ```js assert(typeof steadySquares() === 'string'); ``` -`steadySquares()` should return the string `5a411d7b`. +`steadySquares()` має повернути рядок `5a411d7b`. ```js assert.strictEqual(steadySquares(), '5a411d7b'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md index 5c6e49167f9..9aef7ea37ac 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-285-pythagorean-odds.md @@ -20,7 +20,7 @@ If he plays ${10}^5$ turns with $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, what # --hints-- -`pythagoreanOdds()` should return `157055.80999`. +`pythagoreanOdds()` має повернути `157055.80999`. ```js assert.strictEqual(pythagoreanOdds(), 157055.80999); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md index 26e3e198604..6a41cfd371f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-286-scoring-probabilities.md @@ -16,7 +16,7 @@ Find $q$ and give your answer rounded to 10 decimal places. # --hints-- -`scoringProbabilities()` should return `52.6494571953`. +`scoringProbabilities()` має повернути `52.6494571953`. ```js assert.strictEqual(scoringProbabilities(), 52.6494571953); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md index 707a6fa97e7..340cfa8570c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-287-quadtree-encoding-a-simple-compression-algorithm.md @@ -33,7 +33,7 @@ What is the length of the minimal sequence describing $D_{24}$? # --hints-- -`quadtreeEncoding()` should return `313135496`. +`quadtreeEncoding()` має повернути `313135496`. ```js assert.strictEqual(quadtreeEncoding(), 313135496); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-288-an-enormous-factorial.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-288-an-enormous-factorial.md index cd92a15cd8c..3e398743915 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-288-an-enormous-factorial.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-288-an-enormous-factorial.md @@ -23,7 +23,7 @@ Find $NF(61,{10}^7)\bmod {61}^{10}$. # --hints-- -`enormousFactorial()` should return `605857431263982000`. +`enormousFactorial()` має повернути `605857431263982000`. ```js assert.strictEqual(enormousFactorial(), 605857431263982000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md index e491cab3612..377e038a95d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-289-eulerian-cycles.md @@ -24,7 +24,7 @@ Find $L(6,10)\bmod {10}^{10}$. # --hints-- -`eulerianCycles()` should return `6567944538`. +`eulerianCycles()` має повернути `6567944538`. ```js assert.strictEqual(eulerianCycles(), 6567944538); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md index a6b3636eefd..ecd96e6d04e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-290-digital-signature.md @@ -12,7 +12,7 @@ How many integers $0 ≤ n < {10}^{18}$ have the property that the sum of the # --hints-- -`digitalSignature()` should return `20444710234716470`. +`digitalSignature()` має повернути `20444710234716470`. ```js assert.strictEqual(digitalSignature(), 20444710234716470); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md index bb33727271a..dc76255268b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-291-panaitopol-primes.md @@ -14,7 +14,7 @@ Find how many Panaitopol primes are less than $5 × {10}^{15}$. # --hints-- -`panaitopolPrimes()` should return `4037526`. +`panaitopolPrimes()` має повернути `4037526`. ```js assert.strictEqual(panaitopolPrimes(), 4037526); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md index 8e0dd899454..dd85aa26a40 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-292-pythagorean-polygons.md @@ -25,7 +25,7 @@ Find $P(120)$. # --hints-- -`pythagoreanPolygons()` should return `3600060866`. +`pythagoreanPolygons()` має повернути `3600060866`. ```js assert.strictEqual(pythagoreanPolygons(), 3600060866); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md index 0c8076828de..a1ff5c8e525 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-293-pseudo-fortunate-numbers.md @@ -20,7 +20,7 @@ Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers $N$ # --hints-- -`pseudoFortunateNumbers()` should return `2209`. +`pseudoFortunateNumbers()` має повернути `2209`. ```js assert.strictEqual(pseudoFortunateNumbers(), 2209); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md index b32ebc882de..763dbc7a2b2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-294-sum-of-digits---experience-23.md @@ -21,7 +21,7 @@ Find $S({11}^{12})$ and give your answer $\bmod {10}^9$. # --hints-- -`experience23()` should return `789184709`. +`experience23()` має повернути `789184709`. ```js assert.strictEqual(experience23(), 789184709); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md index 9354ea7c840..21887df2659 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-295-lenticular-holes.md @@ -33,7 +33,7 @@ Find $L(100\\,000)$. # --hints-- -`lenticularHoles()` should return `4884650818`. +`lenticularHoles()` має повернути `4884650818`. ```js assert.strictEqual(lenticularHoles(), 4884650818); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-296-angular-bisector-and-tangent.md index 660d66eabb4..ed2a5ee4505 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-296-angular-bisector-and-tangent.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-296-angular-bisector-and-tangent.md @@ -18,7 +18,7 @@ How many triangles $ABC$ with a perimeter not exceeding $100\\,000$ exist such t # --hints-- -`angularBisectorAndTangent()` should return `1137208419`. +`angularBisectorAndTangent()` має повернути `1137208419`. ```js assert.strictEqual(angularBisectorAndTangent(), 1137208419); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md index 55f3adbfd1c..baf49acb664 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-297-zeckendorf-representation.md @@ -26,7 +26,7 @@ Find $\sum z(n)$ for $0 < n < {10}^{17}$. # --hints-- -`zeckendorfRepresentation()` should return `2252639041804718000`. +`zeckendorfRepresentation()` має повернути `2252639041804718000`. ```js assert.strictEqual(zeckendorfRepresentation(), 2252639041804718000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md index da401b24b95..ae2aca616c9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-298-selective-amnesia.md @@ -31,7 +31,7 @@ Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected val # --hints-- -`selectiveAmnesia()` should return `1.76882294`. +`selectiveAmnesia()` має повернути `1.76882294`. ```js assert.strictEqual(selectiveAmnesia(), 1.76882294); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md index 5bd781949f5..c4d7c1a1da5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-299-three-similar-triangles.md @@ -30,7 +30,7 @@ If $b + d < 100\\,000\\,000$, how many distinct triplets ($a$, $b$, $d$) are # --hints-- -`threeSimilarTriangles()` should return `549936643`. +`threeSimilarTriangles()` має повернути `549936643`. ```js assert.strictEqual(threeSimilarTriangles(), 549936643); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md index d5f2020b784..dc56c44c51d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-201-to-300/problem-300-protein-folding.md @@ -30,7 +30,7 @@ What is the average number of H-H contact points in an optimal folding of a rand # --hints-- -`proteinFolding()` should return `8.0540771484375`. +`proteinFolding()` має повернути `8.0540771484375`. ```js assert.strictEqual(proteinFolding(), 8.0540771484375); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md index b66b1b9ae06..e87df67d16a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-301-nim.md @@ -32,7 +32,7 @@ For how many positive integers $n ≤ 2^{30}$ does $X(n, 2n, 3n) = 0$? # --hints-- -`nim()` should return `2178309`. +`nim()` має повернути `2178309`. ```js assert.strictEqual(nim(), 2178309); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md index 4c5301c49bf..b61af72cd9c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-302-strong-achilles-numbers.md @@ -24,7 +24,7 @@ How many Strong Achilles numbers are there below ${10}^{18}$? # --hints-- -`strongAchillesNumbers()` should return `1170060`. +`strongAchillesNumbers()` має повернути `1170060`. ```js assert.strictEqual(strongAchillesNumbers(), 1170060); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md index 108d8bd39fc..6a3659fded2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-303-multiples-with-small-digits.md @@ -18,7 +18,7 @@ Find $\displaystyle\sum_{n = 1}^{10\\,000} \frac{f(n)}{n}$. # --hints-- -`multiplesWithSmallDigits()` should return `1111981904675169`. +`multiplesWithSmallDigits()` має повернути `1111981904675169`. ```js assert.strictEqual(multiplesWithSmallDigits(), 1111981904675169); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md index a4939940a8f..7584f63f6c3 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-304-primonacci.md @@ -20,7 +20,7 @@ Find $\sum b(n)$ for $1≤n≤100\\,000$. Give your answer $\bmod 1\\,234\\,567\ # --hints-- -`primonacci()` should return `283988410192`. +`primonacci()` має повернути `283988410192`. ```js assert.strictEqual(primonacci(), 283988410192); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md index 566e7b7b76c..766647c6bc7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-305-reflexive-position.md @@ -20,7 +20,7 @@ Find $\sum f(3^k) for 1 ≤ k ≤ 13$. # --hints-- -`reflexivePosition()` should return `18174995535140`. +`reflexivePosition()` має повернути `18174995535140`. ```js assert.strictEqual(reflexivePosition(), 18174995535140); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-306-paper-strip-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-306-paper-strip-game.md index 3dd4604bc13..18e21028623 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-306-paper-strip-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-306-paper-strip-game.md @@ -28,7 +28,7 @@ For $1 ≤ n ≤ 1\\,000\\,000$, how many values of $n$ are there for which the # --hints-- -`paperStripGame()` should return `852938`. +`paperStripGame()` має повернути `852938`. ```js assert.strictEqual(paperStripGame(), 852938); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md index 3f0fd2be0cb..8fefaec03db 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-307-chip-defects.md @@ -16,7 +16,7 @@ Find $p(20\\,000, 1\\,000\\,000)$ and give your answer rounded to 10 decimal pla # --hints-- -`chipDefects()` should return `0.7311720251`. +`chipDefects()` має повернути `0.7311720251`. ```js assert.strictEqual(chipDefects(), 0.7311720251); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-308-an-amazing-prime-generating-automaton.md index 22f3cabc900..1d8046dfe46 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-308-an-amazing-prime-generating-automaton.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-308-an-amazing-prime-generating-automaton.md @@ -28,7 +28,7 @@ If someone uses the above Fractran program to solve Project Euler Problem 7 (fin # --hints-- -`primeGeneratingAutomation()` should return `1539669807660924`. +`primeGeneratingAutomation()` має повернути `1539669807660924`. ```js assert.strictEqual(primeGeneratingAutomation(), 1539669807660924); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-309-integer-ladders.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-309-integer-ladders.md index 721b756f533..4fc335e332a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-309-integer-ladders.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-309-integer-ladders.md @@ -20,7 +20,7 @@ For integer values $x$, $y$, $h$ and $0 < x < y < 1\\,000\\,000$, how m # --hints-- -`integerLadders()` should return `210139`. +`integerLadders()` має повернути `210139`. ```js assert.strictEqual(integerLadders(), 210139); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md index 4eacb352843..f5a36ae36f6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-310-nim-square.md @@ -20,7 +20,7 @@ Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c # --hints-- -`nimSquare()` should return `2586528661783`. +`nimSquare()` має повернути `2586528661783`. ```js assert.strictEqual(nimSquare(), 2586528661783); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md index 97736d98034..19fd4e1d9b6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-311-biclinic-integral-quadrilaterals.md @@ -24,7 +24,7 @@ Find $B(10\\,000\\,000\\,000)$. # --hints-- -`biclinicIntegralQuadrilaterals()` should return `2466018557`. +`biclinicIntegralQuadrilaterals()` має повернути `2466018557`. ```js assert.strictEqual(biclinicIntegralQuadrilaterals(), 2466018557); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md index 122f28f97dc..8d618e91c79 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-312-cyclic-paths-on-sierpiski-graphs.md @@ -27,7 +27,7 @@ Find $C(C(C(10\\,000)))\bmod {13}^8$. # --hints-- -`pathsOnSierpinskiGraphs()` should return `324681947`. +`pathsOnSierpinskiGraphs()` має повернути `324681947`. ```js assert.strictEqual(pathsOnSierpinskiGraphs(), 324681947); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md index 8f5726b71f4..633364d31c1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-313-sliding-game.md @@ -22,7 +22,7 @@ How many grids does $S(m, n) = p^2$, where $p < {10}^6$ is prime? # --hints-- -`slidingGame()` should return `2057774861813004`. +`slidingGame()` має повернути `2057774861813004`. ```js assert.strictEqual(slidingGame(), 2057774861813004); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md index 899395668c7..5aa68cea021 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-314-the-mouse-on-the-moon.md @@ -24,7 +24,7 @@ Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give y # --hints-- -`theMouseOnTheMoon()` should return `132.52756426`. +`theMouseOnTheMoon()` має повернути `132.52756426`. ```js assert.strictEqual(theMouseOnTheMoon(), 132.52756426); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md index 59389d4a7ff..b729dbc78ab 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-315-digital-root-clocks.md @@ -46,7 +46,7 @@ Of course, Max's clock consumes less power than Sam's one. The two clocks are fe # --hints-- -`digitalRootClocks()` should return `13625242`. +`digitalRootClocks()` має повернути `13625242`. ```js assert.strictEqual(digitalRootClocks(), 13625242); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md index 991df99ffa1..c4412f375e8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-316-numbers-in-decimal-expansions.md @@ -32,7 +32,7 @@ Given that $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\ # --hints-- -`numbersInDecimalExpansion()` should return `542934735751917760`. +`numbersInDecimalExpansion()` має повернути `542934735751917760`. ```js assert.strictEqual(numbersInDecimalExpansion(), 542934735751917760); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md index f9715cfd8df..aab7de86e17 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-317-firecracker.md @@ -16,7 +16,7 @@ Find the volume (in $\text{m}^3$) of the region through which the fragments move # --hints-- -`firecracker()` should return `1856532.8455`. +`firecracker()` має повернути `1856532.8455`. ```js assert.strictEqual(firecracker(), 1856532.8455); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md index f4b4f8315b5..8ae568bbfed 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-318-2011-nines.md @@ -30,7 +30,7 @@ Find $\sum N(p,q)$ for $p + q ≤ 2011$. # --hints-- -`twoThousandElevenNines()` should return `709313889`. +`twoThousandElevenNines()` має повернути `709313889`. ```js assert.strictEqual(twoThousandElevenNines(), 709313889); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md index 36341fac54b..34405be773c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-319-bounded-sequences.md @@ -22,7 +22,7 @@ Find $t({10}^{10})$ and give your answer modulo $10^9$. # --hints-- -`boundedSequences()` should return `268457129`. +`boundedSequences()` має повернути `268457129`. ```js assert.strictEqual(boundedSequences(), 268457129); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md index b0f0cc5c6ae..b520b86a34d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-320-factorials-divisible-by-a-huge-integer.md @@ -18,7 +18,7 @@ Find $S(1\\,000\\,000)\bmod {10}^{18}$. # --hints-- -`divisibleByHugeInteger()` should return `278157919195482660`. +`divisibleByHugeInteger()` має повернути `278157919195482660`. ```js assert.strictEqual(divisibleByHugeInteger(), 278157919195482660); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md index 177610fd3c7..b0e00cc9512 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-321-swapping-counters.md @@ -26,7 +26,7 @@ Find the sum of the first forty terms of this sequence. # --hints-- -`swappingCounters()` should return `2470433131948040`. +`swappingCounters()` має повернути `2470433131948040`. ```js assert.strictEqual(swappingCounters(), 2470433131948040); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md index 2c1725a5c4b..2699c7df0c4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-322-binomial-coefficients-divisible-by-10.md @@ -16,7 +16,7 @@ Find $T({10}^{18}, {10}^{12} - 10)$. # --hints-- -`binomialCoefficientsDivisibleBy10()` should return `999998760323314000`. +`binomialCoefficientsDivisibleBy10()` має повернути `999998760323314000`. ```js assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md index 7cd5acf36cc..77eecc1a2ef 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-323-bitwise-or-operations-on-random-integers.md @@ -21,7 +21,7 @@ Find the expected value of $N$. Give your answer rounded to 10 digits after the # --hints-- -`bitwiseOrOnRandomIntegers()` should return `6.3551758451`. +`bitwiseOrOnRandomIntegers()` має повернути `6.3551758451`. ```js assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md index e79296a5f0f..c9e51c9ac80 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-324-building-a-tower.md @@ -20,7 +20,7 @@ Find $f({10}^{10000})\bmod 100\\,000\\,007$. # --hints-- -`buildingTower()` should return `96972774`. +`buildingTower()` має повернути `96972774`. ```js assert.strictEqual(buildingTower(), 96972774); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md index b1392c1e246..60ad0090743 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-325-stone-game-ii.md @@ -24,7 +24,7 @@ Find $S({10}^{16})\bmod 7^{10}$. # --hints-- -`stoneGameTwo()` should return `54672965`. +`stoneGameTwo()` має повернути `54672965`. ```js assert.strictEqual(stoneGameTwo(), 54672965); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md index e43a4a9f23c..91eb2133801 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-326-modulo-summations.md @@ -24,7 +24,7 @@ Find $f({10}^{12}, {10}^6)$. # --hints-- -`moduloSummations()` should return `1966666166408794400`. +`moduloSummations()` має повернути `1966666166408794400`. ```js assert.strictEqual(moduloSummations(), 1966666166408794400); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md index d324e96908a..4174573af06 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-327-rooms-of-doom.md @@ -36,7 +36,7 @@ Find $\sum M(C, 30)$ for $3 ≤ C ≤ 40$. # --hints-- -`roomsOfDoom()` should return `34315549139516`. +`roomsOfDoom()` має повернути `34315549139516`. ```js assert.strictEqual(roomsOfDoom(), 34315549139516); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md index 3d3d44147e3..bb92922cf23 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-328-lowest-cost-search.md @@ -30,7 +30,7 @@ Find $\displaystyle\sum_{n = 1}^{200\\,000} C(n)$. # --hints-- -`lowestCostSearch()` should return `260511850222`. +`lowestCostSearch()` має повернути `260511850222`. ```js assert.strictEqual(lowestCostSearch(), 260511850222); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md index e14df07e58a..dfa7dea8e86 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-329-prime-frog.md @@ -22,13 +22,13 @@ Give your answer as a string as a fraction `p/q` in reduced form. # --hints-- -`primeFrog()` should return a string. +`primeFrog()` має повернути рядок. ```js assert(typeof primeFrog() === 'string'); ``` -`primeFrog()` should return the string `199740353/29386561536000`. +`primeFrog()` має повернути рядок `199740353/29386561536000`. ```js assert.strictEqual(primeFrog(), '199740353/29386561536000'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md index 33079aadd49..e552fff4f7b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-330-eulers-number.md @@ -28,7 +28,7 @@ Find $A({10}^9)$ + $B({10}^9)$ and give your answer $\bmod 77\\,777\\,777$. # --hints-- -`eulersNumber()` should return `15955822`. +`eulersNumber()` має повернути `15955822`. ```js assert.strictEqual(eulersNumber(), 15955822); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md index 84e5ffbdd51..881f7dca2e3 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-331-cross-flips.md @@ -26,7 +26,7 @@ Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$. # --hints-- -`crossFlips()` should return `467178235146843500`. +`crossFlips()` має повернути `467178235146843500`. ```js assert.strictEqual(crossFlips(), 467178235146843500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md index 54fe2d09a50..8a53207b22f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-332-spherical-triangles.md @@ -26,7 +26,7 @@ Find $\displaystyle \sum_{r = 1}^{50} A(r)$. Give your answer rounded to six dec # --hints-- -`sphericalTriangles()` should return `2717.751525`. +`sphericalTriangles()` має повернути `2717.751525`. ```js assert.strictEqual(sphericalTriangles(), 2717.751525); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md index 27cad095741..a4e8ab541b9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-333-special-partitions.md @@ -27,7 +27,7 @@ Find the sum of the primes $q < 1\\,000\\,000$ such that $P(q) = 1$. # --hints-- -`specialPartitions()` should return `3053105`. +`specialPartitions()` має повернути `3053105`. ```js assert.strictEqual(specialPartitions(), 3053105); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md index b301ac71594..b666a9ef601 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-334-spilling-the-beans.md @@ -27,7 +27,7 @@ Consider now 1500 adjacent bowls containing $b_1, b_2, \ldots, b_{1500}$ beans r # --hints-- -`spillingTheBeans()` should return `150320021261690850`. +`spillingTheBeans()` має повернути `150320021261690850`. ```js assert.strictEqual(spillingTheBeans(), 150320021261690850); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md index c1b35177c9b..65dd887b5f2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-335-gathering-the-beans.md @@ -20,7 +20,7 @@ Find $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Give your answer modulo # --hints-- -`gatheringTheBeans()` should return `5032316`. +`gatheringTheBeans()` має повернути `5032316`. ```js assert.strictEqual(gatheringTheBeans(), 5032316); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-336-maximix-arrangements.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-336-maximix-arrangements.md index c5df56c3d7b..cbeabe84a29 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-336-maximix-arrangements.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-336-maximix-arrangements.md @@ -26,13 +26,13 @@ Find the ${2011}^{\text{th}}$ lexicographic maximix arrangement for eleven carri # --hints-- -`maximixArrangements()` should return a string. +`maximixArrangements()` має повернути рядок. ```js assert(typeof maximixArrangements() === 'string'); ``` -`maximixArrangements()` should return the string `CAGBIHEFJDK`. +`maximixArrangements()` має повернути рядок `CAGBIHEFJDK`. ```js assert.strictEqual(maximixArrangements(), 'CAGBIHEFJDK'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md index ed090ed3f86..2428f251ad9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-337-totient-stairstep-sequences.md @@ -26,7 +26,7 @@ Find $S(20\\,000\\,000)\bmod {10}^8$. # --hints-- -`totientStairstepSequences()` should return `85068035`. +`totientStairstepSequences()` має повернути `85068035`. ```js assert.strictEqual(totientStairstepSequences(), 85068035); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md index 9a2143b65fd..e972457e324 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-338-cutting-rectangular-grid-paper.md @@ -26,7 +26,7 @@ Find $G({10}^{12})$. Give your answer modulo ${10}^8$. # --hints-- -`cuttingRectangularGridPaper()` should return `15614292`. +`cuttingRectangularGridPaper()` має повернути `15614292`. ```js assert.strictEqual(cuttingRectangularGridPaper(), 15614292); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md index 7c1934c581b..0fbc02f0778 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-339-peredur-fab-efrawg.md @@ -18,7 +18,7 @@ Find $E(10\\,000)$ and give your answer rounded to 6 places behind the decimal p # --hints-- -`peredurFabEfrawg()` should return `19823.542204`. +`peredurFabEfrawg()` має повернути `19823.542204`. ```js assert.strictEqual(peredurFabEfrawg(), 19823.542204); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-340-crazy-function.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-340-crazy-function.md index 72da02c1095..da77842c53d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-340-crazy-function.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-340-crazy-function.md @@ -21,7 +21,7 @@ Find the last 9 digits of $S({21}^7, 7^{21}, {12}^7)$. # --hints-- -`crazyFunction()` should return `291504964`. +`crazyFunction()` має повернути `291504964`. ```js assert.strictEqual(crazyFunction(), 291504964); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md index f3ebbd9cdd0..24a089641b4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-341-golombs-self-describing-sequence.md @@ -21,7 +21,7 @@ Find $\sum G(n^3)$ for $1 ≤ n < {10}^6$. # --hints-- -`golombsSequence()` should return `56098610614277016`. +`golombsSequence()` має повернути `56098610614277016`. ```js assert.strictEqual(golombsSequence(), 56098610614277016); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md index 85990bc5b54..e89be346215 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-342-the-totient-of-a-square-is-a-cube.md @@ -19,7 +19,7 @@ Find the sum of all numbers $n$, $1 < n < {10}^{10}$ such that $φ(n^2)$ i # --hints-- -`totientOfSquare()` should return `5943040885644`. +`totientOfSquare()` має повернути `5943040885644`. ```js assert.strictEqual(totientOfSquare(), 5943040885644); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md index f284af9e94b..0807562b90d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-343-fractional-sequences.md @@ -29,7 +29,7 @@ Find $\sum f(k^3)$ for $1 ≤ k ≤ 2 × {10}^6$. # --hints-- -`fractionalSequences()` should return `269533451410884200`. +`fractionalSequences()` має повернути `269533451410884200`. ```js assert.strictEqual(fractionalSequences(), 269533451410884200); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md index 0f9fcc5f2e6..c6751de65f7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-344-silver-dollar-game.md @@ -30,7 +30,7 @@ Find $W(1\\,000\\,000, 100)$ modulo the semiprime $1000\\,036\\,000\\,099 (= 1\\ # --hints-- -`silverDollarGame()` should return `65579304332`. +`silverDollarGame()` має повернути `65579304332`. ```js assert.strictEqual(silverDollarGame(), 65579304332); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md index 19aa26fd74f..edbc67f3b2f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-345-matrix-sum.md @@ -29,7 +29,7 @@ $$\\begin{array}{r} 7 & 53 & 183 & 439 & 863 & 497 & 383 & 563 & 79 & 973 # --hints-- -`matrixSum()` should return `13938`. +`matrixSum()` має повернути `13938`. ```js assert.strictEqual(matrixSum(), 13938); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md index 98b7cc48b2f..66a5f8ddbc9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-346-strong-repunits.md @@ -16,7 +16,7 @@ Find the sum of all strong repunits below ${10}^{12}$. # --hints-- -`strongRepunits()` should return `336108797689259260`. +`strongRepunits()` має повернути `336108797689259260`. ```js assert.strictEqual(strongRepunits(), 336108797689259260); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md index 15174e82655..742455273b2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-347-largest-integer-divisible-by-two-primes.md @@ -22,7 +22,7 @@ Find $S(10\\,000\\,000)$. # --hints-- -`integerDivisibleByTwoPrimes()` should return `11109800204052`. +`integerDivisibleByTwoPrimes()` має повернути `11109800204052`. ```js assert.strictEqual(integerDivisibleByTwoPrimes(), 11109800204052); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md index 8e69b16ca7a..586b2d46393 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-348-sum-of-a-square-and-a-cube.md @@ -22,7 +22,7 @@ Find the sum of the five smallest such palindromic numbers. # --hints-- -`sumOfSquareAndCube()` should return `1004195061`. +`sumOfSquareAndCube()` має повернути `1004195061`. ```js assert.strictEqual(sumOfSquareAndCube(), 1004195061); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md index 71fe17860a2..248bc017dd6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-349-langtons-ant.md @@ -19,7 +19,7 @@ Starting with a grid that is entirely white, how many squares are black after ${ # --hints-- -`langtonsAnt()` should return `115384615384614940`. +`langtonsAnt()` має повернути `115384615384614940`. ```js assert.strictEqual(langtonsAnt(), 115384615384614940); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md index b40eb3cd67a..a17f9291cfd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-350-constraining-the-least-greatest-and-the-greatest-least.md @@ -24,7 +24,7 @@ Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$. # --hints-- -`leastGreatestAndGreatestLeast()` should return `84664213`. +`leastGreatestAndGreatestLeast()` має повернути `84664213`. ```js assert.strictEqual(leastGreatestAndGreatestLeast(), 84664213); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md index fa6811e9185..276bf7753d0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-351-hexagonal-orchards.md @@ -22,7 +22,7 @@ Find $H(100\\,000\\,000)$. # --hints-- -`hexagonalOrchards()` should return `11762187201804552`. +`hexagonalOrchards()` має повернути `11762187201804552`. ```js assert.strictEqual(hexagonalOrchards(), 11762187201804552); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md index b0de4ec7213..65c9860b8ea 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-352-blood-tests.md @@ -44,7 +44,7 @@ Find $\sum T(10\\,000, p)$ for $p = 0.01, 0.02, 0.03, \ldots 0.50$. Give your an # --hints-- -`bloodTests()` should return `378563.260589`. +`bloodTests()` має повернути `378563.260589`. ```js assert.strictEqual(bloodTests(), 378563.260589); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md index 83cb0d40c9e..bc570576512 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-353-risky-moon.md @@ -28,7 +28,7 @@ Give your answer rounded to 10 digits behind the decimal point in the form a.bcd # --hints-- -`riskyMoon()` should return `1.2759860331`. +`riskyMoon()` має повернути `1.2759860331`. ```js assert.strictEqual(riskyMoon(), 1.2759860331); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md index f7d023146ca..97ab47f374b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-354-distances-in-a-bees-honeycomb.md @@ -20,7 +20,7 @@ Find the number of $L ≤ 5 \times {10}^{11}$ such that $B(L) = 450$. # --hints-- -`distancesInHoneycomb()` should return `58065134`. +`distancesInHoneycomb()` має повернути `58065134`. ```js assert.strictEqual(distancesInHoneycomb(), 58065134); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md index a7e2179ec87..80676c597d7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-355-maximal-coprime-subset.md @@ -16,7 +16,7 @@ Find $Co(200\\,000)$. # --hints-- -`maximalCoprimeSubset()` should return `1726545007`. +`maximalCoprimeSubset()` має повернути `1726545007`. ```js assert.strictEqual(maximalCoprimeSubset(), 1726545007); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md index ec4939b68f1..eeb450e19a9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-356-largest-roots-of-cubic-polynomials.md @@ -18,7 +18,7 @@ Find the last eight digits of $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987 # --hints-- -`rootsOfCubicPolynomials()` should return `28010159`. +`rootsOfCubicPolynomials()` має повернути `28010159`. ```js assert.strictEqual(rootsOfCubicPolynomials(), 28010159); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md index 003fc35bdd6..4b65d655292 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-357-prime-generating-integers.md @@ -16,7 +16,7 @@ Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such t # --hints-- -`primeGeneratingIntegers()` should return `1739023853137`. +`primeGeneratingIntegers()` має повернути `1739023853137`. ```js assert.strictEqual(primeGeneratingIntegers(), 1739023853137); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md index 9a7f94d3bff..99c0dc66fa4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-358-cyclic-numbers.md @@ -31,7 +31,7 @@ There is only one cyclic number for which, the eleven leftmost digits are 000000 # --hints-- -`cyclicNumbers()` should return `3284144505`. +`cyclicNumbers()` має повернути `3284144505`. ```js assert.strictEqual(cyclicNumbers(), 3284144505); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md index 0cfd6a75f09..5ffee337454 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-359-hilberts-new-hotel.md @@ -36,7 +36,7 @@ Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 7 # --hints-- -`hilbertsNewHotel()` should return `40632119`. +`hilbertsNewHotel()` має повернути `40632119`. ```js assert.strictEqual(hilbertsNewHotel(), 40632119); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md index 932a0a9dc4e..aa2206f6c72 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-360-scary-sphere.md @@ -22,7 +22,7 @@ Find $S({10}^{10})$. # --hints-- -`scarySphere()` should return `878825614395267100`. +`scarySphere()` має повернути `878825614395267100`. ```js assert.strictEqual(scarySphere(), 878825614395267100); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md index efae1fb220c..363939307cd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-361-subsequence-of-thue-morse-sequence.md @@ -29,7 +29,7 @@ Find the last 9 digits of $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$. # --hints-- -`subsequenceOfThueMorseSequence()` should return `178476944`. +`subsequenceOfThueMorseSequence()` має повернути `178476944`. ```js assert.strictEqual(subsequenceOfThueMorseSequence(), 178476944); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md index 19f6b0f9cdc..78c08eac144 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-362-squarefree-factors.md @@ -26,7 +26,7 @@ Find $S(10\\,000\\,000\\,000)$. # --hints-- -`squarefreeFactors()` should return `457895958010`. +`squarefreeFactors()` має повернути `457895958010`. ```js assert.strictEqual(squarefreeFactors(), 457895958010); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md index df13df6a0c5..7727f804a33 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-363-bzier-curves.md @@ -30,7 +30,7 @@ By how many percent does the length of the curve differ from the length of the q # --hints-- -`bezierCurves()` should return `0.0000372091`. +`bezierCurves()` має повернути `0.0000372091`. ```js assert.strictEqual(bezierCurves(), 0.0000372091); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-364-comfortable-distance.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-364-comfortable-distance.md index 83f8f7ec5d4..5c702ef9aeb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-364-comfortable-distance.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-364-comfortable-distance.md @@ -24,7 +24,7 @@ Find $T(1\\,000\\,000)\bmod 100\\,000\\,007$. # --hints-- -`comfortableDistance()` should return `44855254`. +`comfortableDistance()` має повернути `44855254`. ```js assert.strictEqual(comfortableDistance(), 44855254); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md index 46dc7abf5d6..7e5098aa35e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-365-a-huge-binomial-coefficient.md @@ -16,7 +16,7 @@ Calculate $\sum M({10}^{18}, {10}^9, p \times q \times r)$ for $1000 < p < # --hints-- -`hugeBinomialCoefficient()` should return `162619462356610300`. +`hugeBinomialCoefficient()` має повернути `162619462356610300`. ```js assert.strictEqual(hugeBinomialCoefficient(), 162619462356610300); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md index e4c51cb8c50..42fb608512d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-366-stone-game-iii.md @@ -42,7 +42,7 @@ Find $\sum M(n)$ for $n ≤ {10}^{18}$. Give your answer modulo ${10}^8$. # --hints-- -`stoneGameThree()` should return `88351299`. +`stoneGameThree()` має повернути `88351299`. ```js assert.strictEqual(stoneGameThree(), 88351299); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md index 01a24b3c665..c77c2bb2fe0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-367-bozo-sort.md @@ -30,7 +30,7 @@ Averaged over all $11!$ input sequences, what is the expected number of shuffles # --hints-- -`bozoSort()` should return `48271207`. +`bozoSort()` має повернути `48271207`. ```js assert.strictEqual(bozoSort(), 48271207); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md index afc2e6dc9b8..17db1f2d70b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-368-a-kempner-like-series.md @@ -25,7 +25,7 @@ Find the value the series converges to. Give your answer rounded to 10 digits be # --hints-- -`kempnerLikeSeries()` should return `253.6135092068`. +`kempnerLikeSeries()` має повернути `253.6135092068`. ```js assert.strictEqual(kempnerLikeSeries(), 253.6135092068); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md index b297bf965da..7e15bdf229f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-369-badugi.md @@ -16,7 +16,7 @@ Find $\sum f(n)$ for $4 ≤ n ≤ 13$. # --hints-- -`badugi()` should return `862400558448`. +`badugi()` має повернути `862400558448`. ```js assert.strictEqual(badugi(), 862400558448); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md index dd37d167a05..cc2550a4903 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-370-geometric-triangles.md @@ -18,7 +18,7 @@ How many geometric triangles exist with $\text{perimeter} ≤ 2.5 \times {10}^{1 # --hints-- -`geometricTriangles()` should return `41791929448408`. +`geometricTriangles()` має повернути `41791929448408`. ```js assert.strictEqual(geometricTriangles(), 41791929448408); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-371-licence-plates.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-371-licence-plates.md index dee9928047e..328eece326b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-371-licence-plates.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-371-licence-plates.md @@ -22,7 +22,7 @@ Find the expected number of plates he needs to see for a win. Give your answer r # --hints-- -`licensePlates()` should return `40.66368097`. +`licensePlates()` має повернути `40.66368097`. ```js assert.strictEqual(licensePlates(), 40.66368097); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md index 9a8e0ff315d..73110abcd59 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-372-pencils-of-rays.md @@ -18,7 +18,7 @@ Find $R(2 \times {10}^6, {10}^9)$. # --hints-- -`pencilsOfRays()` should return `301450082318807040`. +`pencilsOfRays()` має повернути `301450082318807040`. ```js assert.strictEqual(pencilsOfRays(), 301450082318807040); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md index dbe4e1d47e4..4c02972c267 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-373-circumscribed-circles.md @@ -18,7 +18,7 @@ Find $S({10}^7)$. # --hints-- -`circumscribedCircles()` should return `727227472448913`. +`circumscribedCircles()` має повернути `727227472448913`. ```js assert.strictEqual(circumscribedCircles(), 727227472448913); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md index e2578270e64..535b95ee8e2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-374-maximum-integer-partition-product.md @@ -28,7 +28,7 @@ Find $\sum f(n) \times m(n)$ for $1 ≤ n ≤ {10}^{14}$. Give your answer modul # --hints-- -`maximumIntegerPartitionProduct()` should return `334420941`. +`maximumIntegerPartitionProduct()` має повернути `334420941`. ```js assert.strictEqual(maximumIntegerPartitionProduct(), 334420941); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md index 082d94ef69c..c78e0096452 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-375-minimum-of-subsequences.md @@ -21,7 +21,7 @@ Find $M(2\\,000\\,000\\,000)$. # --hints-- -`minimumOfSubsequences()` should return `7435327983715286000`. +`minimumOfSubsequences()` має повернути `7435327983715286000`. ```js assert.strictEqual(minimumOfSubsequences(), 7435327983715286000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md index 344a1e84e90..222a3489912 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-376-nontransitive-sets-of-dice.md @@ -43,7 +43,7 @@ How many are there for $N = 30$? # --hints-- -`nontransitiveSetsOfDice()` should return `973059630185670`. +`nontransitiveSetsOfDice()` має повернути `973059630185670`. ```js assert.strictEqual(nontransitiveSetsOfDice(), 973059630185670); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md index ff149a27b28..ce3ef1f4da5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-377-sum-of-digits-experience-13.md @@ -20,7 +20,7 @@ Find $\displaystyle\sum_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answ # --hints-- -`experience13()` should return `732385277`. +`experience13()` має повернути `732385277`. ```js assert.strictEqual(experience13(), 732385277); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md index e72ba4316c9..ca4a0bbf0bb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-378-triangle-triples.md @@ -18,7 +18,7 @@ Find $Tr(60\\,000\\,000)$. Give the last 18 digits of your answer. # --hints-- -`triangleTriples()` should return `147534623725724700`. +`triangleTriples()` має повернути `147534623725724700`. ```js assert.strictEqual(triangleTriples(), 147534623725724700); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md index 0f2fb896572..2afa0b86f9d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-379-least-common-multiple-count.md @@ -18,7 +18,7 @@ Find $g({10}^{12})$. # --hints-- -`leastCommonMultipleCount()` should return `132314136838185`. +`leastCommonMultipleCount()` має повернути `132314136838185`. ```js assert.strictEqual(leastCommonMultipleCount(), 132314136838185); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md index 15ae5170a74..02e2bc8a1c9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-380-amazing-mazes.md @@ -22,13 +22,13 @@ When giving your answer, use a lowercase e to separate mantissa and exponent. E. # --hints-- -`amazingMazes()` should return a string. +`amazingMazes()` має повернути рядок. ```js assert(typeof amazingMazes() === 'string'); ``` -`amazingMazes()` should return the string `6.3202e25093`. +`amazingMazes()` має повернути рядок `6.3202e25093`. ```js assert.strictEqual(amazingMazes(), '6.3202e25093'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md index 21d1936ca57..78f7bd6f27e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-381-prime-k-factorial.md @@ -22,7 +22,7 @@ Find $\sum S(p)$ for $5 ≤ p < {10}^8$. # --hints-- -`primeKFactorial()` should return `139602943319822`. +`primeKFactorial()` має повернути `139602943319822`. ```js assert.strictEqual(primeKFactorial(), 139602943319822); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md index 605495d8fed..d771c663b44 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-382-generating-polygons.md @@ -39,7 +39,7 @@ Find the last 9 digits of $f({10}^{18})$. # --hints-- -`generatingPolygons()` should return `697003956`. +`generatingPolygons()` має повернути `697003956`. ```js assert.strictEqual(generatingPolygons(), 697003956); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md index 4a851985199..1414ba0a3ae 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-383-divisibility-comparison-between-factorials.md @@ -20,7 +20,7 @@ Find $T_5({10}^{18})$. # --hints-- -`factorialDivisibilityComparison()` should return `22173624649806`. +`factorialDivisibilityComparison()` має повернути `22173624649806`. ```js assert.strictEqual(factorialDivisibilityComparison(), 22173624649806); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md index 9f11652c82f..44847d1babd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-384-rudin-shapiro-sequence.md @@ -39,7 +39,7 @@ Find $\sum GF(t)$ for$ 2 ≤ t ≤ 45$. # --hints-- -`rudinShapiroSequence()` should return `3354706415856333000`. +`rudinShapiroSequence()` має повернути `3354706415856333000`. ```js assert.strictEqual(rudinShapiroSequence(), 3354706415856333000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md index 13dcc0e7c5c..c4fde0e4018 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-385-ellipses-inside-triangles.md @@ -29,7 +29,7 @@ Find $A(1\\,000\\,000\\,000)$. # --hints-- -`ellipsesInsideTriangles()` should return `3776957309612154000`. +`ellipsesInsideTriangles()` має повернути `3776957309612154000`. ```js assert.strictEqual(ellipsesInsideTriangles(), 3776957309612154000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md index de0614e4651..47081426b9a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-386-maximum-length-of-an-antichain.md @@ -24,7 +24,7 @@ Find $\sum N(n)$ for $1 ≤ n ≤ {10}^8$ # --hints-- -`maximumLengthOfAntichain()` should return `528755790`. +`maximumLengthOfAntichain()` має повернути `528755790`. ```js assert.strictEqual(maximumLengthOfAntichain(), 528755790); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-387-harshad-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-387-harshad-numbers.md index 2b2ccbbaa0e..faeb32857d9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-387-harshad-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-387-harshad-numbers.md @@ -32,7 +32,7 @@ Find the sum of the strong, right truncatable Harshad primes less than ${10}^{14 # --hints-- -`harshadNumbers()` should return `696067597313468`. +`harshadNumbers()` має повернути `696067597313468`. ```js assert.strictEqual(harshadNumbers(), 696067597313468); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-388-distinct-lines.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-388-distinct-lines.md index 4ff7f140070..532430ddbe0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-388-distinct-lines.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-388-distinct-lines.md @@ -18,7 +18,7 @@ Find $D({10}^{10})$. Give as your answer the first nine digits followed by the l # --hints-- -`distinctLines()` should return `831907372805130000`. +`distinctLines()` має повернути `831907372805130000`. ```js assert.strictEqual(distinctLines(), 831907372805130000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md index 081791ffe3b..fdaedd48ae2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-389-platonic-dice.md @@ -22,7 +22,7 @@ Find the variance of $I$, and give your answer rounded to 4 decimal places. # --hints-- -`platonicDice()` should return `2406376.3623`. +`platonicDice()` має повернути `2406376.3623`. ```js assert.strictEqual(platonicDice(), 2406376.3623); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-390-triangles-with-non-rational-sides-and-integral-area.md index fa9e6f08884..2d2a30de23f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-390-triangles-with-non-rational-sides-and-integral-area.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-390-triangles-with-non-rational-sides-and-integral-area.md @@ -20,7 +20,7 @@ Find $S({10}^{10})$. # --hints-- -`nonRationalSidesAndIntegralArea()` should return `2919133642971`. +`nonRationalSidesAndIntegralArea()` має повернути `2919133642971`. ```js assert.strictEqual(nonRationalSidesAndIntegralArea(), 2919133642971); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md index e94e14e527b..daf76b7f42c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-391-hopping-game.md @@ -33,7 +33,7 @@ Find $\sum M{(n)}^3$ for $1 ≤ n ≤ 1000$. # --hints-- -`hoppingGame()` should return `61029882288`. +`hoppingGame()` має повернути `61029882288`. ```js assert.strictEqual(hoppingGame(), 61029882288); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md index 7e40a574c29..d4b32c9c7b4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-392-enmeshed-unit-circle.md @@ -32,7 +32,7 @@ Find the positions for $N = 400$. Give as your answer the area occupied by the r # --hints-- -`enmeshedUnitCircle()` should return `3.1486734435`. +`enmeshedUnitCircle()` має повернути `3.1486734435`. ```js assert.strictEqual(enmeshedUnitCircle(), 3.1486734435); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md index 28a0b4d745c..f07f60df59c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-393-migrating-ants.md @@ -20,7 +20,7 @@ Find $f(10)$. # --hints-- -`migratingAnts()` should return `112398351350823100`. +`migratingAnts()` має повернути `112398351350823100`. ```js assert.strictEqual(migratingAnts(), 112398351350823100); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md index a6b40bf39bc..2317988407a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-394-eating-pie.md @@ -27,7 +27,7 @@ Find $E(40)$ rounded to 10 decimal places behind the decimal point. # --hints-- -`eatingPie()` should return `3.2370342194`. +`eatingPie()` має повернути `3.2370342194`. ```js assert.strictEqual(eatingPie(), 3.2370342194); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md index cff705c06fb..a3589b76071 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-395-pythagorean-tree.md @@ -26,7 +26,7 @@ Find the smallest area possible for such a bounding rectangle, and give your ans # --hints-- -`pythagoreanTree()` should return `28.2453753155`. +`pythagoreanTree()` має повернути `28.2453753155`. ```js assert.strictEqual(pythagoreanTree(), 28.2453753155); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md index 33d738c128b..8dc1d8ba10e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-396-weak-goodstein-sequence.md @@ -36,7 +36,7 @@ Find the last 9 digits of $\sum G(n)$ for $1 ≤ n < 16$. # --hints-- -`weakGoodsteinSequence()` should return `173214653`. +`weakGoodsteinSequence()` має повернути `173214653`. ```js assert.strictEqual(weakGoodsteinSequence(), 173214653); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md index 2d9fc181db3..31b5921b580 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-397-triangle-on-parabola.md @@ -18,7 +18,7 @@ Find $F({10}^6, {10}^9)$. # --hints-- -`triangleOnParabola()` should return `141630459461893730`. +`triangleOnParabola()` має повернути `141630459461893730`. ```js assert.strictEqual(triangleOnParabola(), 141630459461893730); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md index ade33707928..413d547259f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-398-cutting-rope.md @@ -16,7 +16,7 @@ Find $E({10}^7, 100)$. Give your answer rounded to 5 decimal places behind the d # --hints-- -`cuttingRope()` should return `2010.59096`. +`cuttingRope()` має повернути `2010.59096`. ```js assert.strictEqual(cuttingRope(), 2010.59096); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md index 37a34ad1549..82aff868557 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-399-squarefree-fibonacci-numbers.md @@ -28,13 +28,13 @@ If it happens that the conjecture is false, then the accepted answer to this pro # --hints-- -`squarefreeFibonacciNumbers()` should return a string. +`squarefreeFibonacciNumbers()` має повернути рядок. ```js assert(typeof squarefreeFibonacciNumbers() === 'string'); ``` -`squarefreeFibonacciNumbers()` should return the string `1508395636674243,6.5e27330467`. +`squarefreeFibonacciNumbers()` має повернути рядок `1508395636674243,6.5e27330467`. ```js assert.strictEqual(squarefreeFibonacciNumbers(), '1508395636674243,6.5e27330467'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md index 2b2e220949c..fc70240d3e5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-301-to-400/problem-400-fibonacci-tree-game.md @@ -28,7 +28,7 @@ Find $f(10000)$. Give the last 18 digits of your answer. # --hints-- -`fibonacciTreeGame()` should return `438505383468410600`. +`fibonacciTreeGame()` має повернути `438505383468410600`. ```js assert.strictEqual(fibonacciTreeGame(), 438505383468410600); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md index eb0c0459100..de969b94a06 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-401-sum-of-squares-of-divisors.md @@ -20,7 +20,7 @@ Find $\Sigma_2({10}^{15})$ modulo ${10}^9$. # --hints-- -`sumOfSquaresDivisors()` should return `281632621`. +`sumOfSquaresDivisors()` має повернути `281632621`. ```js assert.strictEqual(sumOfSquaresDivisors(), 281632621); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md index cdda26ea631..1ad23b60f33 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-402-integer-valued-polynomials.md @@ -25,7 +25,7 @@ Find the last 9 digits of $\sum S(F_k)$ for $2 ≤ k ≤ 1\\,234\\,567\\,890\\,1 # --hints-- -`integerValuedPolynomials()` should return `356019862`. +`integerValuedPolynomials()` має повернути `356019862`. ```js assert.strictEqual(integerValuedPolynomials(), 356019862); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md index e3f8bfaae35..9188e90af9d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-403-lattice-points-enclosed-by-parabola-and-line.md @@ -20,7 +20,7 @@ Find $S({10}^{12})$. Give your answer $\bmod {10}^8$. # --hints-- -`latticePoints()` should return `18224771`. +`latticePoints()` має повернути `18224771`. ```js assert.strictEqual(latticePoints(), 18224771); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-404-crisscross-ellipses.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-404-crisscross-ellipses.md index 92690bd7a6d..9159c6495ea 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-404-crisscross-ellipses.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-404-crisscross-ellipses.md @@ -28,7 +28,7 @@ Find $C({10}^{17})$. # --hints-- -`crisscrossEllipses()` should return `1199215615081353`. +`crisscrossEllipses()` має повернути `1199215615081353`. ```js assert.strictEqual(crisscrossEllipses(), 1199215615081353); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md index 43ceb097a66..e27683695f8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-405-a-rectangular-tiling.md @@ -26,7 +26,7 @@ Find $f({10}^k)$ for $k = {10}^{18}$, give your answer modulo ${17}^7$. # --hints-- -`rectangularTiling()` should return `237696125`. +`rectangularTiling()` має повернути `237696125`. ```js assert.strictEqual(rectangularTiling(), 237696125); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md index 6907ad6dae2..b0dd71f6bb5 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-406-guessing-game.md @@ -42,7 +42,7 @@ Find $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$, and gi # --hints-- -`guessingGame()` should return `36813.12757207`. +`guessingGame()` має повернути `36813.12757207`. ```js assert.strictEqual(guessingGame(), 36813.12757207); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md index f676b0c5b6e..cdfe519f780 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-407-idempotents.md @@ -18,7 +18,7 @@ Find $\sum M(n)$ for $1 ≤ n ≤ {10}^7$. # --hints-- -`idempotents()` should return `39782849136421`. +`idempotents()` має повернути `39782849136421`. ```js assert.strictEqual(idempotents(), 39782849136421); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md index 260a1917a56..1cf7292da08 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-408-admissible-paths-through-a-grid.md @@ -20,7 +20,7 @@ Find $P(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$. # --hints-- -`admissiblePaths()` should return `299742733`. +`admissiblePaths()` має повернути `299742733`. ```js assert.strictEqual(admissiblePaths(), 299742733); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md index 735a1c77781..666640ba0d7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-409-nim-extreme.md @@ -22,7 +22,7 @@ Find $W(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$. # --hints-- -`nimExtreme()` should return `253223948`. +`nimExtreme()` має повернути `253223948`. ```js assert.strictEqual(nimExtreme(), 253223948); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md index fd9d28a1bab..9ea98e44246 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-410-circle-and-tangent-line.md @@ -20,7 +20,7 @@ Find $F({10}^8, {10}^9) + F({10}^9, {10}^8)$. # --hints-- -`circleAndTangentLine()` should return `799999783589946600`. +`circleAndTangentLine()` має повернути `799999783589946600`. ```js assert.strictEqual(circleAndTangentLine(), 799999783589946600); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md index 09ace26cdea..bbbac0fc5ce 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-411-uphill-paths.md @@ -24,7 +24,7 @@ Find $\sum S(k^5)$ for $1 ≤ k ≤ 30$. # --hints-- -`uphillPaths()` should return `9936352`. +`uphillPaths()` має повернути `9936352`. ```js assert.strictEqual(uphillPaths(), 9936352); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md index ac00f985c10..510eb2c2a0f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-412-gnomon-numbering.md @@ -26,7 +26,7 @@ Find $LC(10\\,000, 5\\,000)\bmod 76\\,543\\,217$. # --hints-- -`gnomonNumbering()` should return `38788800`. +`gnomonNumbering()` має повернути `38788800`. ```js assert.strictEqual(gnomonNumbering(), 38788800); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md index 0a50da9e14d..57682c4dd4c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-413-one-child-numbers.md @@ -20,7 +20,7 @@ Find $F({10}^{19})$. # --hints-- -`oneChildNumbers()` should return `3079418648040719`. +`oneChildNumbers()` має повернути `3079418648040719`. ```js assert.strictEqual(oneChildNumbers(), 3079418648040719); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md index e50ab2c9a7e..2bc93d84f43 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-414-kaprekar-constant.md @@ -38,7 +38,7 @@ Find the sum of $S(6k + 3)$ for $2 ≤ k ≤ 300$. Give the last 18 digits as yo # --hints-- -`kaprekarConstant()` should return `552506775824935500`. +`kaprekarConstant()` має повернути `552506775824935500`. ```js assert.strictEqual(kaprekarConstant(), 552506775824935500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-415-titanic-sets.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-415-titanic-sets.md index a03c026f9ae..103606d79ce 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-415-titanic-sets.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-415-titanic-sets.md @@ -20,7 +20,7 @@ Find $T({10}^{11})\bmod {10}^8$. # --hints-- -`titanicSets()` should return `55859742`. +`titanicSets()` має повернути `55859742`. ```js assert.strictEqual(titanicSets(), 55859742); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md index 048adb254cd..63a02bd8605 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-416-a-frogs-trip.md @@ -18,7 +18,7 @@ Find the last 9 digits of $F(10, {10}^{12})$. # --hints-- -`frogsTrip()` should return `898082747`. +`frogsTrip()` має повернути `898082747`. ```js assert.strictEqual(frogsTrip(), 898082747); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md index aa0880c13f4..6eee514607c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-417-reciprocal-cycles-ii.md @@ -27,7 +27,7 @@ Find $\sum L(n)$ for $3 ≤ n ≤ 100\\,000\\,000$. # --hints-- -`reciprocalCyclesTwo()` should return `446572970925740`. +`reciprocalCyclesTwo()` має повернути `446572970925740`. ```js assert.strictEqual(reciprocalCyclesTwo(), 446572970925740); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md index 0c376474a32..12191c80c21 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-418-factorisation-triples.md @@ -21,7 +21,7 @@ Find $f(43!)$. # --hints-- -`factorisationTriples()` should return `1177163565297340400`. +`factorisationTriples()` має повернути `1177163565297340400`. ```js assert.strictEqual(factorisationTriples(), 1177163565297340400); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md index 4143ab36ccb..ee51cf6e478 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-419-look-and-say-sequence.md @@ -32,14 +32,14 @@ Find $A(n)$, $B(n)$ and $C(n)$ for $n = {10}^{12}$. Give your answer modulo $2^{ # --hints-- -`lookAndSaySequence()` should return a string. +`lookAndSaySequence()` має повернути рядок. ```js assert(typeof lookAndSaySequence() === 'string'); ``` -`lookAndSaySequence()` should return the string `998567458,1046245404,43363922`. +`lookAndSaySequence()` має повернути рядок `998567458,1046245404,43363922`. ```js assert.strictEqual(lookAndSaySequence(), '998567458,1046245404,43363922'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md index 50a7c676cb8..c831e65493c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-420-2x2-positive-integer-matrix.md @@ -29,7 +29,7 @@ Find $F({10}^7)$. # --hints-- -`positiveIntegerMatrix()` should return `145159332`. +`positiveIntegerMatrix()` має повернути `145159332`. ```js assert.strictEqual(positiveIntegerMatrix(), 145159332); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md index f94cb95bc48..42b0dbd43bc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-421-prime-factors-of-n151.md @@ -24,7 +24,7 @@ Find $\sum s(n, {10}^8)$ for $1 ≤ n ≤ {10}^{11}$. # --hints-- -`primeFactorsOfN15Plus1()` should return `2304215802083466200`. +`primeFactorsOfN15Plus1()` має повернути `2304215802083466200`. ```js assert.strictEqual(primeFactorsOfN15Plus1(), 2304215802083466200); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md index 7ea875b71ab..b0ab986f4cc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-422-sequence-of-points-on-a-hyperbola.md @@ -28,7 +28,7 @@ For $n = 7$, the answer would have been: $806\\,236\\,837$. # --hints-- -`sequenceOfPointsOnHyperbola()` should return `92060460`. +`sequenceOfPointsOnHyperbola()` має повернути `92060460`. ```js assert.strictEqual(sequenceOfPointsOnHyperbola(), 92060460); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md index 9969311f0de..8e48ab572dd 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-423-consecutive-die-throws.md @@ -33,7 +33,7 @@ Find $S(50\\,000\\,000)\bmod 1\\,000\\,000\\,007$. # --hints-- -`consecutiveDieThrows()` should return `653972374`. +`consecutiveDieThrows()` має повернути `653972374`. ```js assert.strictEqual(consecutiveDieThrows(), 653972374); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-424-kakuro.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-424-kakuro.md index 90b1b38773f..9064f3c6373 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-424-kakuro.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-424-kakuro.md @@ -38,7 +38,7 @@ Find the sum of the answers for `puzzles` array. # --hints-- -`kakuro(testPuzzles)` should return `1059760019628`. +`kakuro(testPuzzles)` має повернути `1059760019628`. ```js assert.strictEqual(kakuro(_testPuzzles), 1059760019628); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md index dfba791e407..97b1ca885b6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-425-prime-connection.md @@ -27,7 +27,7 @@ Find $F({10}^7)$. # --hints-- -`primeConnection()` should return `46479497324`. +`primeConnection()` має повернути `46479497324`. ```js assert.strictEqual(primeConnection(), 46479497324); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md index 89314f8aa76..c13fa73974f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-426-box-ball-system.md @@ -35,7 +35,7 @@ Give as your answer the sum of the squares of the elements of the final state. F # --hints-- -`boxBallSystem()` should return `31591886008`. +`boxBallSystem()` має повернути `31591886008`. ```js assert.strictEqual(boxBallSystem(), 31591886008); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md index 3f244f7937c..61736a1af51 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-427-n-sequences.md @@ -22,7 +22,7 @@ Find $f(7\\,500\\,000)\bmod 1\\,000\\,000\\,009$. # --hints-- -`nSequences()` should return `97138867`. +`nSequences()` має повернути `97138867`. ```js assert.strictEqual(nSequences(), 97138867); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md index bf6e6bdaa12..29631a4a75b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-428-necklace-of-circles.md @@ -33,7 +33,7 @@ Find $T(1\\,000\\,000\\,000)$. # --hints-- -`necklace(1000000000)` should return `747215561862`. +`necklace(1000000000)` має повернути `747215561862`. ```js assert.strictEqual(necklace(1000000000), 747215561862); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md index 928c602299f..4afca6aaf72 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-429-sum-of-squares-of-unitary-divisors.md @@ -20,7 +20,7 @@ Find $S(100\\,000\\,000!)$ modulo $1\\,000\\,000\\,009$. # --hints-- -`sumSquaresOfUnitaryDivisors()` should return `98792821`. +`sumSquaresOfUnitaryDivisors()` має повернути `98792821`. ```js assert.strictEqual(sumSquaresOfUnitaryDivisors(), 98792821); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md index d8838dbe162..bd8373d0f8d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-430-range-flips.md @@ -24,7 +24,7 @@ Find $E({10}^{10}, 4000)$. Give your answer rounded to 2 decimal places behind t # --hints-- -`rangeFlips()` should return `5000624921.38`. +`rangeFlips()` має повернути `5000624921.38`. ```js assert.strictEqual(rangeFlips(), 5000624921.38); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md index 4199819468b..e579e4ddcb6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-431-square-space-silo.md @@ -22,7 +22,7 @@ If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's ap # --hints-- -`squareSpaceSilo()` should return `23.386029052`. +`squareSpaceSilo()` має повернути `23.386029052`. ```js assert.strictEqual(squareSpaceSilo(), 23.386029052); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md index 2a3f5b744d9..7d3a3e1805d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-432-totient-sum.md @@ -16,7 +16,7 @@ Find $S(510\\,510, {10}^{11})$. Give the last 9 digits of your answer. # --hints-- -`totientSum()` should return `754862080`. +`totientSum()` має повернути `754862080`. ```js assert.strictEqual(totientSum(), 754862080); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-433-steps-in-euclids-algorithm.md index 4db4c121e91..ce642700171 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-433-steps-in-euclids-algorithm.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-433-steps-in-euclids-algorithm.md @@ -25,7 +25,7 @@ Find $S(5 \times {10}^6)$. # --hints-- -`stepsInEuclidsAlgorithm()` should return `326624372659664`. +`stepsInEuclidsAlgorithm()` має повернути `326624372659664`. ```js assert.strictEqual(stepsInEuclidsAlgorithm(), 326624372659664); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md index a570e51bccb..4309f4eac68 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-434-rigid-graphs.md @@ -40,7 +40,7 @@ Find $S(100)$, give your answer modulo $1\\,000\\,000\\,033$. # --hints-- -`rigidGraphs()` should return `863253606`. +`rigidGraphs()` має повернути `863253606`. ```js assert.strictEqual(rigidGraphs(), 863253606); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md index 9df767adcee..8cca16235f2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-435-polynomials-of-fibonacci-numbers.md @@ -18,7 +18,7 @@ Let $n = {10}^{15}$. Find the sum $\displaystyle\sum_{x = 0}^{100} F_n(x)$ and g # --hints-- -`polynomialsOfFibonacciNumbers()` should return `252541322550`. +`polynomialsOfFibonacciNumbers()` має повернути `252541322550`. ```js assert.strictEqual(polynomialsOfFibonacciNumbers(), 252541322550); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md index 444c6f95d1b..8d13dab123b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-436-unfair-wager.md @@ -30,7 +30,7 @@ What is the probability that the second player wins? Give your answer rounded to # --hints-- -`unfairWager()` should return `0.5276662759`. +`unfairWager()` має повернути `0.5276662759`. ```js assert.strictEqual(unfairWager(), 0.5276662759); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md index 47f1606285d..eb8683f3860 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-437-fibonacci-primitive-roots.md @@ -30,7 +30,7 @@ Find the sum of the primes less than $100\\,000\\,000$ with at least one Fibonac # --hints-- -`fibonacciPrimitiveRoots()` should return `74204709657207`. +`fibonacciPrimitiveRoots()` має повернути `74204709657207`. ```js assert.strictEqual(fibonacciPrimitiveRoots(), 74204709657207); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-438-integer-part-of-polynomial-equations-solutions.md index 05c8bd7d4a5..2bb515721fc 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-438-integer-part-of-polynomial-equations-solutions.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-438-integer-part-of-polynomial-equations-solutions.md @@ -25,7 +25,7 @@ Find $\sum S(t)$ for $n = 7$. # --hints-- -`polynomialIntegerPart()` should return `2046409616809`. +`polynomialIntegerPart()` має повернути `2046409616809`. ```js assert.strictEqual(polynomialIntegerPart(), 2046409616809); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md index bb5669ed088..a6a36020a8f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-439-sum-of-sum-of-divisors.md @@ -20,7 +20,7 @@ Find $S({10}^{11})\bmod {10}^9$. # --hints-- -`sumOfSumOfDivisors()` should return `968697378`. +`sumOfSumOfDivisors()` має повернути `968697378`. ```js assert.strictEqual(sumOfSumOfDivisors(), 968697378); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-440-gcd-and-tiling.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-440-gcd-and-tiling.md index 49afa9608aa..8350691149f 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-440-gcd-and-tiling.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-440-gcd-and-tiling.md @@ -31,7 +31,7 @@ Find $S(2000)\bmod 987\\,898\\,789$. # --hints-- -`gcdAndTiling()` should return `970746056`. +`gcdAndTiling()` має повернути `970746056`. ```js assert.strictEqual(gcdAndTiling(), 970746056); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md index 9c310a1f18d..301dd1a317e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-441-the-inverse-summation-of-coprime-couples.md @@ -22,7 +22,7 @@ Find $S({10}^7)$. Give your answer rounded to four decimal places. # --hints-- -`inverseSummationCoprimeCouples()` should return `5000088.8395`. +`inverseSummationCoprimeCouples()` має повернути `5000088.8395`. ```js assert.strictEqual(inverseSummationCoprimeCouples(), 5000088.8395); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md index 9e2e8d90986..c6885e2a707 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-442-eleven-free-integers.md @@ -18,7 +18,7 @@ Find $E({10}^{18})$. # --hints-- -`elevenFreeIntegers()` should return `1295552661530920200`. +`elevenFreeIntegers()` має повернути `1295552661530920200`. ```js assert.strictEqual(elevenFreeIntegers(), 1295552661530920200); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md index 17fc8db1cb5..2f37134a25d 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-443-gcd-sequence.md @@ -24,7 +24,7 @@ Find $g({10}^{15})$. # --hints-- -`gcdSequence()` should return `2744233049300770`. +`gcdSequence()` має повернути `2744233049300770`. ```js assert.strictEqual(gcdSequence(), 2744233049300770); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-444-the-roundtable-lottery.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-444-the-roundtable-lottery.md index 9e52d4e52b4..2efe6d3fd9c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-444-the-roundtable-lottery.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-444-the-roundtable-lottery.md @@ -29,13 +29,13 @@ Find $S_{20}({10}^{14})$ and write the answer as a string in scientific notation # --hints-- -`roundtableLottery()` should return a string. +`roundtableLottery()` має повернути рядок. ```js assert(typeof roundtableLottery() === 'string'); ``` -`roundtableLottery()` should return the string `1.200856722e263`. +`roundtableLottery()` має повернути рядок `1.200856722e263`. ```js assert.strictEqual(roundtableLottery(), '1.200856722e263'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md index 841d3796c7d..228324d77b7 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-445-retractions-a.md @@ -24,7 +24,7 @@ Find $$\sum_{k = 1}^{9\\,999\\,999} R(\displaystyle\binom{10\\,000\\,000}{k})$$ # --hints-- -`retractionsA()` should return `659104042`. +`retractionsA()` має повернути `659104042`. ```js assert.strictEqual(retractionsA(), 659104042); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md index f1919d426f5..7da402d2ca6 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-446-retractions-b.md @@ -24,7 +24,7 @@ Find $F({10}^7)$. Give your answer modulo $1\\,000\\,000\\,007$. # --hints-- -`retractionsB()` should return `907803852`. +`retractionsB()` має повернути `907803852`. ```js assert.strictEqual(retractionsB(), 907803852); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md index 882f61f24d0..83289a7f694 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-447-retractions-c.md @@ -24,7 +24,7 @@ Find $F({10}^{14})$. Give your answer modulo $1\\,000\\,000\\,007$. # --hints-- -`retractionsC()` should return `530553372`. +`retractionsC()` має повернути `530553372`. ```js assert.strictEqual(retractionsC(), 530553372); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md index 26643961a3e..d977bda4377 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-448-average-least-common-multiple.md @@ -22,7 +22,7 @@ Find $S(99\\,999\\,999\\,019)\bmod 999\\,999\\,017$. # --hints-- -`averageLCM()` should return `106467648`. +`averageLCM()` має повернути `106467648`. ```js assert.strictEqual(averageLCM(), 106467648); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md index f312fd4ab49..a343bb15756 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-449-chocolate-covered-candy.md @@ -20,7 +20,7 @@ Find the amount of chocolate in mm3 required if $a = 3$ mm and $b = 1 # --hints-- -`chocolateCoveredCandy()` should return `103.37870096`. +`chocolateCoveredCandy()` має повернути `103.37870096`. ```js assert.strictEqual(chocolateCoveredCandy(), 103.37870096); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md index 9bfd7f5d15a..29a843ad6b8 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-450-hypocycloid-and-lattice-points.md @@ -37,7 +37,7 @@ Find $T({10}^6)$. # --hints-- -`hypocycloidAndLatticePoints()` should return `583333163984220900`. +`hypocycloidAndLatticePoints()` має повернути `583333163984220900`. ```js assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md index 39ebff17846..884d7a861e9 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-451-modular-inverses.md @@ -29,7 +29,7 @@ Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$ # --hints-- -`modularInverses()` should return `153651073760956`. +`modularInverses()` має повернути `153651073760956`. ```js assert.strictEqual(modularInverses(), 153651073760956); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md index abb043bcebe..305f7450eeb 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-452-long-products.md @@ -18,7 +18,7 @@ Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$. # --hints-- -`longProducts()` should return `345558983`. +`longProducts()` має повернути `345558983`. ```js assert.strictEqual(longProducts(), 345558983); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md index f809ebc60a5..b9421c9b44c 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-453-lattice-quadrilaterals.md @@ -22,7 +22,7 @@ Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$. # --hints-- -`latticeQuadrilaterals()` should return `104354107`. +`latticeQuadrilaterals()` має повернути `104354107`. ```js assert.strictEqual(latticeQuadrilaterals(), 104354107); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md index b2fca3b4a6b..74cd88df194 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-454-diophantine-reciprocals-iii.md @@ -20,7 +20,7 @@ Find $F({10}^{12})$. # --hints-- -`diophantineReciprocalsThree()` should return `5435004633092`. +`diophantineReciprocalsThree()` має повернути `5435004633092`. ```js assert.strictEqual(diophantineReciprocalsThree(), 5435004633092); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md index 8e453a983c2..d2a8b419153 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-455-powers-with-trailing-digits.md @@ -20,7 +20,7 @@ Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$. # --hints-- -`powersWithTrailingDigits()` should return `450186511399999`. +`powersWithTrailingDigits()` має повернути `450186511399999`. ```js assert.strictEqual(powersWithTrailingDigits(), 450186511399999); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md index b622b8ac411..5bcbc49eae2 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-456-triangles-containing-the-origin-ii.md @@ -26,7 +26,7 @@ Find $C(2\\,000\\,000)$. # --hints-- -`trianglesContainingOriginTwo()` should return `333333208685971500`. +`trianglesContainingOriginTwo()` має повернути `333333208685971500`. ```js assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md index b187b6c488a..58e9261a28e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-457-a-polynomial-modulo-the-square-of-a-prime.md @@ -20,7 +20,7 @@ Find $SR({10}^7)$. # --hints-- -`polynomialModuloSquareOfPrime()` should return `2647787126797397000`. +`polynomialModuloSquareOfPrime()` має повернути `2647787126797397000`. ```js assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md index c368503124d..b86e52934f1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-458-permutations-of-project.md @@ -18,7 +18,7 @@ Find $T({10}^{12})$. Give the last 9 digits of your answer. # --hints-- -`permutationsOfProject()` should return `423341841`. +`permutationsOfProject()` має повернути `423341841`. ```js assert.strictEqual(permutationsOfProject(), 423341841); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md index 13473d922bf..e3faddeb4de 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-459-flipping-game.md @@ -36,7 +36,7 @@ Find $W({10}^6)$. # --hints-- -`flippingGame()` should return `3996390106631`. +`flippingGame()` має повернути `3996390106631`. ```js assert.strictEqual(flippingGame(), 3996390106631); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-460-an-ant-on-the-move.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-460-an-ant-on-the-move.md index 2bb68f203f4..61f04a48dad 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-460-an-ant-on-the-move.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-460-an-ant-on-the-move.md @@ -31,7 +31,7 @@ Find $F(10\\,000)$. Give your answer rounded to nine decimal places. # --hints-- -`antOnTheMove()` should return `18.420738199`. +`antOnTheMove()` має повернути `18.420738199`. ```js assert.strictEqual(antOnTheMove(), 18.420738199); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md index 1ff7e49ee6b..22b5e8c7061 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-461-almost-pi.md @@ -26,25 +26,25 @@ You are given `almostPi(200)` = 62 + 752 + 892 assert(typeof almostPi === 'function') ``` -`almostPi` should return a number. +`almostPi` має повернути число. ```js assert.strictEqual(typeof almostPi(10), 'number'); ``` -`almostPi(29)` should return `1208`. +`almostPi(29)` має повернути `1208`. ```js assert.strictEqual(almostPi(29), 1208); ``` -`almostPi(50)` should return `4152`. +`almostPi(50)` має повернути `4152`. ```js assert.strictEqual(almostPi(50), 4152); ``` -`almostPi(200)` should return `64658`. +`almostPi(200)` має повернути `64658`. ```js assert.strictEqual(almostPi(200), 64658); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md index b17dc1befcd..c8c37b57a87 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-462-permutation-of-3-smooth-numbers.md @@ -26,13 +26,13 @@ Find $F({10}^{18})$. Give as your answer as a string in its scientific notation # --hints-- -`permutationOf3SmoothNumbers()` should return a string. +`permutationOf3SmoothNumbers()` має повернути рядок. ```js assert.strictEqual(typeof permutationOf3SmoothNumbers() === 'string'); ``` -`permutationOf3SmoothNumbers()` should return the string `5.5350769703e1512`. +`permutationOf3SmoothNumbers()` має повернути рядок `5.5350769703e1512`. ```js assert.strictEqual(permutationOf3SmoothNumbers(), '5.5350769703e1512'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md index a8e3607195e..31a510f9fff 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-463-a-weird-recurrence-relation.md @@ -22,7 +22,7 @@ Find $S(3^{37})$. Give the last 9 digits of your answer. # --hints-- -`weirdRecurrenceRelation()` should return `808981553`. +`weirdRecurrenceRelation()` має повернути `808981553`. ```js assert.strictEqual(weirdRecurrenceRelation(), 808981553); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-464-mbius-function-and-intervals.md index d293fcda274..d9873865d76 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-464-mbius-function-and-intervals.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-464-mbius-function-and-intervals.md @@ -31,7 +31,7 @@ Find $C(20\\,000\\,000)$. # --hints-- -`mobiusFunctionAndIntervals()` should return `198775297232878`. +`mobiusFunctionAndIntervals()` має повернути `198775297232878`. ```js assert.strictEqual(mobiusFunctionAndIntervals(), 198775297232878); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md index 57ad5b291d6..0bafb69238e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-465-polar-polygons.md @@ -28,7 +28,7 @@ Find $P(7^{13})\bmod 1\\,000\\,000\\,007$. # --hints-- -`polarPolygons()` should return `585965659`. +`polarPolygons()` має повернути `585965659`. ```js assert.strictEqual(polarPolygons(), 585965659); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md index cfefe6e7b9f..872c2e766f1 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-466-distinct-terms-in-a-multiplication-table.md @@ -28,7 +28,7 @@ Find $P(64, {10}^{16})$. # --hints-- -`multiplicationTable()` should return `258381958195474750`. +`multiplicationTable()` має повернути `258381958195474750`. ```js assert.strictEqual(multiplicationTable(), 258381958195474750); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md index 9b0caad1704..dd94ccfbf8b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-467-superinteger.md @@ -33,7 +33,7 @@ Find $f(10\\,000)\bmod 1\\,000\\,000\\,007$. # --hints-- -`superinteger()` should return `775181359`. +`superinteger()` має повернути `775181359`. ```js assert.strictEqual(superinteger(), 775181359); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-468-smooth-divisors-of-binomial-coefficients.md index dbd4119b933..201d6e23336 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-468-smooth-divisors-of-binomial-coefficients.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-468-smooth-divisors-of-binomial-coefficients.md @@ -28,7 +28,7 @@ Find $F(11\\,111\\,111)\bmod 1\\,000\\,000\\,993$. # --hints-- -`smoothDivisorsOfBinomialCoefficients()` should return `852950321`. +`smoothDivisorsOfBinomialCoefficients()` має повернути `852950321`. ```js assert.strictEqual(smoothDivisorsOfBinomialCoefficients(), 852950321); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md index 3dce49fdd9a..5b272c19207 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-469-empty-chairs.md @@ -22,7 +22,7 @@ Find $E({10}^{18})$. Give your answer rounded to fourteen decimal places in the # --hints-- -`emptyChairs()` should return `0.56766764161831`. +`emptyChairs()` має повернути `0.56766764161831`. ```js assert.strictEqual(emptyChairs(), 0.56766764161831); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md index 7d0f1aad0ee..2005f1a8632 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-470-super-ramvok.md @@ -24,7 +24,7 @@ Calculate $F(20)$, rounded to the nearest integer. # --hints-- -`superRamvok()` should return `147668794`. +`superRamvok()` має повернути `147668794`. ```js assert.strictEqual(superRamvok(), 147668794); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md index 87fba0ff50a..d08630c3fd4 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-471-triangle-inscribed-in-ellipse.md @@ -28,13 +28,13 @@ For $G(10)$ the answer would have been `2.059722222e1` # --hints-- -`triangleInscribedInEllipse()` should return a string. +`triangleInscribedInEllipse()` має повернути рядок. ```js assert(typeof triangleInscribedInEllipse() === 'string'); ``` -`triangleInscribedInEllipse()` should return the string `1.895093981e31`. +`triangleInscribedInEllipse()` має повернути рядок `1.895093981e31`. ```js assert.strictEqual(triangleInscribedInEllipse(), '1.895093981e31'); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md index 25c9c601cf6..f7460af3f42 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-472-comfortable-distance-ii.md @@ -30,7 +30,7 @@ Find $\sum f(N)$ for $1 ≤ N ≤ {10}^{12}$. Give the last 8 digits of your ans # --hints-- -`comfortableDistanceTwo()` should return `73811586`. +`comfortableDistanceTwo()` має повернути `73811586`. ```js assert.strictEqual(comfortableDistanceTwo(), 73811586); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-473-phigital-number-base.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-473-phigital-number-base.md index 97a545fed4c..b337922a402 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-473-phigital-number-base.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-473-phigital-number-base.md @@ -30,7 +30,7 @@ Find the sum of the positive integers not exceeding $10^{10}$ whose phigital rep # --hints-- -`phigitalNumberBase()` should return `35856681704365`. +`phigitalNumberBase()` має повернути `35856681704365`. ```js assert.strictEqual(phigitalNumberBase(), 35856681704365); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md index e63a971d336..6f67eaac93b 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-474-last-digits-of-divisors.md @@ -18,7 +18,7 @@ Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$. # --hints-- -`lastDigitsOfDivisors()` should return `9690646731515010`. +`lastDigitsOfDivisors()` має повернути `9690646731515010`. ```js assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md index 9f019e969d0..1e6682cc430 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-475-music-festival.md @@ -22,7 +22,7 @@ Find $f(600)\bmod 1\\,000\\,000\\,007$. # --hints-- -`musicFestival()` should return `75780067`. +`musicFestival()` має повернути `75780067`. ```js assert.strictEqual(musicFestival(), 75780067); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md index c6f88e38013..2ed1f97743e 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-476-circle-packing-ii.md @@ -18,7 +18,7 @@ Find $S(1803)$ rounded to 5 decimal places behind the decimal point. # --hints-- -`circlePackingTwo()` should return `110242.87794`. +`circlePackingTwo()` має повернути `110242.87794`. ```js assert.strictEqual(circlePackingTwo(), 110242.87794); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md index 18bcc8e538b..494feb97428 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-477-number-sequence-game.md @@ -36,7 +36,7 @@ Find $F({10}^8)$. # --hints-- -`numberSequenceGame()` should return `25044905874565164`. +`numberSequenceGame()` має повернути `25044905874565164`. ```js assert.strictEqual(numberSequenceGame(), 25044905874565164); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md index d2f0dbd2054..ac78fef3da0 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-478-mixtures.md @@ -30,7 +30,7 @@ Find $E(10\\,000\\,000)\bmod {11}^8$. # --hints-- -`mixtures()` should return `59510340`. +`mixtures()` має повернути `59510340`. ```js assert.strictEqual(mixtures(), 59510340); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md index b905a648468..028d50bd18a 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-479-roots-on-the-rise.md @@ -20,7 +20,7 @@ Find $S({10}^6) \text{ modulo } 1\\,000\\,000\\,007$. # --hints-- -`rootsOnTheRise()` should return `191541795`. +`rootsOnTheRise()` має повернути `191541795`. ```js assert.strictEqual(rootsOnTheRise(), 191541795); diff --git a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-480-the-last-question.md b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-480-the-last-question.md index b07b59bb692..f24a14e3904 100644 --- a/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-480-the-last-question.md +++ b/curriculum/challenges/ukrainian/18-project-euler/project-euler-problems-401-to-480/problem-480-the-last-question.md @@ -50,13 +50,13 @@ Give your answer using lowercase characters (no punctuation or space). # --hints-- -`euler480()` should return a string. +`euler480()` має повернути рядок. ```js assert(typeof euler480() === 'string'); ``` -`euler480()` should return the string `turnthestarson`. +`euler480()` має повернути рядок `turnthestarson`. ```js assert.strictEqual(euler480(), 'turnthestarson');