From d31dd8a9d26d093879552db0d8c47c6136870be4 Mon Sep 17 00:00:00 2001
From: camperbot <camperbot@users.noreply.github.com>
Date: Wed, 5 Apr 2023 20:50:27 +0530
Subject: [PATCH] chore(i18n,learn): processed translations (#49961)

---
 .../basic-javascript/record-collection.md     |  4 +-
 .../6143d2842b497779bad947de.md               | 12 ++---
 .../6144d66a5358db0c80628757.md               |  4 +-
 .../619d324f5915c929f36ae91d.md               |  2 +-
 .../5efc4f528d6a74d05e68af74.md               |  4 +-
 .../61fdac1e31692f9a9ad97295.md               |  2 +-
 .../620175b3710a0951cfa86edf.md               |  6 +--
 .../6201782cc420715562f36271.md               |  2 +-
 .../620179bc0a6a2358c72b90ad.md               |  2 +-
 .../62017b6f47454059bf2d3bd1.md               |  2 +-
 .../62017f47c87be96457c49f46.md               | 16 +++---
 .../62017fa5bbef406580ceb44f.md               |  2 +-
 .../62018243f046a368fab8ffb6.md               |  2 +-
 .../6201830cb0c74b69f1b41635.md               |  2 +-
 .../620186f4b6b8356d2def576b.md               |  2 +-
 .../62018ba1aa263770c953be66.md               |  2 +-
 .../62018c3e94434a71af1d5eaa.md               |  2 +-
 .../62018ec29b3ae674f40bef31.md               |  2 +-
 .../62019093fe30e278e797d2f6.md               |  2 +-
 .../620191707bc65579ddd3ce15.md               |  2 +-
 .../620192a767533a7ad19d96d7.md               |  2 +-
 .../6201995d9ab88e80f1989dce.md               |  2 +-
 .../620199c7a7a32c81d4db3410.md               |  2 +-
 .../6201a1a7af32c287bd6b8183.md               |  2 +-
 .../6201a1cc668a34888f5b2f52.md               |  2 +-
 .../6201a20d742f5c89736c8cfb.md               |  2 +-
 .../6201a42e39bf3b95b6a33bf3.md               |  2 +-
 .../6201a4adcc6414968b391592.md               |  2 +-
 .../6201a5258af7b398b030bfaf.md               |  2 +-
 .../6201a59be346d399c21d10b1.md               |  2 +-
 .../64076bbeba941114b0027b6a.md               |  6 +--
 .../615f7de4487b64919bb4aa5e.md               | 12 ++---
 .../basic-javascript/record-collection.md     |  4 +-
 .../6143d2842b497779bad947de.md               | 12 ++---
 .../6144d66a5358db0c80628757.md               |  4 +-
 .../619d324f5915c929f36ae91d.md               |  2 +-
 .../5efc4f528d6a74d05e68af74.md               |  4 +-
 .../61fdac1e31692f9a9ad97295.md               |  2 +-
 .../620175b3710a0951cfa86edf.md               |  6 +--
 .../6201782cc420715562f36271.md               |  2 +-
 .../620179bc0a6a2358c72b90ad.md               |  2 +-
 .../62017b6f47454059bf2d3bd1.md               |  2 +-
 .../62017f47c87be96457c49f46.md               | 16 +++---
 .../62017fa5bbef406580ceb44f.md               |  2 +-
 .../62018243f046a368fab8ffb6.md               |  2 +-
 .../6201830cb0c74b69f1b41635.md               |  2 +-
 .../620186f4b6b8356d2def576b.md               |  2 +-
 .../62018ba1aa263770c953be66.md               |  2 +-
 .../62018c3e94434a71af1d5eaa.md               |  2 +-
 .../62018ec29b3ae674f40bef31.md               |  2 +-
 .../62019093fe30e278e797d2f6.md               |  2 +-
 .../620191707bc65579ddd3ce15.md               |  2 +-
 .../620192a767533a7ad19d96d7.md               |  2 +-
 .../6201995d9ab88e80f1989dce.md               |  2 +-
 .../620199c7a7a32c81d4db3410.md               |  2 +-
 .../6201a1a7af32c287bd6b8183.md               |  2 +-
 .../6201a1cc668a34888f5b2f52.md               |  2 +-
 .../6201a20d742f5c89736c8cfb.md               |  2 +-
 .../6201a42e39bf3b95b6a33bf3.md               |  2 +-
 .../6201a4adcc6414968b391592.md               |  2 +-
 .../6201a5258af7b398b030bfaf.md               |  2 +-
 .../6201a59be346d399c21d10b1.md               |  2 +-
 .../64076bbeba941114b0027b6a.md               |  6 +--
 .../615f7de4487b64919bb4aa5e.md               | 12 ++---
 .../basic-javascript/record-collection.md     |  4 +-
 .../619d324f5915c929f36ae91d.md               |  2 +-
 .../problem-26-reciprocal-cycles.md           | 18 +++----
 .../problem-27-quadratic-primes.md            | 28 +++++-----
 .../problem-28-number-spiral-diagonals.md     | 18 +++----
 .../problem-29-distinct-powers.md             | 18 +++----
 .../problem-30-digit-n-powers.md              | 20 +++----
 .../problem-31-coin-sums.md                   | 20 +++----
 .../problem-32-pandigital-products.md         | 22 ++++----
 .../problem-33-digit-cancelling-fractions.md  | 12 ++---
 .../problem-34-digit-factorials.md            | 10 ++--
 .../problem-35-circular-primes.md             | 26 ++++-----
 .../problem-36-double-base-palindromes.md     | 18 +++----
 .../problem-37-truncatable-primes.md          | 18 +++----
 .../problem-38-pandigital-multiples.md        | 16 +++---
 .../problem-39-integer-right-triangles.md     | 16 +++---
 .../problem-40-champernownes-constant.md      | 16 +++---
 .../problem-41-pandigital-prime.md            | 12 ++---
 .../problem-42-coded-triangle-numbers.md      | 18 +++----
 .../problem-43-sub-string-divisibility.md     | 34 ++++++------
 .../problem-44-pentagon-numbers.md            | 12 ++---
 ...-45-triangular-pentagonal-and-hexagonal.md | 18 +++----
 .../problem-46-goldbachs-other-conjecture.md  | 12 ++---
 .../problem-47-distinct-primes-factors.md     | 16 +++---
 .../problem-48-self-powers.md                 | 16 +++---
 .../problem-49-prime-permutations.md          | 12 ++---
 .../problem-50-consecutive-prime-sum.md       | 16 +++---
 .../problem-51-prime-digit-replacements.md    | 16 +++---
 .../problem-52-permuted-multiples.md          | 12 ++---
 .../problem-53-combinatoric-selections.md     | 24 ++++-----
 .../problem-54-poker-hands.md                 | 54 +++++++++----------
 .../problem-55-lychrel-numbers.md             | 28 +++++-----
 .../problem-56-powerful-digit-sum.md          | 18 +++----
 .../problem-57-square-root-convergents.md     | 18 +++----
 .../problem-58-spiral-primes.md               | 16 +++---
 .../problem-59-xor-decryption.md              | 16 +++---
 .../problem-60-prime-pair-sets.md             | 10 ++--
 .../problem-61-cyclical-figurate-numbers.md   | 38 ++++++-------
 .../problem-62-cubic-permutations.md          | 16 +++---
 .../problem-63-powerful-digit-counts.md       | 26 ++++-----
 .../problem-64-odd-period-square-roots.md     | 48 ++++++++---------
 .../problem-65-convergents-of-e.md            | 26 ++++-----
 .../problem-66-diophantine-equation.md        | 26 ++++-----
 .../problem-67-maximum-path-sum-ii.md         | 16 +++---
 .../problem-68-magic-5-gon-ring.md            | 20 +++----
 .../problem-69-totient-maximum.md             | 18 +++----
 .../problem-70-totient-permutation.md         | 18 +++----
 .../problem-71-ordered-fractions.md           | 22 ++++----
 .../problem-72-counting-fractions.md          | 20 +++----
 .../basic-javascript/record-collection.md     |  4 +-
 .../619d324f5915c929f36ae91d.md               |  2 +-
 .../619d324f5915c929f36ae91d.md               |  2 +-
 .../5efc4f528d6a74d05e68af74.md               |  4 +-
 .../build-a-data-graph-explorer.md            | 22 ++++----
 .../build-three-math-games.md                 | 20 +++----
 .../graphing-systems-of-equations-extra.md    | 16 +++---
 .../graphing-systems.md                       | 18 +++----
 .../chinese-traditional/comments.json         |  2 +-
 curriculum/dictionaries/chinese/comments.json |  2 +-
 123 files changed, 635 insertions(+), 635 deletions(-)

diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
index ca0254eb5cf..0e24434b6bc 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -21,8 +21,8 @@ dashedName: record-collection
 
 -   你的函數必須始終返回整個 `records` 對象。
 -   如果 `value` 是空字符串，從專輯裏刪除指定的 `prop`。
--   If `prop` isn't `tracks` and `value` isn't an empty string, assign the `value` to that album's `prop`.
--   If `prop` is `tracks` and value isn't an empty string, add the `value` to the end of the album's `tracks` array. You need to create this array first if the album does not have a `tracks` property.
+-   如果 `prop` 不是 `tracks`，並且 `value` 不是一個空字符串，將 `value` 賦給那個專輯的 `prop`。
+-   如果 `prop` 是 `tracks`，並且值不是一個空字符串，將 `value` 添加到專輯的 `tracks` 數組的末尾。 如果相冊沒有一個 `tracks` 屬性，你需要先創建此數組。
 
 **注意：** 將 `recordCollection` 對象的副本用於測試。 你不應該直接修改 `recordCollection` 對象。
 
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
index 116d0b65c35..d835bfb6e1c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
@@ -7,31 +7,31 @@ dashedName: step-26
 
 # --description--
 
-To start your CSS, normalize the CSS rules by targeting all elements with `*`, including the `::before` and `::after` pseudo-selectors.
+開始寫 CSS，請通過使用 `*` 定位所有元素來規範 CSS 規則，包括 `::before` 和 `::after` 僞選擇器。
 
-Set the `padding` and `margin` properties both to `0` and set the `box-sizing` property to `border-box`.
+將 `padding` 和 `margin` 屬性均設置爲 `0`，並將 `box-sizing` 屬性設置爲 `border-box`。
 
 # --hints--
 
-You should have a `*, ::before, ::after` selector.
+你應該有一個 `*, ::before, ::after` 選擇器。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after'));
 ```
 
-Your `*, ::before, ::after` selector should have a `padding` property set to `0`.
+你的 `*, ::before, ::after` 選擇器應該有一個 `padding` 屬性值爲 `0`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.padding === '0px');
 ```
 
-Your `*, ::before, ::after` selector should have a `margin` property set to `0`.
+你的 `*, ::before, ::after` 選擇器應該有一個 `margin` 屬性值爲 `0`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.margin === '0px');
 ```
 
-Your `*, ::before, ::after` selector should have a `box-sizing` property set to `border-box`.
+你的 `*, ::before, ::after` 選擇器應該有一個 `box-sizing` 屬性設置爲 `border-box`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.boxSizing === 'border-box');
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
index 31f3d29c15c..dad518849cc 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
@@ -13,13 +13,13 @@ dashedName: step-27
 
 # --hints--
 
-You should create an `html` selector.
+你應該創建一個 `html` 選擇器。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('html'));
 ```
 
-Your `html` selector should have a `font-size` property set to `62.5%`.
+你的 `html` 選擇器應該將 `font-size` 屬性設置爲 `62.5%`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('html')?.fontSize === '62.5%');
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index a5f81aff693..cb497ecba0f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -35,7 +35,7 @@ assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(ru
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].some(css => css?.keyText === '40%'));
 ```
 
-You should have 4 waypoints in your keyframe.
+你需要在關鍵幀中設置 4 個關鍵點。
 
 ```js
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].length === 4);
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index d17f7b4b8eb..c2ddb9a58ff 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -25,7 +25,7 @@ assert($('input[type="checkbox"]')[0]);
 assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
-The text `Loving` should be wrapped in a `label` element.
+文本 `Loving` 應該嵌套在新的 `label` 元素中。
 
 ```js
 const checkboxInputElem = $('input[type="checkbox"]')[0];
@@ -71,7 +71,7 @@ const labelElem = document.querySelector('label[for="loving"]');
 assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```
 
-There should be a space between your checkbox and your new `label` element.
+你的複選框和新的 `label` 元素之間應該有一個空格。
 
 ```js
 assert.match(code, />\s+<label\s+for\s*=\s*('|")loving/);
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
index f16e2509e51..b2ac80bf31a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
@@ -9,7 +9,7 @@ dashedName: step-31
 
 CSS `clip` 屬性用於定義元素的可見部分。 設置 `span[class~="sr-only"]` 選擇器的 `clip` 屬性爲 `rect(1px, 1px, 1px, 1px)`。
 
-`clip-path` 屬性決定了 `clip` 屬性應該採用的形狀。 Set the `clip-path` property to the value of `inset(50%)`, forming the clip-path into a rectangle within the element.
+`clip-path` 屬性決定了 `clip` 屬性應該採用的形狀。 設置 `clip-path` 屬性的值爲 `inset(50%)`，在元素內剪切形成一個矩形。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
index 761426fdcae..8b602d643cb 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
@@ -16,17 +16,17 @@ dashedName: step-42
 }
 ```
 
-Give `#years` a `margin` of `0 -2px`, and a `padding` set to `0.5rem calc(1.25rem + 2px) 0.5rem 0`.
+給 `#years` 一個 `margin` 爲 `0 -2px`，和一個 `padding` 爲 `0.5rem calc(1.25rem + 2px) 0.5rem 0`。
 
 # --hints--
 
-Your `#years` selector should have a `margin` property set to `0 -2px`.
+你的 `#years` 選擇器應該有一個 `margin` 屬性設置爲 `0 -2px`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('margin') === '0px -2px');
 ```
 
-Your `#years` selector should have a `padding` property set to `0.5rem calc(1.25rem + 2px) 0.5rem 0`.
+你的 `#years` 選擇器應該有一個 `padding` 屬性設置爲 `0.5rem calc(1.25rem + 2px) 0.5rem 0`。
 
 ```js
 const padding = new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('padding');
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
index 8fa7c283c69..33bacc383d8 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
@@ -1,6 +1,6 @@
 ---
 id: 6201782cc420715562f36271
-title: Step 44
+title: 步驟 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
index c18d6feb36b..605a4ba1b00 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
@@ -1,6 +1,6 @@
 ---
 id: 620179bc0a6a2358c72b90ad
-title: Step 45
+title: 步驟 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
index 80e6a8d17cc..bc8a0f2fe40 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
@@ -1,6 +1,6 @@
 ---
 id: 62017b6f47454059bf2d3bd1
-title: Step 46
+title: 步驟 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
index 9661c0edc4c..ba2678dcedc 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
@@ -1,6 +1,6 @@
 ---
 id: 62017f47c87be96457c49f46
-title: Step 47
+title: 步驟 47
 challengeType: 0
 dashedName: step-47
 ---
@@ -35,49 +35,49 @@ const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?
 assert(text.includes('clip-path: inset(50%) !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `height` property set to `1px !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `height` 屬性設置爲 `1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('height: 1px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `width` property set to `1px !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `width` 屬性設置爲 `1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('width: 1px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `position` property set to `absolute !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `position` 屬性設置爲 `absolute !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('position: absolute !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `overflow` property set to `hidden !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `overflow` 屬性設置爲 `hidden !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('overflow: hidden !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `white-space` property set to `nowrap !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `white-space` 屬性設置爲 `nowrap !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('white-space: nowrap !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `padding` property set to `0 !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `padding` 屬性設置爲 `0 !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('padding: 0px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `margin` property set to `-1px !important`.
+你的 `span[class~="sr-only"]` 選擇器應該將 `margin` 屬性設置爲 `-1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
index bb147d213d8..051e0af88e5 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
@@ -1,6 +1,6 @@
 ---
 id: 62017fa5bbef406580ceb44f
-title: Step 48
+title: 步驟 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
index 1b2f5667af6..cc92055ed6d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
@@ -1,6 +1,6 @@
 ---
 id: 62018243f046a368fab8ffb6
-title: Step 49
+title: 步驟 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
index 24fd032442f..3de68b12e4c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
@@ -1,6 +1,6 @@
 ---
 id: 6201830cb0c74b69f1b41635
-title: Step 50
+title: 步驟 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
index f80d4910ae7..bf13a6682c4 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
@@ -1,6 +1,6 @@
 ---
 id: 620186f4b6b8356d2def576b
-title: Step 51
+title: 步驟 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
index 96500f95361..181d63c29e8 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ba1aa263770c953be66
-title: Step 52
+title: 步驟 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
index bf2b1a75c9f..66958da0daf 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
@@ -1,6 +1,6 @@
 ---
 id: 62018c3e94434a71af1d5eaa
-title: Step 53
+title: 步驟 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
index c5eb6c257b0..a3e3a6ce979 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ec29b3ae674f40bef31
-title: Step 54
+title: 步驟 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
index afec6220d86..fa6d77f53d7 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
@@ -1,6 +1,6 @@
 ---
 id: 62019093fe30e278e797d2f6
-title: Step 55
+title: 步驟 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
index 82eff2e87bc..f3155a1d33c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
@@ -1,6 +1,6 @@
 ---
 id: 620191707bc65579ddd3ce15
-title: Step 56
+title: 步驟 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
index 5011b3b6ef3..6b431312f53 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
@@ -1,6 +1,6 @@
 ---
 id: 620192a767533a7ad19d96d7
-title: Step 57
+title: 步驟 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
index 0744ebfdeb8..ce48a8abbcc 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
@@ -1,6 +1,6 @@
 ---
 id: 6201995d9ab88e80f1989dce
-title: Step 58
+title: 步驟 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
index 283d21ac146..20256985b19 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
@@ -1,6 +1,6 @@
 ---
 id: 620199c7a7a32c81d4db3410
-title: Step 59
+title: 步驟 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
index fcc6cfac4bb..ebea8339ab0 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1a7af32c287bd6b8183
-title: Step 60
+title: 步驟 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
index d49ffbc28a9..51ea8c2a746 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1cc668a34888f5b2f52
-title: Step 61
+title: 步驟 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
index b5de710a6f8..66b430363bd 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a20d742f5c89736c8cfb
-title: Step 62
+title: 步驟 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
index c187ac12948..9b1e5d7aa0d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a42e39bf3b95b6a33bf3
-title: Step 63
+title: 步驟 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
index 2b32ddf7c25..73def40d541 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a4adcc6414968b391592
-title: Step 64
+title: 步驟 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
index 01693e85556..00293384c7c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a5258af7b398b030bfaf
-title: Step 65
+title: 步驟 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
index 03ca92d63a1..2d762feb46b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a59be346d399c21d10b1
-title: Step 66
+title: 步驟 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
index 71388718e00..7901efdcf63 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
@@ -1,17 +1,17 @@
 ---
 id: 64076bbeba941114b0027b6a
-title: Step 43
+title: 步驟 43
 challengeType: 0
 dashedName: step-43
 ---
 
 # --description--
 
-Adding position `sticky` moved the element into its own stack. To ensure your `#years` element does not get hidden by different stacks, add a `z-index` property set to `999` in the `#years` rule.
+添加位置 `sticky` 將元素移動到自己的堆棧中。 爲了確保你的 `#years` 元素不會被不同的堆棧隱藏，在 `#years` 規則中添加 `z-index` 屬性，值爲 `999`。
 
 # --hints--
 
-Your `#years` selector should have a `z-index` property set to `999`.
+你的 `#years` 選擇器應該有一個 `z-index` 屬性設置爲 `999`。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('z-index'), '999');
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
index 1470a881109..36376b2954f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
@@ -24,13 +24,13 @@ const text = document.querySelector('.daily-value.small-text')?.lastElementChild
 assert(text === 'Cholesterol 0mg 0%');
 ```
 
-Your new `p` element should have exactly three `span` elements.
+你的新的 `p` 元素應該有三個 `span` 元素。
 
 ```js
 assert(document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')?.length === 3);
 ```
 
-The text `Cholesterol` should be nested in a `span`.
+文本 `Cholesterol` 應該嵌套在 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -38,7 +38,7 @@ const cholesterolSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*Cho
 assert(cholesterolSpan.length === 1);
 ```
 
-Your `Cholesterol` `span` should have the `class` attribute set to `bold`.
+你的 `Cholesterol` `span` 應該有 `class` 屬性設置爲 `bold`。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -46,7 +46,7 @@ const cholesterolSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*Cho
 assert(cholesterolSpan[0]?.classList?.contains('bold'));
 ```
 
-The text `0%` should be nested in a `span`.
+文本 `0%` 應該嵌套在一個 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -54,7 +54,7 @@ const zeroPercentSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*0%[
 assert(zeroPercentSpan.length === 1);
 ```
 
-Your `0%` `span` should have the `class` attribute set to `bold`.
+你的 `0%` `span` 應該有 `class` 屬性設置爲 `bold`。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -62,7 +62,7 @@ const zeroPercentSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*0%[
 assert(zeroPercentSpan[0]?.classList?.contains('bold'));
 ```
 
-Your `Cholesterol` `span` and your `0mg` text should be wrapped in a `span`.
+你的 `Cholesterol` `span` 和 `0mg` 文本應該被包裹在 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
index 15724922cc3..bceb0ae9cba 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -21,8 +21,8 @@ dashedName: record-collection
 
 -   你的函数必须始终返回整个 `records` 对象。
 -   如果 `value` 是空字符串，从专辑里删除指定的 `prop`。
--   If `prop` isn't `tracks` and `value` isn't an empty string, assign the `value` to that album's `prop`.
--   If `prop` is `tracks` and value isn't an empty string, add the `value` to the end of the album's `tracks` array. You need to create this array first if the album does not have a `tracks` property.
+-   如果 `prop` 不是 `tracks`，并且 `value` 不是一个空字符串，将 `value` 赋给那个专辑的 `prop`。
+-   如果 `prop` 是 `tracks`，并且值不是一个空字符串，将 `value` 添加到专辑的 `tracks` 数组的末尾。 如果相册没有一个 `tracks` 属性，你需要先创建此数组。
 
 **注意：** 将 `recordCollection` 对象的副本用于测试。 你不应该直接修改 `recordCollection` 对象。
 
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
index b1964e64959..5508fd8c8cd 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
@@ -7,31 +7,31 @@ dashedName: step-26
 
 # --description--
 
-To start your CSS, normalize the CSS rules by targeting all elements with `*`, including the `::before` and `::after` pseudo-selectors.
+开始写 CSS，请通过使用 `*` 定位所有元素来规范 CSS 规则，包括 `::before` 和 `::after` 伪选择器。
 
-Set the `padding` and `margin` properties both to `0` and set the `box-sizing` property to `border-box`.
+将 `padding` 和 `margin` 属性均设置为 `0`，并将 `box-sizing` 属性设置为 `border-box`。
 
 # --hints--
 
-You should have a `*, ::before, ::after` selector.
+你应该有一个 `*, ::before, ::after` 选择器。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after'));
 ```
 
-Your `*, ::before, ::after` selector should have a `padding` property set to `0`.
+你的 `*, ::before, ::after` 选择器应该有一个 `padding` 属性值为 `0`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.padding === '0px');
 ```
 
-Your `*, ::before, ::after` selector should have a `margin` property set to `0`.
+你的 `*, ::before, ::after` 选择器应该有一个 `margin` 属性值为 `0`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.margin === '0px');
 ```
 
-Your `*, ::before, ::after` selector should have a `box-sizing` property set to `border-box`.
+你的 `*, ::before, ::after` 选择器应该有一个 `box-sizing` 属性设置为 `border-box`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('*, ::before, ::after')?.boxSizing === 'border-box');
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
index 74c88484b9e..df2564d59a9 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
@@ -13,13 +13,13 @@ dashedName: step-27
 
 # --hints--
 
-You should create an `html` selector.
+你应该创建一个 `html` 选择器。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('html'));
 ```
 
-Your `html` selector should have a `font-size` property set to `62.5%`.
+你的 `html` 选择器应该将 `font-size` 属性设置为 `62.5%`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('html')?.fontSize === '62.5%');
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index f8e12fe8777..0596f27f5b6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -35,7 +35,7 @@ assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(ru
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].some(css => css?.keyText === '40%'));
 ```
 
-You should have 4 waypoints in your keyframe.
+你需要在关键帧中设置 4 个关键点。
 
 ```js
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].length === 4);
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 42d58d41b35..ea23392cfec 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -25,7 +25,7 @@ assert($('input[type="checkbox"]')[0]);
 assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
-The text `Loving` should be wrapped in a `label` element.
+文本 `Loving` 应该嵌套在新的 `label` 元素中。
 
 ```js
 const checkboxInputElem = $('input[type="checkbox"]')[0];
@@ -71,7 +71,7 @@ const labelElem = document.querySelector('label[for="loving"]');
 assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```
 
-There should be a space between your checkbox and your new `label` element.
+你的复选框和新的 `label` 元素之间应该有一个空格。
 
 ```js
 assert.match(code, />\s+<label\s+for\s*=\s*('|")loving/);
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
index f8c7a8f9fd2..ff6940b8f3a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
@@ -9,7 +9,7 @@ dashedName: step-31
 
 CSS `clip` 属性用于定义元素的可见部分。 设置 `span[class~="sr-only"]` 选择器的 `clip` 属性为 `rect(1px, 1px, 1px, 1px)`。
 
-`clip-path` 属性决定了 `clip` 属性应该采用的形状。 Set the `clip-path` property to the value of `inset(50%)`, forming the clip-path into a rectangle within the element.
+`clip-path` 属性决定了 `clip` 属性应该采用的形状。 设置 `clip-path` 属性的值为 `inset(50%)`，在元素内剪切形成一个矩形。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
index f58be07b240..11ff4df0e49 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
@@ -16,17 +16,17 @@ dashedName: step-42
 }
 ```
 
-Give `#years` a `margin` of `0 -2px`, and a `padding` set to `0.5rem calc(1.25rem + 2px) 0.5rem 0`.
+给 `#years` 一个 `margin` 为 `0 -2px`，和一个 `padding` 为 `0.5rem calc(1.25rem + 2px) 0.5rem 0`。
 
 # --hints--
 
-Your `#years` selector should have a `margin` property set to `0 -2px`.
+你的 `#years` 选择器应该有一个 `margin` 属性设置为 `0 -2px`。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('margin') === '0px -2px');
 ```
 
-Your `#years` selector should have a `padding` property set to `0.5rem calc(1.25rem + 2px) 0.5rem 0`.
+你的 `#years` 选择器应该有一个 `padding` 属性设置为 `0.5rem calc(1.25rem + 2px) 0.5rem 0`。
 
 ```js
 const padding = new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('padding');
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
index 9a3e5400f70..20227ed3f77 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
@@ -1,6 +1,6 @@
 ---
 id: 6201782cc420715562f36271
-title: Step 44
+title: 步骤 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
index 9747b169403..e9f59e0da0c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
@@ -1,6 +1,6 @@
 ---
 id: 620179bc0a6a2358c72b90ad
-title: Step 45
+title: 步骤 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
index 27c821fd4d5..9739b30c39d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
@@ -1,6 +1,6 @@
 ---
 id: 62017b6f47454059bf2d3bd1
-title: Step 46
+title: 步骤 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
index a3652a514ea..19fb2744172 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
@@ -1,6 +1,6 @@
 ---
 id: 62017f47c87be96457c49f46
-title: Step 47
+title: 步骤 47
 challengeType: 0
 dashedName: step-47
 ---
@@ -35,49 +35,49 @@ const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?
 assert(text.includes('clip-path: inset(50%) !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `height` property set to `1px !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `height` 属性设置为 `1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('height: 1px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `width` property set to `1px !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `width` 属性设置为 `1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('width: 1px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `position` property set to `absolute !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `position` 属性设置为 `absolute !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('position: absolute !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `overflow` property set to `hidden !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `overflow` 属性设置为 `hidden !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('overflow: hidden !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `white-space` property set to `nowrap !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `white-space` 属性设置为 `nowrap !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('white-space: nowrap !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `padding` property set to `0 !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `padding` 属性设置为 `0 !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
 assert(text.includes('padding: 0px !important;'));
 ```
 
-Your `span[class~="sr-only"]` selector should have the `margin` property set to `-1px !important`.
+你的 `span[class~="sr-only"]` 选择器应该将 `margin` 属性设置为 `-1px !important`。
 
 ```js
 const text = new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.cssText;
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
index 9804717f9ff..4bef0985889 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
@@ -1,6 +1,6 @@
 ---
 id: 62017fa5bbef406580ceb44f
-title: Step 48
+title: 步骤 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
index 6ed51328be7..04f3a880d9e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
@@ -1,6 +1,6 @@
 ---
 id: 62018243f046a368fab8ffb6
-title: Step 49
+title: 步骤 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
index e75cd6a8a53..8ef4ec1f8df 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
@@ -1,6 +1,6 @@
 ---
 id: 6201830cb0c74b69f1b41635
-title: Step 50
+title: 步骤 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
index c86d2bb62f0..1a9427f0eaf 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
@@ -1,6 +1,6 @@
 ---
 id: 620186f4b6b8356d2def576b
-title: Step 51
+title: 步骤 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
index bd1c073dbf3..4b998f98a30 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ba1aa263770c953be66
-title: Step 52
+title: 步骤 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
index 6b8f497770c..a4306330063 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
@@ -1,6 +1,6 @@
 ---
 id: 62018c3e94434a71af1d5eaa
-title: Step 53
+title: 步骤 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
index 2d4bb5ff0ff..e15b2bc867c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ec29b3ae674f40bef31
-title: Step 54
+title: 步骤 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
index 218e18d6359..af47d3aec2b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
@@ -1,6 +1,6 @@
 ---
 id: 62019093fe30e278e797d2f6
-title: Step 55
+title: 步骤 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
index be053a6c1d3..b28ffdbc982 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
@@ -1,6 +1,6 @@
 ---
 id: 620191707bc65579ddd3ce15
-title: Step 56
+title: 步骤 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
index 8271342c0e2..04f6fec419f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
@@ -1,6 +1,6 @@
 ---
 id: 620192a767533a7ad19d96d7
-title: Step 57
+title: 步骤 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
index 3fd22af8ca7..b59d8a90b7e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
@@ -1,6 +1,6 @@
 ---
 id: 6201995d9ab88e80f1989dce
-title: Step 58
+title: 步骤 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
index 4b779cd575c..3251cf7cedf 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
@@ -1,6 +1,6 @@
 ---
 id: 620199c7a7a32c81d4db3410
-title: Step 59
+title: 步骤 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
index 05d5e9f83bb..6a5f6755f3f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1a7af32c287bd6b8183
-title: Step 60
+title: 步骤 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
index 086db598c56..f70ee8dc726 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1cc668a34888f5b2f52
-title: Step 61
+title: 步骤 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
index 40bb045b970..d0015ab6eda 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a20d742f5c89736c8cfb
-title: Step 62
+title: 步骤 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
index 1210db84237..fbb0ec954cc 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a42e39bf3b95b6a33bf3
-title: Step 63
+title: 步骤 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
index 7249b885887..d066a34342c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a4adcc6414968b391592
-title: Step 64
+title: 步骤 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
index f01899e85ca..4df3bd58198 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a5258af7b398b030bfaf
-title: Step 65
+title: 步骤 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
index e412898a0da..71274331b39 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a59be346d399c21d10b1
-title: Step 66
+title: 步骤 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
index 71388718e00..76376fca5b8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/64076bbeba941114b0027b6a.md
@@ -1,17 +1,17 @@
 ---
 id: 64076bbeba941114b0027b6a
-title: Step 43
+title: 步骤 43
 challengeType: 0
 dashedName: step-43
 ---
 
 # --description--
 
-Adding position `sticky` moved the element into its own stack. To ensure your `#years` element does not get hidden by different stacks, add a `z-index` property set to `999` in the `#years` rule.
+添加位置 `sticky` 将元素移动到自己的堆栈中。 为了确保你的 `#years` 元素不会被不同的堆栈隐藏，在 `#years` 规则中添加 `z-index` 属性，值为 `999`。
 
 # --hints--
 
-Your `#years` selector should have a `z-index` property set to `999`.
+你的 `#years` 选择器应该有一个 `z-index` 属性设置为 `999`。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('z-index'), '999');
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
index 16ed4e96d4d..bc7f275031f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
@@ -24,13 +24,13 @@ const text = document.querySelector('.daily-value.small-text')?.lastElementChild
 assert(text === 'Cholesterol 0mg 0%');
 ```
 
-Your new `p` element should have exactly three `span` elements.
+你的新的 `p` 元素应该有三个 `span` 元素。
 
 ```js
 assert(document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')?.length === 3);
 ```
 
-The text `Cholesterol` should be nested in a `span`.
+文本 `Cholesterol` 应该嵌套在 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -38,7 +38,7 @@ const cholesterolSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*Cho
 assert(cholesterolSpan.length === 1);
 ```
 
-Your `Cholesterol` `span` should have the `class` attribute set to `bold`.
+你的 `Cholesterol` `span` 应该有 `class` 属性设置为 `bold`。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -46,7 +46,7 @@ const cholesterolSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*Cho
 assert(cholesterolSpan[0]?.classList?.contains('bold'));
 ```
 
-The text `0%` should be nested in a `span`.
+文本 `0%` 应该嵌套在一个 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -54,7 +54,7 @@ const zeroPercentSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*0%[
 assert(zeroPercentSpan.length === 1);
 ```
 
-Your `0%` `span` should have the `class` attribute set to `bold`.
+你的 `0%` `span` 应该有 `class` 属性设置为 `bold`。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
@@ -62,7 +62,7 @@ const zeroPercentSpan = spans.filter(span => span?.innerHTML?.match(/^[\s\n]*0%[
 assert(zeroPercentSpan[0]?.classList?.contains('bold'));
 ```
 
-Your `Cholesterol` `span` and your `0mg` text should be wrapped in a `span`.
+你的 `Cholesterol` `span` 和 `0mg` 文本应该被包裹在 `span` 中。
 
 ```js
 const spans = [...document.querySelector('.daily-value.small-text')?.lastElementChild?.querySelectorAll('span')];
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
index c9fff63579d..a2c68909d06 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -21,8 +21,8 @@ Completa la funzione usando le regole sottostanti per modificare l'oggetto passa
 
 -   La funzione deve sempre restituire l'intero oggetto `records`.
 -   Se `value` è una stringa vuota, elimina la proprietà `prop` dall'album.
--   If `prop` isn't `tracks` and `value` isn't an empty string, assign the `value` to that album's `prop`.
--   If `prop` is `tracks` and value isn't an empty string, add the `value` to the end of the album's `tracks` array. You need to create this array first if the album does not have a `tracks` property.
+-   Se `prop` non è `tracks` e `value` non è una stringa vuota, assegna `value` alla `prop` di quell'album.
+-   Se `prop` è `tracks` e il valore non è una stringa vuota, aggiungi `value` alla fine dell'array `tracks`. Devi prima creare questo array se l'album non ha una proprietà `tracks`.
 
 **Nota:** una copia dell'oggetto `recordCollection` viene utilizzata per i test. Non dovresti modificare direttamente l'oggetto `recordCollection`.
 
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index dd26a4d6dad..efb3b60393b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -35,7 +35,7 @@ Dovresti aggiungere un waypoint del `40%` per `@keyframes wave`.
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].some(css => css?.keyText === '40%'));
 ```
 
-You should have 4 waypoints in your keyframe.
+Dovresti avere 4 waypoint nel keyframe.
 
 ```js
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].length === 4);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md
index 580ba5807a3..0dc09a0906f 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-26-reciprocal-cycles.md
@@ -8,41 +8,41 @@ dashedName: problem-26-reciprocal-cycles
 
 # --description--
 
-A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
+Una frazione unitaria contiene 1 nel numeratore. La rappresentazione decimale delle frazioni unitarie con i denominatori da 2 a 10 è indicata con:
 
-<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div><sup>1</sup>/<sub>2</sub> = 0.5</div><div><sup>1</sup>/<sub>3</sub> = 0.(3)</div><div><sup>1</sup>/<sub>4</sub> = 0.25</div><div><sup>1</sup>/<sub>5</sub> = 0.2</div><div><sup>1</sup>/<sub>6</sub> = 0.1(6)</div><div><sup>1</sup>/<sub>7</sub> = 0.(142857)</div><div><sup>1</sup>/<sub>8</sub> = 0.125</div><div><sup>1</sup>/<sub>9</sub> = 0.(1)</div><div><sup>1</sup>/<sub>10</sub> = 0.1</div></div>
+<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div><sup>1</sup>/<sub>2</sub> = 0.5</div><div><sup>1</sup>/<sub>3</sub> = 0.(3)</div><div><sup>1</sup>/<sub>4</sub> = 0.25</div><div><sup>1</sup>/<sub>5</sub> = 0.2</div><div><sup>1</sup>/<sub>6</sub> = 0.1(6)</div><div><sup>1</sup>/<sub>7</sub> = 0.(142857)</div><div><sup>1</sup>/<sub>8</sub> = 0.125</div><div><sup>1</sup>/<sub>9</sub> = 0.(1)</div><div><sup>1</sup>/<sub>10</sub> = 0.1</div></div>
 
-Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.
+Dove 0.1(6) significa 0.1666..., e ha una cifra periodica. Si può vedere che <sup>1</sup>/<sub>7</sub> ha un periodo di 6 cifre.
 
-Find the value of `d` &lt; `n` for which <sup>1</sup>/<sub>d</sub> contains the longest recurring cycle in its decimal fraction part.
+Trova il valore di `d` &lt; `n` per il quale <sup>1</sup>/<sub>d</sub> contiene il periodo più lungo nella sua parte decimale.
 
 # --hints--
 
-`reciprocalCycles(700)` should return a number.
+`reciprocalCycles(700)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof reciprocalCycles(700) === 'number');
 ```
 
-`reciprocalCycles(700)` should return 659.
+`reciprocalCycles(700)` dovrebbe restituire 659.
 
 ```js
 assert(reciprocalCycles(700) == 659);
 ```
 
-`reciprocalCycles(800)` should return 743.
+`reciprocalCycles(800)` dovrebbe restituire 743.
 
 ```js
 assert(reciprocalCycles(800) == 743);
 ```
 
-`reciprocalCycles(900)` should return 887.
+`reciprocalCycles(900)` dovrebbe restituire 887.
 
 ```js
 assert(reciprocalCycles(900) == 887);
 ```
 
-`reciprocalCycles(1000)` should return 983.
+`reciprocalCycles(1000)` dovrebbe restituire 983.
 
 ```js
 assert(reciprocalCycles(1000) == 983);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md
index e7c8ebe01eb..9f1d5a5f2ce 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-27-quadratic-primes.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3871000cf542c50fe9a
-title: 'Problem 27: Quadratic primes'
+title: 'Problema 27: primi quadratici'
 challengeType: 1
 forumTopicId: 301919
 dashedName: problem-27-quadratic-primes
@@ -8,51 +8,51 @@ dashedName: problem-27-quadratic-primes
 
 # --description--
 
-Euler discovered the remarkable quadratic formula:
+Eulero ha scoperto la formula quadratica notevole:
 
 <div style='margin-left: 4em;'>$n^2 + n + 41$</div>
 
-It turns out that the formula will produce 40 primes for the consecutive integer values $0 \\le n \\le 39$. However, when $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ is divisible by 41, and certainly when $n = 41, 41^2 + 41 + 41$ is clearly divisible by 41.
+Si scopre che la formula produrrà 40 primi per i valori interi consecutivi $0 \\le n \\le 39$. Tuttavia, quando $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ è divisibile per 41, e quando $n = 41, 41^2 + 41 + 41 $ è chiaramente divisibile per 41.
 
-The incredible formula $n^2 - 79n + 1601$ was discovered, which produces 80 primes for the consecutive values $0 \\le n \\le 79$. The product of the coefficients, −79 and 1601, is −126479.
+Si è scoperta l'incredibile formula $n^2 - 79n + 1601$ che produce 80 primi per i valori consecutivi $0 \\le n \\le 79$. Il prodotto dei coefficienti, −79 e 1601, è −126479.
 
-Considering quadratics of the form:
+Considerando le quadratiche della forma:
 
 <div style='margin-left: 4em;'>
-  $n^2 + an + b$, where $|a| < range$ and $|b| \le range$<br>
-  where $|n|$ is the modulus/absolute value of $n$<br>
-  e.g. $|11| = 11$ and $|-4| = 4$<br>
+  $n^2 + an + b$, dove $|a| < range$ e $|b| \le range$<br>
+  dove $|n|$ è il valore assoluto di $n$<br>
+  ad esempio $|11| = 11$ e $|-4| = 4$<br>
 </div>
 
-Find the product of the coefficients, $a$ and $b$, for the quadratic expression that produces the maximum number of primes for consecutive values of $n$, starting with $n = 0$.
+Trova il prodotto dei coefficienti, $a$ e $b$ per l'espressione quadratica che produce il numero massimo di numeri primi per valori consecutivi di $n$, a partire da $n = 0$.
 
 # --hints--
 
-`quadraticPrimes(200)` should return a number.
+`quadraticPrimes(200)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof quadraticPrimes(200) === 'number');
 ```
 
-`quadraticPrimes(200)` should return -4925.
+`quadraticPrimes(200)` dovrebbe restituire -4925.
 
 ```js
 assert(quadraticPrimes(200) == -4925);
 ```
 
-`quadraticPrimes(500)` should return -18901.
+`quadraticPrimes(500)` dovrebbe restituire -18901.
 
 ```js
 assert(quadraticPrimes(500) == -18901);
 ```
 
-`quadraticPrimes(800)` should return -43835.
+`quadraticPrimes(800)` dovrebbe restituire -43835.
 
 ```js
 assert(quadraticPrimes(800) == -43835);
 ```
 
-`quadraticPrimes(1000)` should return -59231.
+`quadraticPrimes(1000)` dovrebbe restituire -59231.
 
 ```js
 assert(quadraticPrimes(1000) == -59231);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md
index eee50073f68..0b667734956 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-28-number-spiral-diagonals.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3881000cf542c50fe9b
-title: 'Problem 28: Number spiral diagonals'
+title: 'Problema 28: le diagonali della spirale di numeri'
 challengeType: 1
 forumTopicId: 301930
 dashedName: problem-28-number-spiral-diagonals
@@ -8,7 +8,7 @@ dashedName: problem-28-number-spiral-diagonals
 
 # --description--
 
-Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
+Iniziando con il numero 1 e muovendosi a destra in direzione oraria, una spirale 5 per 5 è formata come segue:
 
 <div style='padding-left: 4em;'>
   <div style='color: red; display: inline;'>21</div> 22 23 24 <div style='color: red; display: inline;'>25</div><br>
@@ -18,37 +18,37 @@ Starting with the number 1 and moving to the right in a clockwise direction a 5
   <div style='color: red; display: inline;'>17</div> 16 15 14 <div style='color: red; display: inline;'>13</div><br>
 </div>
 
-It can be verified that the sum of the numbers on the diagonals is 101.
+Può essere verificato che la somma di tutti i numeri sulle diagonali è 101.
 
-What is the sum of the numbers on the diagonals in an `n` by `n` spiral formed in the same way?
+Quale è la somma dei numeri sulle diagonali di una spirale `n` per `n` formata nello stesso modo?
 
 # --hints--
 
-`spiralDiagonals(101)` should return a number.
+`spiralDiagonals(101)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof spiralDiagonals(101) === 'number');
 ```
 
-`spiralDiagonals(101)` should return 692101.
+`spiralDiagonals(101)` dovrebbe restituire 692101.
 
 ```js
 assert(spiralDiagonals(101) == 692101);
 ```
 
-`spiralDiagonals(303)` should return 18591725.
+`spiralDiagonals(303)` dovrebbe restituire 18591725.
 
 ```js
 assert(spiralDiagonals(303) == 18591725);
 ```
 
-`spiralDiagonals(505)` should return 85986601.
+`spiralDiagonals(505)` dovrebbe restituire 85986601.
 
 ```js
 assert(spiralDiagonals(505) == 85986601);
 ```
 
-`spiralDiagonals(1001)` should return 669171001.
+`spiralDiagonals(1001)` dovrebbe restituire 669171001.
 
 ```js
 assert(spiralDiagonals(1001) == 669171001);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md
index 4b8f00162ee..0610d9886e0 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-29-distinct-powers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3891000cf542c50fe9c
-title: 'Problem 29: Distinct powers'
+title: 'Problema 29: Potenze distinte'
 challengeType: 1
 forumTopicId: 301941
 dashedName: problem-29-distinct-powers
@@ -8,7 +8,7 @@ dashedName: problem-29-distinct-powers
 
 # --description--
 
-Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+Considera tutte le combinazioni intere di $a^b$ per 2 ≤ a ≤ 5 e 2 ≤ b ≤ 5:
 
 <div style='padding-left: 4em;'>
   2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@@ -17,41 +17,41 @@ Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
   5<sup>2</sup>=25, 5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125 <br>
 </div>
 
-If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+Se sono successivamente posizionati in ordine numerico, con eventuali ripetizioni rimosse, otteniamo la seguente sequenza di 15 termini distinti:
 
 <div style='padding-left: 4em;'>
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 </div>
 
-How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+Quanti termini distinti ci sono nella sequenza generata da $a^b$ per 2 ≤ `a` ≤ `n` e 2 ≤ `b` ≤ `n`?
 
 # --hints--
 
-`distinctPowers(15)` should return a number.
+`distinctPowers(15)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof distinctPowers(15) === 'number');
 ```
 
-`distinctPowers(15)` should return 177.
+`distinctPowers(15)` dovrebbe restituire 177.
 
 ```js
 assert.strictEqual(distinctPowers(15), 177);
 ```
 
-`distinctPowers(20)` should return 324.
+`distinctPowers(20)` dovrebbe restituire 324.
 
 ```js
 assert.strictEqual(distinctPowers(20), 324);
 ```
 
-`distinctPowers(25)` should return 519.
+`distinctPowers(25)` dovrebbe restituire 519.
 
 ```js
 assert.strictEqual(distinctPowers(25), 519);
 ```
 
-`distinctPowers(30)` should return 755.
+`distinctPowers(30)` dovrebbe restituire 755.
 
 ```js
 assert.strictEqual(distinctPowers(30), 755);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md
index 1e7472bce84..2b709707caa 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-30-digit-n-powers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f38a1000cf542c50fe9d
-title: 'Problem 30: Digit n powers'
+title: 'Problema 30: potenze delle cifre'
 challengeType: 1
 forumTopicId: 301953
 dashedName: problem-30-digit-n-powers
@@ -8,7 +8,7 @@ dashedName: problem-30-digit-n-powers
 
 # --description--
 
-Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
+Sorprendentemente ci sono solo tre numeri che possono essere scritti come la somma delle quarte potenze delle loro cifre:
 
 <div style='margin-left: 4em;'>
   1634 = 1<sup>4</sup> + 6<sup>4</sup> + 3<sup>4</sup> + 4<sup>4</sup><br>
@@ -16,39 +16,39 @@ Surprisingly there are only three numbers that can be written as the sum of four
   9474 = 9<sup>4</sup> + 4<sup>4</sup> + 7<sup>4</sup> + 4<sup>4</sup><br>
 </div>
 
-As 1 = 1<sup>4</sup> is not a sum it is not included.
+Dato che 1 = 1<sup>4</sup> non è una somma, questo non viene incluso.
 
-The sum of these numbers is 1634 + 8208 + 9474 = 19316.
+La somma di questi numeri è 1634 + 8208 + 9474 = 19316.
 
-Find the sum of all the numbers that can be written as the sum of `n` powers of their digits.
+Trova la somma di tutti i numeri che possono essere scritti come la somma di `n` potenze delle loro cifre.
 
 # --hints--
 
-`digitnPowers(2)` should return a number.
+`digitnPowers(2)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof digitnPowers(2) === 'number');
 ```
 
-`digitnPowers(2)` should return 0.
+`digitnPowers(2)` dovrebbe restituire 0.
 
 ```js
 assert(digitnPowers(2) == 0);
 ```
 
-`digitnPowers(3)` should return 1301.
+`digitnPowers(3)` dovrebbe restituire 1301.
 
 ```js
 assert(digitnPowers(3) == 1301);
 ```
 
-`digitnPowers(4)` should return 19316.
+`digitnPowers(4)` dovrebbe restituire 19316.
 
 ```js
 assert(digitnPowers(4) == 19316);
 ```
 
-`digitnPowers(5)` should return 443839.
+`digitnPowers(5)` dovrebbe restituire 443839.
 
 ```js
 assert(digitnPowers(5) == 443839);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md
index ae4372cd69f..533546d510b 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-31-coin-sums.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f38b1000cf542c50fe9e
-title: 'Problem 31: Coin sums'
+title: 'Problema 31: somme di monete'
 challengeType: 1
 forumTopicId: 301965
 dashedName: problem-31-coin-sums
@@ -8,43 +8,43 @@ dashedName: problem-31-coin-sums
 
 # --description--
 
-In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
+In Inghilterra la moneta è composta da sterline, £, e pence, p, e ci sono 8 monete in circolazione:
 
-<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).</div>
+<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) e £2 (200p).</div>
 
-It is possible to make £2 in the following way:
+È possibile comporre 2 £ nel modo seguente:
 
 <div style='margin-left: 4em;'>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p</div>
 
-How many different ways can `n` pence be made using any number of coins?
+In quanti modi diversi si possono ottenere `n` pence usando qualsiasi numero di monete?
 
 # --hints--
 
-`coinSums(50)` should return a number.
+`coinSums(50)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof coinSums(50) === 'number');
 ```
 
-`coinSums(50)` should return 451.
+`coinSums(50)` dovrebbe restituire 451.
 
 ```js
 assert(coinSums(50) == 451);
 ```
 
-`coinSums(100)` should return 4563.
+`coinSums(100)` dovrebbe restituire 4563.
 
 ```js
 assert(coinSums(100) == 4563);
 ```
 
-`coinSums(150)` should return 21873.
+`coinSums(150)` dovrebbe restituire 21873.
 
 ```js
 assert(coinSums(150) == 21873);
 ```
 
-`coinSums(200)` should return 73682.
+`coinSums(200)` dovrebbe restituire 73682.
 
 ```js
 assert(coinSums(200) == 73682);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md
index 5fe7d0495c5..8cb0605f8f4 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-32-pandigital-products.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f38c1000cf542c50fe9f
-title: 'Problem 32: Pandigital products'
+title: 'Problema 32: prodotti pandigitali'
 challengeType: 1
 forumTopicId: 301976
 dashedName: problem-32-pandigital-products
@@ -8,47 +8,47 @@ dashedName: problem-32-pandigital-products
 
 # --description--
 
-We shall say that an `n`-digit number is pandigital if it makes use of all the digits 1 to `n` exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
+Possiamo dire che un numero di `n` cifre è pandigitale se usa tutte le cifre da 1 a `n` esattamente una volta; per esempio, il numero a 5 cifre 15234 è pandigitale per le cifre da 1 a 5.
 
-The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
+Il prodotto 7254 è inusuale, in quanto l'identità 39 x 186 = 7254, contenente moltiplicando, moltiplicatore, e prodotto, è pandigitale per le cifre da 1 a 9.
 
-Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through `n` pandigital.
+Trova le somme di tutti i prodotti la cui identità moltiplicando/moltiplicatore/prodotto può essere scritta come pandigitale per le cifre da 1 a `n`.
 
-**Hint:** Some products can be obtained in more than one way so be sure to only include it once in your sum.
+**Indizio:** Alcuni prodotti possono essere ottenuti in più di un modo quindi assicurati di includerli una volta sola nella tua somma.
 
 # --hints--
 
-`pandigitalProducts(4)` should return a number.
+`pandigitalProducts(4)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof pandigitalProducts(4) === 'number');
 ```
 
-`pandigitalProducts(4)` should return `12`.
+`pandigitalProducts(4)` dovrebbe restituire `12`.
 
 ```js
 assert.strictEqual(pandigitalProducts(4), 12);
 ```
 
-`pandigitalProducts(6)` should return `162`.
+`pandigitalProducts(6)` dovrebbe restituire `162`.
 
 ```js
 assert.strictEqual(pandigitalProducts(6), 162);
 ```
 
-`pandigitalProducts(7)` should return `0`.
+`pandigitalProducts(7)` dovrebbe restituire `0`.
 
 ```js
 assert.strictEqual(pandigitalProducts(7), 0);
 ```
 
-`pandigitalProducts(8)` should return `13458`.
+`pandigitalProducts(8)` dovrebbe restituire `13458`.
 
 ```js
 assert.strictEqual(pandigitalProducts(8), 13458);
 ```
 
-`pandigitalProducts(9)` should return `45228`.
+`pandigitalProducts(9)` dovrebbe restituire `45228`.
 
 ```js
 assert.strictEqual(pandigitalProducts(9), 45228);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md
index 5419f2f8270..8bc9ef0f9fc 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-33-digit-cancelling-fractions.md
@@ -8,23 +8,23 @@ dashedName: problem-33-digit-cancelling-fractions
 
 # --description--
 
-The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct, is obtained by cancelling the 9s.
+La frazione <sup>49</sup>/<sub>98</sub> è una frazione peculiare, poiché un matematico senza esperienza tentando di semplificarla potrebbe credere incorrettamente che la semplificazione <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, che è corretta, è ottenuta cancellando i 9.
 
-We shall consider fractions like, <sup>30</sup>/<sub>50</sub> = <sup>3</sup>/<sub>5</sub>, to be trivial examples.
+Possiamo considerare frazioni come <sup>30</sup>/<sub>50</sub> = <sup>3</sup>/<sub>5</sub> un esempio triviale.
 
-There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.
+Ci sono esattamente quattro esempi non triviali di questo tipo di frazioni, con valore minore di 1, e contenenti due cifre al numeratore e denominatore.
 
-If the product of these four fractions is given in its lowest common terms, find the value of the denominator.
+Se il prodotto di queste quattro frazioni è dato nel formato semplificato, trova il valore del denominatore.
 
 # --hints--
 
-`digitCancellingFractions()` should return a number.
+`digitCancellingFractions()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof digitCancellingFractions() === 'number');
 ```
 
-`digitCancellingFractions()` should return 100.
+`digitCancellingFractions()` dovrebbe restituire 100.
 
 ```js
 assert.strictEqual(digitCancellingFractions(), 100);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md
index 2eb87f93ba1..de78cadb2f3 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-34-digit-factorials.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f38e1000cf542c50fea1
-title: 'Problem 34: Digit factorials'
+title: 'Problema 34: fattoriali delle cifre'
 challengeType: 1
 forumTopicId: 301998
 dashedName: problem-34-digit-factorials
@@ -8,15 +8,15 @@ dashedName: problem-34-digit-factorials
 
 # --description--
 
-145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
+145 è un numero curioso, visto che 1! + 4! + 5! = 1 + 24 + 120 = 145.
 
-Find the numbers and the sum of the numbers which are equal to the sum of the factorial of their digits.
+Trova i numeri e le somme dei numeri che sono uguali alla somma dei fattoriali delle loro cifre.
 
-**Note:** as 1! = 1 and 2! = 2 are not sums they are not included.
+**Nota:** visto che 1! = 1 e 2! = 2 non sono somme non sono inclusi.
 
 # --hints--
 
-`digitFactorial()` should return an object.
+`digitFactorial()` dovrebbe restituire un oggetto.
 
 ```js
 assert.typeOf(digitFactorial(), 'object');
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md
index aaae9562bb0..7f1f0e8ea6e 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-35-circular-primes.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f38f1000cf542c50fea2
-title: 'Problem 35: Circular primes'
+title: 'Problema 35: numeri primi circolari'
 challengeType: 1
 forumTopicId: 302009
 dashedName: problem-35-circular-primes
@@ -8,55 +8,55 @@ dashedName: problem-35-circular-primes
 
 # --description--
 
-The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
+Il numero 197 è detto numero primo circolare perché tutte le rotazioni delle cifre: 197, 971 e 719, rappresentano numeri primi.
 
-There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
+Esistono tredici numeri primi di questo tipo sotto il 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 e 97.
 
-How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
+Quanti primi circolari ci sono sotto `n`, dove 100 ≤ `n` ≤ 1000000?
 
-**Note:**
+**Nota:**
 
-Circular primes individual rotation can exceed `n`.
+La rotazione individuale di primi circolari può superare `n`.
 
 # --hints--
 
-`circularPrimes(100)` should return a number.
+`circularPrimes(100)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof circularPrimes(100) === 'number');
 ```
 
-`circularPrimes(100)` should return 13.
+`circularPrimes(100)` dovrebbe restituire 13.
 
 ```js
 assert(circularPrimes(100) == 13);
 ```
 
-`circularPrimes(100000)` should return 43.
+`circularPrimes(100000)` dovrebbe restituire 43.
 
 ```js
 assert(circularPrimes(100000) == 43);
 ```
 
-`circularPrimes(250000)` should return 45.
+`circularPrimes(250000)` dovrebbe restituire 45.
 
 ```js
 assert(circularPrimes(250000) == 45);
 ```
 
-`circularPrimes(500000)` should return 49.
+`circularPrimes(500000)` dovrebbe restituire 49.
 
 ```js
 assert(circularPrimes(500000) == 49);
 ```
 
-`circularPrimes(750000)` should return 49.
+`circularPrimes(750000)` dovrebbe restituire 49.
 
 ```js
 assert(circularPrimes(750000) == 49);
 ```
 
-`circularPrimes(1000000)` should return 55.
+`circularPrimes(1000000)` dovrebbe restituire 55.
 
 ```js
 assert(circularPrimes(1000000) == 55);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md
index 9793d760c20..98fc0b2f097 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-36-double-base-palindromes.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3901000cf542c50fea3
-title: 'Problem 36: Double-base palindromes'
+title: 'Problema 36: palindromi in doppia base'
 challengeType: 1
 forumTopicId: 302020
 dashedName: problem-36-double-base-palindromes
@@ -8,39 +8,39 @@ dashedName: problem-36-double-base-palindromes
 
 # --description--
 
-The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
+Il numero decimale 585 = 1001001001<sub>2</sub> (binario) è un palindromo in entrambe le basi.
 
-Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, which are palindromic in base 10 and base 2.
+Trova la somma di tutti i numeri minori di `n`, dove 1000 ≤ `n` ≤ 1000000, che sono palindromi in base 10 e in base 2.
 
-(Please note that the palindromic number, in either base, may not include leading zeros.)
+(Nota che il numero palindromo, in entrambe le basi, non può includere zeri iniziali.)
 
 # --hints--
 
-`doubleBasePalindromes(1000)` should return a number.
+`doubleBasePalindromes(1000)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof doubleBasePalindromes(1000) === 'number');
 ```
 
-`doubleBasePalindromes(1000)` should return 1772.
+`doubleBasePalindromes(1000)` dovrebbe restituire 1772.
 
 ```js
 assert(doubleBasePalindromes(1000) == 1772);
 ```
 
-`doubleBasePalindromes(50000)` should return 105795.
+`doubleBasePalindromes(50000)` dovrebbe restituire 105795.
 
 ```js
 assert(doubleBasePalindromes(50000) == 105795);
 ```
 
-`doubleBasePalindromes(500000)` should return 286602.
+`doubleBasePalindromes(500000)` dovrebbe restituire 286602.
 
 ```js
 assert(doubleBasePalindromes(500000) == 286602);
 ```
 
-`doubleBasePalindromes(1000000)` should return 872187.
+`doubleBasePalindromes(1000000)` dovrebbe restituire 872187.
 
 ```js
 assert(doubleBasePalindromes(1000000) == 872187);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md
index 5d4c80d5252..ff9281bccf1 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-37-truncatable-primes.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3911000cf542c50fea4
-title: 'Problem 37: Truncatable primes'
+title: 'Problema 37: numeri primi troncabili'
 challengeType: 1
 forumTopicId: 302031
 dashedName: problem-37-truncatable-primes
@@ -8,39 +8,39 @@ dashedName: problem-37-truncatable-primes
 
 # --description--
 
-The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.
+Il numero 3797 ha una proprietà interessante. Essendo esso stesso un numero primo, è possibile rimuovere continuamente cifre da sinistra a destra, e rimane primo a ogni stadio: 3797, 797, 97 e 7. Allo stesso modo possiamo farlo da destra a sinistra: 3797, 379, 37 e 3.
 
-Find the sum of the only `n` (8 ≤ `n` ≤ 11) primes that are both truncatable from left to right and right to left.
+Trova la somma dei soli `n` (8 ≤ `n` ≤ 11) numeri primi che sono troncabili sia da sinistra a destra che da destra a sinistra.
 
-NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
+NOTA: 2, 3, 5, e 7 non sono considerati numeri primi troncabili.
 
 # --hints--
 
-`truncatablePrimes(8)` should return a number.
+`truncatablePrimes(8)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof truncatablePrimes(8) === 'number');
 ```
 
-`truncatablePrimes(8)` should return 1986.
+`truncatablePrimes(8)` dovrebbe restituire 1986.
 
 ```js
 assert(truncatablePrimes(8) == 1986);
 ```
 
-`truncatablePrimes(9)` should return 5123.
+`truncatablePrimes(9)` dovrebbe restituire 5123.
 
 ```js
 assert(truncatablePrimes(9) == 5123);
 ```
 
-`truncatablePrimes(10)` should return 8920.
+`truncatablePrimes(10)` dovrebbe restituire 8920.
 
 ```js
 assert(truncatablePrimes(10) == 8920);
 ```
 
-`truncatablePrimes(11)` should return 748317.
+`truncatablePrimes(11)` dovrebbe restituire 748317.
 
 ```js
 assert(truncatablePrimes(11) == 748317);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md
index a1190e84f39..8f933b9f72d 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-38-pandigital-multiples.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3931000cf542c50fea5
-title: 'Problem 38: Pandigital multiples'
+title: 'Problema 38: multipli pandigitali'
 challengeType: 1
 forumTopicId: 302042
 dashedName: problem-38-pandigital-multiples
@@ -8,33 +8,33 @@ dashedName: problem-38-pandigital-multiples
 
 # --description--
 
-Take the number 192 and multiply it by each of 1, 2, and 3:
+Prendi il numero 192 e moltiplicalo separatamente per 1, 2 e 3:
 
 $$\begin{align}   192 × 1 = 192\\\\
   192 × 2 = 384\\\\   192 × 3 = 576\\\\
 \end{align}$$
 
-By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1, 2, 3).
+Concatenando ogni prodotto otteniamo il pandigitale di cifre da 1 a 9, 192384576. Chiamiamo 192384576 il prodotto concatenato di 192 e (1, 2, 3).
 
-The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1, 2, 3, 4, 5).
+Lo stesso può essere ottenuto iniziando con 9 e moltiplicandolo per 1, 2, 3, 4, e 5, dando il numero pandigitale 918273645, che è il prodotto concatenato di 9 e (1, 2, 3, 4, 5).
 
-What is the largest 1 to `k` pandigital `k`-digit number that can be formed as the concatenated product of an integer with (1, 2, ..., `n`) where `n` > 1?
+Quale è il pandigitale con cifre da 1 a `k` lungo `k` cifre che può essere formato come prodotto concatenato di un numeri intero (1, 2, ..., `n`) dove `n` > 1?
 
 # --hints--
 
-`pandigitalMultiples(8)` should return a number.
+`pandigitalMultiples(8)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof pandigitalMultiples(8) === 'number');
 ```
 
-`pandigitalMultiples(8)` should return `78156234`.
+`pandigitalMultiples(8)` dovrebbe restituire `78156234`.
 
 ```js
 assert.strictEqual(pandigitalMultiples(8), 78156234);
 ```
 
-`pandigitalMultiples(9)` should return `932718654`.
+`pandigitalMultiples(9)` dovrebbe restituire `932718654`.
 
 ```js
 assert.strictEqual(pandigitalMultiples(9), 932718654);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md
index f1957262624..57989a3055d 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-39-integer-right-triangles.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3931000cf542c50fea6
-title: 'Problem 39: Integer right triangles'
+title: 'Problema 39: triangoli rettangoli interi'
 challengeType: 1
 forumTopicId: 302054
 dashedName: problem-39-integer-right-triangles
@@ -8,39 +8,39 @@ dashedName: problem-39-integer-right-triangles
 
 # --description--
 
-If `p` is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.
+Se `p` è il perimetro di un triangolo rettangolo con lunghezza dei lati di numeri interi, {a,b,c}, ci sono esattamente tre soluzioni per p = 120.
 
 {20,48,52}, {24,45,51}, {30,40,50}
 
-For which value of `p` ≤ `n`, is the number of solutions maximized?
+Per quale valore di `p` ≤ `n` il numero delle soluzioni viene massimizzato?
 
 # --hints--
 
-`intRightTriangles(500)` should return a number.
+`intRightTriangles(500)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof intRightTriangles(500) === 'number');
 ```
 
-`intRightTriangles(500)` should return 420.
+`intRightTriangles(500)` dovrebbe restituire 420.
 
 ```js
 assert(intRightTriangles(500) == 420);
 ```
 
-`intRightTriangles(800)` should return 720.
+`intRightTriangles(800)` dovrebbe restituire 720.
 
 ```js
 assert(intRightTriangles(800) == 720);
 ```
 
-`intRightTriangles(900)` should return 840.
+`intRightTriangles(900)` dovrebbe restituire 840.
 
 ```js
 assert(intRightTriangles(900) == 840);
 ```
 
-`intRightTriangles(1000)` should return 840.
+`intRightTriangles(1000)` dovrebbe restituire 840.
 
 ```js
 assert(intRightTriangles(1000) == 840);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md
index c4386bd2d91..29e111cd5bf 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-40-champernownes-constant.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3941000cf542c50fea7
-title: 'Problem 40: Champernowne''s constant'
+title: 'Problema 40: costante di Champernowne'
 challengeType: 1
 forumTopicId: 302066
 dashedName: problem-40-champernownes-constant
@@ -8,37 +8,37 @@ dashedName: problem-40-champernownes-constant
 
 # --description--
 
-An irrational decimal fraction is created by concatenating the positive integers:
+Una frazione decimale irrazionale è creata concatenando i numeri interi positivi:
 
 0.12345678910**1**112131415161718192021...
 
-It can be seen that the 12<sup>th</sup> digit of the fractional part is 1.
+Puoi vedere che la dodicesima cifra della parte frazionale è 1.
 
-If *d<sub>n</sub>* represents the *n*<sup>th</sup> digit of the fractional part, find the value of the following expression.
+Se *d<sub>n</sub>* rappresenta l'*n*-esima cifra della parte decimale, trova il valore di questa espressione.
 
 d<sub>1</sub> × d<sub>10</sub> × d<sub>100</sub> × d<sub>1000</sub> × d<sub>10000</sub> × d<sub>100000</sub> × d<sub>1000000</sub>
 
 # --hints--
 
-`champernownesConstant(100)` should return a number.
+`champernownesConstant(100)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof champernownesConstant(100) === 'number');
 ```
 
-`champernownesConstant(100)` should return 5.
+`champernownesConstant(100)` dovrebbe restituire 5.
 
 ```js
 assert.strictEqual(champernownesConstant(100), 5);
 ```
 
-`champernownesConstant(1000)` should return 15.
+`champernownesConstant(1000)` dovrebbe restituire 15.
 
 ```js
 assert.strictEqual(champernownesConstant(1000), 15);
 ```
 
-`champernownesConstant(1000000)` should return 210.
+`champernownesConstant(1000000)` dovrebbe restituire 210.
 
 ```js
 assert.strictEqual(champernownesConstant(1000000), 210);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md
index a774fa31167..3f75ccb8978 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-41-pandigital-prime.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3951000cf542c50fea8
-title: 'Problem 41: Pandigital prime'
+title: 'Problema 41: numeri primi pandigitali'
 challengeType: 1
 forumTopicId: 302078
 dashedName: problem-41-pandigital-prime
@@ -8,25 +8,25 @@ dashedName: problem-41-pandigital-prime
 
 # --description--
 
-We shall say that an `n`-digit number is pandigital if it makes use of all the digits 1 to `n` exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
+Diciamo che un numero di cifre `n` è pandigitale se utilizza tutte le cifre da 1 a `n` esattamente una volta. Ad esempio, 2143 è un pandigitale a 4 cifre ed è anche primo.
 
-What is the largest `n`-length digit pandigital prime that exists?
+Qual è il più grande pandigitale primo a `n` cifre esistente?
 
 # --hints--
 
-`pandigitalPrime(4)` should return a number.
+`pandigitalPrime(4)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof pandigitalPrime(4) === 'number');
 ```
 
-`pandigitalPrime(4)` should return 4231.
+`pandigitalPrime(4)` dovrebbe restituire 4231.
 
 ```js
 assert(pandigitalPrime(4) == 4231);
 ```
 
-`pandigitalPrime(7)` should return 7652413.
+`pandigitalPrime(7)` dovrebbe restituire 7652413.
 
 ```js
 assert(pandigitalPrime(7) == 7652413);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md
index abda6f2d137..17cc717947d 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-42-coded-triangle-numbers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3961000cf542c50fea9
-title: 'Problem 42: Coded triangle numbers'
+title: 'Problema 42: numeri triangolari codificati'
 challengeType: 1
 forumTopicId: 302089
 dashedName: problem-42-coded-triangle-numbers
@@ -8,41 +8,41 @@ dashedName: problem-42-coded-triangle-numbers
 
 # --description--
 
-The `n`<sup>th</sup> term of the sequence of triangle numbers is given by, `tn` = ½`n`(`n`+1); so the first ten triangle numbers are:
+L'`n`-esimo termine di una sequenza di numeri triangolari è dato da `tn` = ½`n`(`n`+1); quindi i primi dieci numeri triangolari sono:
 
 <div style='margin-left: 4em;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
 
-By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = `t`<sub>10</sub>. If the word value is a triangle number then we shall call the word a triangle word.
+Convertendo ogni lettera in una parola in un numero corrispondente alla sua posizione nell'alfabeto a 26 lettere, e sommando questi valori otteniamo il valore della parola. Per esempio, il valore della parola SKY è 19 + 11 + 25 = 55 = `t`<sub>10</sub>. Se il valore della parola è un numero triangolare allora chiamiamo questa parola triangolare.
 
-Using words array of `n`-length, how many are triangle words?
+Usando un array di parole di lunghezza `n`, quante sono le parole triangolari?
 
 # --hints--
 
-`codedTriangleNumbers(1400)` should return a number.
+`codedTriangleNumbers(1400)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof codedTriangleNumbers(1400) === 'number');
 ```
 
-`codedTriangleNumbers(1400)` should return 129.
+`codedTriangleNumbers(1400)` dovrebbe restituire 129.
 
 ```js
 assert(codedTriangleNumbers(1400) == 129);
 ```
 
-`codedTriangleNumbers(1500)` should return 137.
+`codedTriangleNumbers(1500)` dovrebbe restituire 137.
 
 ```js
 assert(codedTriangleNumbers(1500) == 137);
 ```
 
-`codedTriangleNumbers(1600)` should return 141.
+`codedTriangleNumbers(1600)` dovrebbe restituire 141.
 
 ```js
 assert(codedTriangleNumbers(1600) == 141);
 ```
 
-`codedTriangleNumbers(1786)` should return 162.
+`codedTriangleNumbers(1786)` dovrebbe restituire 162.
 
 ```js
 assert(codedTriangleNumbers(1786) == 162);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md
index 53ae7b50350..5d672312dae 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-43-sub-string-divisibility.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3971000cf542c50feaa
-title: 'Problem 43: Sub-string divisibility'
+title: 'Problema 43: divisibilità in sotto-stringhe'
 challengeType: 1
 forumTopicId: 302100
 dashedName: problem-43-sub-string-divisibility
@@ -8,49 +8,49 @@ dashedName: problem-43-sub-string-divisibility
 
 # --description--
 
-The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.
+Il numero 1406357289 è un numero pandigitale da 0 a 9 perché è costituito da ciascuna delle cifre da 0 a 9 in un certo ordine, ma ha anche una proprietà di divisibilità in sotto-stringhe piuttosto interessante.
 
-Let $d_1$ be the $1^{st}$ digit, $d_2$ be the $2^{nd}$ digit, and so on. In this way, we note the following:
+Let $d_1$ be the $1^{st}$ digit, $d_2$ be the $2^{nd}$ digit, and so on. In questo modo, notiamo quanto segue:
 
-- ${d_2}{d_3}{d_4} = 406$ is divisible by 2
-- ${d_3}{d_4}{d_5} = 063$ is divisible by 3
-- ${d_4}{d_5}{d_6} = 635$ is divisible by 5
-- ${d_5}{d_6}{d_7} = 357$ is divisible by 7
-- ${d_6}{d_7}{d_8} = 572$ is divisible by 11
-- ${d_7}{d_8}{d_9} = 728$ is divisible by 13
-- ${d_8}{d_9}{d_{10}} = 289$ is divisible by 17
+- ${d_2}{d_3}{d_4} = 406$ è divisibile per 2
+- ${d_3}{d_4}{d_5} = 063$ è divisibile per 3
+- ${d_4}{d_5}{d_6} = 635$ è divisibile per 5
+- ${d_5}{d_6}{d_7} = 357$ è divisibile per 7
+- ${d_6}{d_7}{d_8} = 572$ è divisibile per 11
+- ${d_7}{d_8}{d_9} = 728$ è divisibile per 13
+- ${d_8}{d_9}{d_{10}} = 289$ è divisibile per 17
 
-Find the sum of all 0 to `n` pandigital numbers with sub-strings fulfilling `n - 2` of these divisibility properties.
+Trova la somma di tutti i numeri pandigitali da 0 a `n` con sotto-stringhe che soddisfano `n - 2` di queste proprietà di divisibilità.
 
-**Note:** Pandigital numbers starting with `0` are to be considered in the result.
+**Nota:** i numeri pandigitali che iniziano con `0` devono essere considerati nel risultato.
 
 # --hints--
 
-`substringDivisibility(5)` should return a number.
+`substringDivisibility(5)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof substringDivisibility(5) === 'number');
 ```
 
-`substringDivisibility(5)` should return `12444480`.
+`substringDivisibility(5)` dovrebbe restituire `12444480`.
 
 ```js
 assert.strictEqual(substringDivisibility(5), 12444480)
 ```
 
-`substringDivisibility(7)` should return `1099210170`.
+`substringDivisibility(7)` dovrebbe restituire `1099210170`.
 
 ```js
 assert.strictEqual(substringDivisibility(7), 1099210170)
 ```
 
-`substringDivisibility(8)` should return `1113342912`.
+`substringDivisibility(8)` dovrebbe restituire `1113342912`.
 
 ```js
 assert.strictEqual(substringDivisibility(8), 1113342912)
 ```
 
-`substringDivisibility(9)` should return `16695334890`.
+`substringDivisibility(9)` dovrebbe restituire `16695334890`.
 
 ```js
 assert.strictEqual(substringDivisibility(9), 16695334890)
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md
index 44905c1be79..1a71252faa8 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-44-pentagon-numbers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3981000cf542c50feab
-title: 'Problem 44: Pentagon numbers'
+title: 'Problema 44: numeri pentagonali'
 challengeType: 1
 forumTopicId: 302111
 dashedName: problem-44-pentagon-numbers
@@ -8,23 +8,23 @@ dashedName: problem-44-pentagon-numbers
 
 # --description--
 
-Pentagonal numbers are generated by the formula, P<sub>n</sub>=`n`(3`n`−1)/2. The first ten pentagonal numbers are:
+Numeri pentagonali sono generati dalla formula P<sub>n</sub>=`n`(3`n`−1)/2. I primi dieci numeri pentagonali sono:
 
 1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
 
-It can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However, their difference, 70 − 22 = 48, is not pentagonal.
+Possiamo vedere che P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. D'altro canto, la loro differenza, 70 − 22 = 48, non è pentagonale.
 
-Find the pair of pentagonal numbers, P<sub>j</sub> and P<sub>k</sub>, for which their sum and difference are pentagonal and D = |P<sub>k</sub> − P<sub>j</sub>| is minimized; what is the value of D?
+Trova la coppia di numeri, P<sub>j</sub> e P<sub>k</sub>, per cui sia la loro somma che la loro differenza sono pentagonali e D = |P<sub>k</sub> − P<sub>j</sub>| è minimizzata; qual è il valore di D?
 
 # --hints--
 
-`pentagonNumbers()` should return a number.
+`pentagonNumbers()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof pentagonNumbers() === 'number');
 ```
 
-`pentagonNumbers()` should return 5482660.
+`pentagonNumbers()` dovrebbe restituire 5482660.
 
 ```js
 assert.strictEqual(pentagonNumbers(), 5482660);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md
index e80bcc8dd50..1e17c346b24 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3991000cf542c50feac
-title: 'Problem 45: Triangular, pentagonal, and hexagonal'
+title: 'Problema 45: triangolari, pentagonali ed esagonali'
 challengeType: 1
 forumTopicId: 302122
 dashedName: problem-45-triangular-pentagonal-and-hexagonal
@@ -8,25 +8,25 @@ dashedName: problem-45-triangular-pentagonal-and-hexagonal
 
 # --description--
 
-Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
+I numeri triangolari, pentagonali ed esagonali sono generati dalle seguenti formule:
 
-<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Triangle</div><div>T<sub>n</sub>=<var>n</var>(<var>n</var>+1)/2</div><div>1, 3, 6, 10, 15, ...</div></div>
-<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Pentagonal</div><div>P<sub>n</sub>=<var>n</var>(3<var>n</var>−1)/2</div><div>1, 5, 12, 22, 35, ...</div></div>
-<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Hexagonal</div><div>H<sub>n</sub>=<var>n</var>(2<var>n</var>−1)</div><div>1, 6, 15, 28, 45, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Triangolare</div><div>T<sub>n</sub>=<var>n</var>(<var>n</var>+1)/2</div><div>1, 3, 6, 10, 15, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Pentagonale</div><div>P<sub>n</sub>=<var>n</var>(3<var>n</var>−1)/2</div><div>1, 5, 12, 22, 35, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Esagonale</div><div>H<sub>n</sub>=<var>n</var>(2<var>n</var>−1)</div><div>1, 6, 15, 28, 45, ...</div></div>
 
-It can be verified that T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
+Si può verificare che T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
 
-Find the next triangle number that is also pentagonal and hexagonal.
+Trova il numero triangolare successivo che è anche pentagonale ed esagonale.
 
 # --hints--
 
-`triPentaHexa(40756)` should return a number.
+`triPentaHexa(40756)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof triPentaHexa(40756) === 'number');
 ```
 
-`triPentaHexa(40756)` should return 1533776805.
+`triPentaHexa(40756)` dovrebbe restituire 1533776805.
 
 ```js
 assert.strictEqual(triPentaHexa(40756), 1533776805);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md
index 1bcc859d05e..c9e3b622a2e 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-46-goldbachs-other-conjecture.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39a1000cf542c50fead
-title: 'Problem 46: Goldbach''s other conjecture'
+title: 'Problema 46: l''altra congettura di Goldbach'
 challengeType: 1
 forumTopicId: 302134
 dashedName: problem-46-goldbachs-other-conjecture
@@ -8,7 +8,7 @@ dashedName: problem-46-goldbachs-other-conjecture
 
 # --description--
 
-It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.
+È stato proposto da Christian Goldbach che ogni numero dispari composito può essere scritto come la somma di un primo e due volte un quadrato.
 
 <div style='margin-left: 2em;'>
   9 = 7 + 2×1<sup>2</sup><br>
@@ -19,19 +19,19 @@ It was proposed by Christian Goldbach that every odd composite number can be wri
   33 = 31 + 2×1<sup>2</sup>
 </div>
 
-It turns out that the conjecture was false.
+Si scoprì che la congettura era falsa.
 
-What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?
+Qual è il più piccolo composito dispari che non può essere scritto come la somma di un primo e due volte un quadrato?
 
 # --hints--
 
-`goldbachsOtherConjecture()` should return a number.
+`goldbachsOtherConjecture()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof goldbachsOtherConjecture() === 'number');
 ```
 
-`goldbachsOtherConjecture()` should return 5777.
+`goldbachsOtherConjecture()` dovrebbe restituire 5777.
 
 ```js
 assert.strictEqual(goldbachsOtherConjecture(), 5777);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md
index 3b79403a4ea..9fda3422f22 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-47-distinct-primes-factors.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39c1000cf542c50feae
-title: 'Problem 47: Distinct primes factors'
+title: 'Problema 47: fattori primi distinti'
 challengeType: 1
 forumTopicId: 302145
 dashedName: problem-47-distinct-primes-factors
@@ -8,14 +8,14 @@ dashedName: problem-47-distinct-primes-factors
 
 # --description--
 
-The first two consecutive numbers to have two distinct prime factors are:
+I primi due numeri consecutivi ad avere due distinti fattori primi sono:
 
 <div style='padding-left: 4em;'>
   14 = 2 × 7<br>
   15 = 3 × 5
 </div>
 
-The first three consecutive numbers to have three distinct prime factors are:
+I primi tre numeri consecutivi che hanno tre fattori primi distinti sono:
 
 <div style='padding-left: 4em;'>
   644 = 2<sup>2</sup> × 7 × 23<br>
@@ -23,29 +23,29 @@ The first three consecutive numbers to have three distinct prime factors are:
   646 = 2 × 17 × 19
 </div>
 
-Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?
+Trova i primi quattro interi consecutivi ad avere quattro distinti fattori primi ciascuno. Qual è il primo di questi numeri?
 
 # --hints--
 
-`distinctPrimeFactors(2, 2)` should return a number.
+`distinctPrimeFactors(2, 2)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof distinctPrimeFactors(2, 2) === 'number');
 ```
 
-`distinctPrimeFactors(2, 2)` should return 14.
+`distinctPrimeFactors(2, 2)` dovrebbe restituire 14.
 
 ```js
 assert.strictEqual(distinctPrimeFactors(2, 2), 14);
 ```
 
-`distinctPrimeFactors(3, 3)` should return 644.
+`distinctPrimeFactors(3, 3)` dovrebbe restituire 644.
 
 ```js
 assert.strictEqual(distinctPrimeFactors(3, 3), 644);
 ```
 
-`distinctPrimeFactors(4, 4)` should return 134043.
+`distinctPrimeFactors(4, 4)` dovrebbe restituire 134043.
 
 ```js
 assert.strictEqual(distinctPrimeFactors(4, 4), 134043);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md
index d429c978791..364f22d04e3 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-48-self-powers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39c1000cf542c50feaf
-title: 'Problem 48: Self powers'
+title: 'Problema 48: auto-potenze'
 challengeType: 1
 forumTopicId: 302157
 dashedName: problem-48-self-powers
@@ -8,37 +8,37 @@ dashedName: problem-48-self-powers
 
 # --description--
 
-The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
+La serie 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
 
-Find the last ten digits of the series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.
+Trova le ultime dieci cifre della serie 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.
 
 # --hints--
 
-`selfPowers(10, 3)` should return a number.
+`selfPowers(10, 3)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof selfPowers(10, 3) === 'number');
 ```
 
-`selfPowers(10, 3)` should return 317.
+`selfPowers(10, 3)` dovrebbe restituire 317.
 
 ```js
 assert.strictEqual(selfPowers(10, 3), 317);
 ```
 
-`selfPowers(150, 6)` should return 29045.
+`selfPowers(150, 6)` dovrebbe restituire 29045.
 
 ```js
 assert.strictEqual(selfPowers(150, 6), 29045);
 ```
 
-`selfPowers(673, 7)` should return 2473989.
+`selfPowers(673, 7)` dovrebbe restituire 2473989.
 
 ```js
 assert.strictEqual(selfPowers(673, 7), 2473989);
 ```
 
-`selfPowers(1000, 10)` should return 9110846700.
+`selfPowers(1000, 10)` dovrebbe restituire 9110846700.
 
 ```js
 assert.strictEqual(selfPowers(1000, 10), 9110846700);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md
index 3c0c1d3d362..801cadbb61c 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-49-prime-permutations.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39d1000cf542c50feb0
-title: 'Problem 49: Prime permutations'
+title: 'Problema 49: permutazioni di numeri primi'
 challengeType: 1
 forumTopicId: 302159
 dashedName: problem-49-prime-permutations
@@ -8,21 +8,21 @@ dashedName: problem-49-prime-permutations
 
 # --description--
 
-The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.
+La sequenza aritmetica, 1487, 4817, 8147, in cui ognuno dei termini cresce di 3330, è inusuale in due modi: (i) i tre termini sono primi, e, (ii) i tre numeri sono permutazioni.
 
-There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence.
+Non ci sono sequenze aritmetiche fatte di numeri primi a 1, 2 o 3 cifre che esibiscono questa proprietà, ma c'è un'altra sequenza crescente a 4 cifre.
 
-What 12-digit number do you form by concatenating the three terms in this sequence?
+Quale numero a 12 cifre ottieni concatenando i tre termini di questa sequenza?
 
 # --hints--
 
-`primePermutations()` should return a number.
+`primePermutations()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof primePermutations() === 'number');
 ```
 
-`primePermutations()` should return 296962999629.
+`primePermutations()` dovrebbe restituire 296962999629.
 
 ```js
 assert.strictEqual(primePermutations(), 296962999629);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md
index 7cd5bc67b14..bcab38f4885 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-50-consecutive-prime-sum.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39e1000cf542c50feb1
-title: 'Problem 50: Consecutive prime sum'
+title: 'Problema 50: somma di numeri primi consecutivi'
 challengeType: 1
 forumTopicId: 302161
 dashedName: problem-50-consecutive-prime-sum
@@ -8,31 +8,31 @@ dashedName: problem-50-consecutive-prime-sum
 
 # --description--
 
-The prime 41, can be written as the sum of six consecutive primes:
+Il numero primo 41, può essere scritto come la somma di sei numeri primi consecutivi:
 
 <div style='text-align: center;'>41 = 2 + 3 + 5 + 7 + 11 + 13</div>
 
-This is the longest sum of consecutive primes that adds to a prime below one-hundred.
+Questa è la somma più lunga di primi consecutivi che dà come somma un primo sotto il cento.
 
-The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.
+La somma più lunga di primi consecutivi sotto il mille che dà come somma un primo, contiene 21 termini, ed è pari a 953.
 
-Which prime, below one-million, can be written as the sum of the most consecutive primes?
+Quale primo, al di sotto di un milione, può essere scritto come la somma del maggior numero di numeri primi consecutivi?
 
 # --hints--
 
-`consecutivePrimeSum(1000)` should return a number.
+`consecutivePrimeSum(1000)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof consecutivePrimeSum(1000) === 'number');
 ```
 
-`consecutivePrimeSum(1000)` should return 953.
+`consecutivePrimeSum(1000)` dovrebbe restituire 953.
 
 ```js
 assert.strictEqual(consecutivePrimeSum(1000), 953);
 ```
 
-`consecutivePrimeSum(1000000)` should return 997651.
+`consecutivePrimeSum(1000000)` dovrebbe restituire 997651.
 
 ```js
 assert.strictEqual(consecutivePrimeSum(1000000), 997651);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md
index cdbfc3e568b..2267e786ad5 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-51-prime-digit-replacements.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f39f1000cf542c50feb2
-title: 'Problem 51: Prime digit replacements'
+title: 'Problema 51: sostituzioni di cifre in numeri primi'
 challengeType: 1
 forumTopicId: 302162
 dashedName: problem-51-prime-digit-replacements
@@ -8,33 +8,33 @@ dashedName: problem-51-prime-digit-replacements
 
 # --description--
 
-By replacing the 1st digit of the 2-digit number \*3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.
+Sostituendo la prima cifra del numero a 2 cifre \*3, si scopre che sei dei nove valori possibili: 13, 23, 43, 53, 73 e 83, sono tutti primi.
 
-By replacing the 3rd and 4th digits of 56\*\*3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.
+Sostituendo la terza e la quarta cifra di 56\*\*3 con la stessa cifra, questo numero a 5 cifre è il primo esempio con sette primi tra i dieci numeri generati, della famiglia: 56003, 56113, 56333, 56443, 56663, 56773 e 56993. Di conseguenza, 56003, essendo il primo membro di questa famiglia, è il più piccolo primo con questa proprietà.
 
-Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an `n` prime value family.
+Trova il numero primo più piccolo che, sostituendo parte del numero (non necessariamente cifre adiacenti) con la stessa cifra, fa parte di una famiglia di `n` valori primi.
 
 # --hints--
 
-`primeDigitReplacements(6)` should return a number.
+`primeDigitReplacements(6)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof primeDigitReplacements(6) === 'number');
 ```
 
-`primeDigitReplacements(6)` should return `13`.
+`primeDigitReplacements(6)` dovrebbe restituire `13`.
 
 ```js
 assert.strictEqual(primeDigitReplacements(6), 13);
 ```
 
-`primeDigitReplacements(7)` should return `56003`.
+`primeDigitReplacements(7)` dovrebbe restituire `56003`.
 
 ```js
 assert.strictEqual(primeDigitReplacements(7), 56003);
 ```
 
-`primeDigitReplacements(8)` should return `121313`.
+`primeDigitReplacements(8)` dovrebbe restituire `121313`.
 
 ```js
 assert.strictEqual(primeDigitReplacements(8), 121313);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md
index 7a3886a6e27..df13c4d8e9b 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-52-permuted-multiples.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a01000cf542c50feb3
-title: 'Problem 52: Permuted multiples'
+title: 'Problema 52: multipli permutati'
 challengeType: 1
 forumTopicId: 302163
 dashedName: problem-52-permuted-multiples
@@ -8,25 +8,25 @@ dashedName: problem-52-permuted-multiples
 
 # --description--
 
-It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
+Si può notare che il numero 125874 e il suo doppio, 251748, contengono esattamente le stesse cifre, ma in un ordine differente.
 
-Find the smallest positive integer, such that multiplied by integers $\\{2, 3, \ldots, n\\}$, contain the same digits.
+Trova il più piccolo numero intero positivo, che moltiplicato per gli interi $\\{2, 3, \ldots, n\\}$, contiene le stesse cifre.
 
 # --hints--
 
-`permutedMultiples(2)` should return a number.
+`permutedMultiples(2)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof permutedMultiples(2) === 'number');
 ```
 
-`permutedMultiples(2)` should return `125874`.
+`permutedMultiples(2)` dovrebbe restituire `125874`.
 
 ```js
 assert.strictEqual(permutedMultiples(2), 125874);
 ```
 
-`permutedMultiples(6)` should return `142857`.
+`permutedMultiples(6)` dovrebbe restituire `142857`.
 
 ```js
 assert.strictEqual(permutedMultiples(6), 142857);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md
index 8d96ff14392..21631a6a364 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-53-combinatoric-selections.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a11000cf542c50feb4
-title: 'Problem 53: Combinatoric selections'
+title: 'Problema 53: selezione combinatoria'
 challengeType: 1
 forumTopicId: 302164
 dashedName: problem-53-combinatoric-selections
@@ -8,45 +8,45 @@ dashedName: problem-53-combinatoric-selections
 
 # --description--
 
-There are exactly ten ways of selecting three from five, 12345:
+Ci sono esattamente dieci modi di selezionare tre da cinque, 12345:
 
-<div style='text-align: center;'>123, 124, 125, 134, 135, 145, 234, 235, 245, and 345</div>
+<div style='text-align: center;'>123, 124, 125, 134, 135, 145, 234, 235, 245 e 345</div>
 
-In combinatorics, we use the notation, $\\displaystyle \\binom 5 3 = 10$
+In statistica combinatoria, usiamo la notazione, $\\displaystyle \\binom 5 3 = 10$
 
-In general, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, where $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, and $0! = 1$.
+In generale, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, dove $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, e $0! = 1$.
 
-It is not until $n = 23$, that a value exceeds one-million: $\\displaystyle \\binom {23} {10} = 1144066$.
+È solo raggiungendo $n = 23$, che un valore eccede un milione: $\\displaystyle \\binom {23} {10} = 1144066$.
 
-How many, not necessarily distinct, values of $\\displaystyle \\binom n r$ for $1 \\le n \\le 100$, are greater than one-million?
+Quanti valori di $\\displaystyle \\binom n r$ per $1 \\le n \\le 100$, non necessariamente distinti, sono più grandi di un milione?
 
 # --hints--
 
-`combinatoricSelections(1000)` should return a number.
+`combinatoricSelections(1000)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof combinatoricSelections(1000) === 'number');
 ```
 
-`combinatoricSelections(1000)` should return 4626.
+`combinatoricSelections(1000)` dovrebbe restituire 4626.
 
 ```js
 assert.strictEqual(combinatoricSelections(1000), 4626);
 ```
 
-`combinatoricSelections(10000)` should return 4431.
+`combinatoricSelections(10000)` dovrebbe restituire 4431.
 
 ```js
 assert.strictEqual(combinatoricSelections(10000), 4431);
 ```
 
-`combinatoricSelections(100000)` should return 4255.
+`combinatoricSelections(100000)` dovrebbe restituire 4255.
 
 ```js
 assert.strictEqual(combinatoricSelections(100000), 4255);
 ```
 
-`combinatoricSelections(1000000)` should return 4075.
+`combinatoricSelections(1000000)` dovrebbe restituire 4075.
 
 ```js
 assert.strictEqual(combinatoricSelections(1000000), 4075);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md
index b08e9a13bda..38cc190a0da 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-54-poker-hands.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a21000cf542c50feb5
-title: 'Problem 54: Poker hands'
+title: 'Problema 54: mani di poker'
 challengeType: 1
 forumTopicId: 302165
 dashedName: problem-54-poker-hands
@@ -8,54 +8,54 @@ dashedName: problem-54-poker-hands
 
 # --description--
 
-In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:
+Nel gioco di carte del poker, una mano è composta da cinque carte che sono classificate, dalla più bassa alla più alta, nel modo seguente:
 
 <ul>
-  <li>High Card: Highest value card.</li>
-  <li>One Pair: Two cards of the same value.</li>
-  <li>Two Pairs: Two different pairs.</li>
-  <li>Three of a Kind: Three cards of the same value.</li>
-  <li>Straight: All cards are consecutive values.</li>
-  <li>Flush: All cards of the same suit.</li>
-  <li>Full House: Three of a kind and a pair.</li>
-  <li>Four of a Kind: Four cards of the same value.</li>
-  <li>Straight Flush: All cards are consecutive values of same suit.</li>
-  <li>Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.</li>
+  <li>Carta alta: carta di valore più alto.</li>
+  <li>Una coppia: due carte dello stesso valore.</li>
+  <li>Due coppie: due coppie diverse.</li>
+  <li>Tris: tre carte dello stesso valore.</li>
+  <li>Scala: tutte le carte hanno valori consecutivi.</li>
+  <li>Colore: tutte le carte dello stesso seme.</li>
+  <li>Full: tris e una coppia.</li>
+  <li>Poker: quattro carte dello stesso valore.</li>
+  <li>Scala colore: tutte le carte sono valori consecutivi dello stesso seme.</li>
+  <li>Scala reale: Dieci, Jack, Regina, Re, Asso, dello stesso seme.</li>
 </ul>
 
-The cards are valued in the order: 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.
+Le carte sono valutate nell'ordine: 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Regina, Re, Asso.
 
-If two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on.
+Se due giocatori hanno mani dello stesso valore, allora il punto composto dal valore più alto vince; per esempio, un paio di otto batte un paio di cinque (vedi esempio 1 di seguito). Ma se due punti sono pari, per esempio, entrambi i giocatori hanno una coppia di regine, vengono confrontate le carte più alte in ogni mano (vedi esempio 4 in basso); se le carte più alte sono pari allora vengono confrontate le carte più alte successive, e così via.
 
-Consider the following five hands dealt to two players:
+Considera le seguenti cinque mani distribuite a due giocatori:
 
-| Hand                      | Player 1                                                              | Player 2                                                               | Winner   |
-| ------------------------- | --------------------------------------------------------------------- | ---------------------------------------------------------------------- | -------- |
-| <strong>1</strong> | 5H 5C 6S 7S KD <br> Pair of Fives                               | 2C 3S 8S 8D TD <br> Pair of Eights                               | Player 2 |
-| <strong>2</strong> | 5D 8C 9S JS AC <br> Highest card Ace                            | 2C 5C 7D 8S QH <br> Highest card Queen                           | Player 1 |
-| <strong>3</strong> | 2D 9C AS AH AC <br> Three Aces                                  | 3D 6D 7D TD QD <br> Flush with Diamonds                          | Player 2 |
-| <strong>4</strong> | 4D 6S 9H QH QC <br> Pair of Queens <br> Highest card Nine | 3D 6D 7H QD QS <br> Pair of Queens <br> Highest card Seven | Player 1 |
-| <strong>5</strong> | 2H 2D 4C 4D 4S <br> Full House <br> with Three Fours      | 3C 3D 3S 9S 9D <br> Full House <br> with Three Threes      | Player 1 |
+| Mano                      | Giocatore 1                                                               | Giocatore 2                                                                | Vincitore   |
+| ------------------------- | ------------------------------------------------------------------------- | -------------------------------------------------------------------------- | ----------- |
+| <strong>1</strong> | 5H 5C 6S 7S KD <br> Coppia di cinque                                | 2C 3S 8S 8D TD <br> Coppia di otto                                   | Giocatore 2 |
+| <strong>2</strong> | 5D 8C 9S JS AC <br> Carta più alta asso                             | 2C 5C 7D 8S QH <br> Carta più alta regina                            | Giocatore 1 |
+| <strong>3</strong> | 2D 9C AS AH AC <br> Tris d'assi                                     | 3D 6D 7D TD QD <br> Colore di quadri                                 | Giocatore 2 |
+| <strong>4</strong> | 4D 6S 9H QH QC <br> Coppia di regine <br> Carta più alta nove | 3D 6D 7H QD QS <br> Coppia di regine <br> Carta più alta sette | Giocatore 1 |
+| <strong>5</strong> | 2H 2D 4C 4D 4S <br> Full <br> con tre quattro                 | 3C 3D 3S 9S 9D <br> Full <br> con tre tre                      | Giocatore 1 |
 
-The global array (`handsArr`) passed to the function, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner.
+L'array globale (`handsArr`) passato alla funzione, contiene mille mani casuali distribuite a due giocatori. Ogni riga del file contiene dieci carte (separate da uno spazio singolo): le prime cinque sono carte del giocatore 1 e le ultime cinque sono carte del giocatore 2. Si può presumere che tutte le mani siano valide (nessun carattere non valido o carte ripetute), la mano di ogni giocatore non è in ordine specifico, e in ogni mano c'è un chiaro vincitore.
 
-How many hands does Player 1 win?
+In quante mani vince Giocatore 1?
 
 # --hints--
 
-`pokerHands(testArr)` should return a number.
+`pokerHands(testArr)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof pokerHands(testArr) === 'number');
 ```
 
-`pokerHands(testArr)` should return 2.
+`pokerHands(testArr)` dovrebbe restituire 2.
 
 ```js
 assert.strictEqual(pokerHands(testArr), 2);
 ```
 
-`pokerHands(handsArr)` should return 376.
+`pokerHands(handsArr)` dovrebbe restituire 376.
 
 ```js
 assert.strictEqual(pokerHands(handsArr), 376);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md
index 890c5b0997d..b9546c0e948 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-55-lychrel-numbers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a31000cf542c50feb6
-title: 'Problem 55: Lychrel numbers'
+title: 'Problema 55: numeri di Lychrel'
 challengeType: 1
 forumTopicId: 302166
 dashedName: problem-55-lychrel-numbers
@@ -8,9 +8,9 @@ dashedName: problem-55-lychrel-numbers
 
 # --description--
 
-If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
+Se prendiamo il 47, e gli sommiamo lo speculare, 47 + 74 = 121, che è palindromo.
 
-Not all numbers produce palindromes so quickly. For example,
+Non tutti i numeri producono palindromi così rapidamente. Ad esempio,
 
 <div style="margin-left: 4em;">
   349 + 943 = 1292,<br>
@@ -18,49 +18,49 @@ Not all numbers produce palindromes so quickly. For example,
   4213 + 3124 = 7337<br>
 </div>
 
-That is, 349 took three iterations to arrive at a palindrome.
+Cioè, il 349 richiede tre iterazioni per arrivare a un palindromo.
 
-Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).
+Anche se nessuno lo ha ancora dimostrato, si pensa che alcuni numeri, come il 196, non producano mai un palindromo. Un numero che non forma mai un palindromo attraverso un processo di inversione e addizione è chiamato numero di Lychrel. Data la teoretica natura di questi numeri, e per il proposito di questo problema, assumiamo che un numero è un numero di Lychrel fino a prova contraria. In aggiunta ti è dato che per ogni numero al di sotto di diecimila, questo (i) diventerà un palindromo in meno di cinquanta iterazioni, oppure, (ii), nessuno, con tutto il potere computazionale che esiste, è riuscito finora a ricollegarlo a un palindromo. Infatti, 10677 è il primo numero trovato per cui sono necessarie più di cinquanta iterazioni prima di produrre un palindromo: 4668731596684224866951378664 (53 iterazioni, 28-cifre).
 
-Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.
+Sorprendentemente, ci sono numeri palindromi che sono a loro volta numeri di Lychrel; il primo esempio è 4994.
 
-How many Lychrel numbers are there below `num`?
+Quanti numeri di Lychrel ci sono sotto `num`?
 
-**Note:** Wording was modified slightly on 24 April 2007 to emphasize the theoretical nature of Lychrel numbers.
+**Nota:** la descrizione è stata modificata leggermente il giorno 24 Aprile 2007 per enfatizzare la natura teoretica dei numeri di Lychrel.
 
 # --hints--
 
-`countLychrelNumbers(1000)` should return a number.
+`countLychrelNumbers(1000)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof countLychrelNumbers(1000) === 'number');
 ```
 
-`countLychrelNumbers(1000)` should return 13.
+`countLychrelNumbers(1000)` dovrebbe restituire 13.
 
 ```js
 assert.strictEqual(countLychrelNumbers(1000), 13);
 ```
 
-`countLychrelNumbers(3243)` should return 39.
+`countLychrelNumbers(3243)` dovrebbe restituire 39.
 
 ```js
 assert.strictEqual(countLychrelNumbers(3243), 39);
 ```
 
-`countLychrelNumbers(5000)` should return 76.
+`countLychrelNumbers(5000)` dovrebbe restituire 76.
 
 ```js
 assert.strictEqual(countLychrelNumbers(5000), 76);
 ```
 
-`countLychrelNumbers(7654)` should return 140.
+`countLychrelNumbers(7654)` dovrebbe restituire 140.
 
 ```js
 assert.strictEqual(countLychrelNumbers(7654), 140);
 ```
 
-`countLychrelNumbers(10000)` should return 249.
+`countLychrelNumbers(10000)` dovrebbe restituire 249.
 
 ```js
 assert.strictEqual(countLychrelNumbers(10000), 249);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md
index e445973f332..1b02edc22ad 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-56-powerful-digit-sum.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a41000cf542c50feb7
-title: 'Problem 56: Powerful digit sum'
+title: 'Problema 56: somma delle cifre della potenza'
 challengeType: 1
 forumTopicId: 302167
 dashedName: problem-56-powerful-digit-sum
@@ -8,43 +8,43 @@ dashedName: problem-56-powerful-digit-sum
 
 # --description--
 
-A googol ($10^{100}$) is a massive number: one followed by one-hundred zeros; $100^{100}$ is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
+Un googol ($10^{100}$) è un numero enorme: uno seguito da cento zeri; $100^{100}$ è un numero inimmaginabilmente grande: uno seguito da duecento zeri. Nonostante la loro dimensione, la somma delle cifre in ogni numero è solo 1.
 
-Considering natural numbers of the form, $a^b$, where `a`, `b` &lt; `n`, what is the maximum digital sum?
+Considerando numeri naturali nella forma, $a^b$, dove `a`, `b` &lt; `n`, qual è la somma massima delle cifre?
 
 # --hints--
 
-`powerfulDigitSum(3)` should return a number.
+`powerfulDigitSum(3)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof powerfulDigitSum(3) === 'number');
 ```
 
-`powerfulDigitSum(3)` should return `4`.
+`powerfulDigitSum(3)` dovrebbe restituire `4`.
 
 ```js
 assert.strictEqual(powerfulDigitSum(3), 4);
 ```
 
-`powerfulDigitSum(10)` should return `45`.
+`powerfulDigitSum(10)` dovrebbe restituire `45`.
 
 ```js
 assert.strictEqual(powerfulDigitSum(10), 45);
 ```
 
-`powerfulDigitSum(50)` should return `406`.
+`powerfulDigitSum(50)` dovrebbe restituire `406`.
 
 ```js
 assert.strictEqual(powerfulDigitSum(50), 406);
 ```
 
-`powerfulDigitSum(75)` should return `684`.
+`powerfulDigitSum(75)` dovrebbe restituire `684`.
 
 ```js
 assert.strictEqual(powerfulDigitSum(75), 684);
 ```
 
-`powerfulDigitSum(100)` should return `972`.
+`powerfulDigitSum(100)` dovrebbe restituire `972`.
 
 ```js
 assert.strictEqual(powerfulDigitSum(100), 972);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md
index 034974d882c..de3667b74fb 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-57-square-root-convergents.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a51000cf542c50feb8
-title: 'Problem 57: Square root convergents'
+title: 'Problema 57: radici quadrate convergenti'
 challengeType: 1
 forumTopicId: 302168
 dashedName: problem-57-square-root-convergents
@@ -8,11 +8,11 @@ dashedName: problem-57-square-root-convergents
 
 # --description--
 
-It is possible to show that the square root of two can be expressed as an infinite continued fraction.
+È possibile dimostrare che la radice quadrata di due può essere espressa come una frazione infinita continua.
 
 <div style='text-align: center;'>$\sqrt 2 =1+ \frac 1 {2+ \frac 1 {2 +\frac 1 {2+ \dots}}}$</div>
 
-By expanding this for the first four iterations, we get:
+Espandendola per le prime quattro iterazioni, otteniamo:
 
 $1 + \\frac 1 2 = \\frac 32 = 1.5$
 
@@ -22,31 +22,31 @@ $1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 2}} = \\frac {17}{12} = 1.41666 \\dots$
 
 $1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 {2+\\frac 1 2}}} = \\frac {41}{29} = 1.41379 \\dots$
 
-The next three expansions are $\\frac {99}{70}$, $\\frac {239}{169}$, and $\\frac {577}{408}$, but the eighth expansion, $\\frac {1393}{985}$, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator.
+Le prossime tre espansioni sono $\\frac {99}{70}$, $\\frac {239}{169}$, e $\\frac {577}{408}$, ma l'ottava espansione, $\\frac {1393}{985}$, è il primo esempio in cui il numero di cifre nel numeratore supera il numero di cifre nel denominatore.
 
-In the first `n` expansions, how many fractions contain a numerator with more digits than denominator?
+Nelle prime espansioni `n`, quante frazioni contengono un numeratore con più cifre del denominatore?
 
 # --hints--
 
-`squareRootConvergents(10)` should return a number.
+`squareRootConvergents(10)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof squareRootConvergents(10) === 'number');
 ```
 
-`squareRootConvergents(10)` should return 1.
+`squareRootConvergents(10)` dovrebbe restituire 1.
 
 ```js
 assert.strictEqual(squareRootConvergents(10), 1);
 ```
 
-`squareRootConvergents(100)` should return 15.
+`squareRootConvergents(100)` dovrebbe restituire 15.
 
 ```js
 assert.strictEqual(squareRootConvergents(100), 15);
 ```
 
-`squareRootConvergents(1000)` should return 153.
+`squareRootConvergents(1000)` dovrebbe restituire 153.
 
 ```js
 assert.strictEqual(squareRootConvergents(1000), 153);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md
index 70b80ebf2a1..b73bc8bfd6c 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-58-spiral-primes.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a61000cf542c50feb9
-title: 'Problem 58: Spiral primes'
+title: 'Problema 58: primi a spirale'
 challengeType: 1
 forumTopicId: 302169
 dashedName: problem-58-spiral-primes
@@ -8,7 +8,7 @@ dashedName: problem-58-spiral-primes
 
 # --description--
 
-Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.
+Partendo da 1 e proseguendo a spirale antioraria come di seguito, si forma una spirale quadrata con lunghezza laterale di 7.
 
 <div style='text-align: center;'>
   <strong><span style='color: red;'>37</span></strong> 36 35 34 33 32 <strong><span style='color: red;'>31</span></strong><br>
@@ -20,31 +20,31 @@ Starting with 1 and spiralling anticlockwise in the following way, a square spir
   <strong><span style='color: red;'>43</span></strong> 44 45 46 47 48 49<br>
 </div>
 
-It is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13 ≈ 62%.
+È interessante notare che i quadrati dispari si trovano lungo la diagonale in basso a destra, ma ciò che è più interessante è che 8 dei 13 numeri che si trovano lungo entrambe le diagonali sono primi, cioè un rapporto di 8/13 ≈ 62%.
 
-If one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued, what is the side length of the square spiral for which the percent of primes along both diagonals first falls below `percent`?
+Se un nuovo strato completo è avvolto intorno alla spirale sopra, verrà formata una spirale quadrata con lunghezza laterale di 9. If this process is continued, what is the side length of the square spiral for which the percent of primes along both diagonals first falls below `percent`?
 
 # --hints--
 
-`spiralPrimes(50)` should return a number.
+`spiralPrimes(50)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof spiralPrimes(50) === 'number');
 ```
 
-`spiralPrimes(50)` should return `11`.
+`spiralPrimes(50)` dovrebbe restituire `11`.
 
 ```js
 assert.strictEqual(spiralPrimes(50), 11);
 ```
 
-`spiralPrimes(15)` should return `981`.
+`spiralPrimes(15)` dovrebbe restituire `981`.
 
 ```js
 assert.strictEqual(spiralPrimes(15), 981);
 ```
 
-`spiralPrimes(10)` should return `26241`.
+`spiralPrimes(10)` dovrebbe restituire `26241`.
 
 ```js
 assert.strictEqual(spiralPrimes(10), 26241);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md
index 0784e292908..b9f0b2f37b9 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-59-xor-decryption.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a81000cf542c50feba
-title: 'Problem 59: XOR decryption'
+title: 'Problema 59: decifrazione di XOR'
 challengeType: 1
 forumTopicId: 302170
 dashedName: problem-59-xor-decryption
@@ -8,25 +8,25 @@ dashedName: problem-59-xor-decryption
 
 # --description--
 
-Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (\*) = 42, and lowercase k = 107.
+Ogni carattere in un computer ha assegnato un unico codice e lo standard preferito è ASCII (American Standard Code for Information Interchange - Codice standard americano per l'interscambio delle informazioni). Per esempio, A maiuscola = 65, asterisco (\*) = 42, e k minuscola = 107.
 
-A modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.
+Un metodo moderno di codifica è prendere un file di testo, convertire i byte in ASCII, e poi usare l'operatore XOR su ogni byte con un valore dato, preso da una chiave segreta. Il vantaggio della funzione XOR è che usare la stessa chiave di codifica sul testo cifrato, rigenera il testo iniziale; per esempio, 65 XOR 42 = 107, e 107 XOR 42 = 65.
 
-For unbreakable encryption, the key is the same length as the plain text message, and the key is made up of random bytes. The user would keep the encrypted message and the encryption key in different locations, and without both "halves", it is impossible to decrypt the message.
+Per una codifica non decodificabile, la chiave è della stessa lunghezza del messaggio e la chiave è fatta di byte random. L'utente deve tenere il messaggio cifrato e la chiave di codifica in due posti diversi, e senza le due "metà", è impossibile decifrare il messaggio.
 
-Unfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.
+Sfortunatamente, questo metodo non è pratico per la maggior parte degli utenti, quindi il metodo modificato è usare una password come chiave. Se la password è più corta del messaggio, cosa che è probabile, allora la chiave è ripetuta ciclicamente lungo il messaggio. L'equilibrio per questo metodo è usare una password sufficientemente lunga per questioni di sicurezza, ma abbastanza corta da essere memorizzabile.
 
-Your task has been made easy, as the encryption key consists of three lower case characters. Using `cipher`, an array containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.
+Il tuo compito è stato reso facile, la chiave di sicurezza consiste di tre lettere minuscole. Usando `cipher`, un array contenente i codici ASCII cifrati, e sapendo che il messaggio deve contenere parole comuni inglesi, decifra il messaggio e fai la somma dei valori ASCII del messaggio originale.
 
 # --hints--
 
-`XORDecryption(cipher)` should return a number.
+`XORDecryption(cipher)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof XORDecryption(cipher) === 'number');
 ```
 
-`XORDecryption(cipher)` should return 129448.
+`XORDecryption(cipher)` dovrebbe restituire 129448.
 
 ```js
 assert.strictEqual(XORDecryption(cipher), 129448);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md
index dc4a88c2cfb..8d2156ee066 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-60-prime-pair-sets.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a81000cf542c50febb
-title: 'Problem 60: Prime pair sets'
+title: 'Problema 60: set di coppie di numeri primi'
 challengeType: 1
 forumTopicId: 302172
 dashedName: problem-60-prime-pair-sets
@@ -8,19 +8,19 @@ dashedName: problem-60-prime-pair-sets
 
 # --description--
 
-The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
+I numeri primi 3, 7, 109 e 673 sono degni di nota. Prendendo qualsiasi due di questi numeri e concatenandoli in qualsiasi ordine, il risultato sarà sempre un numero primo. Per esempio, prendendo 7 e 109, sia 7109 che 1097 sono primi. La somma di questi quattro numeri primi, 792, rappresenta la somma più piccola per un set di 4 numeri primi con questa proprietà.
 
-Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
+Trova la somma più piccola per un set di cinque numeri primi in cui due numeri qualsiasi concatenati producono un altri numero primo.
 
 # --hints--
 
-`primePairSets()` should return a number.
+`primePairSets()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof primePairSets() === 'number');
 ```
 
-`primePairSets()` should return 26033.
+`primePairSets()` dovrebbe restituire 26033.
 
 ```js
 assert.strictEqual(primePairSets(), 26033);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md
index 99fee7255e8..191e370fa09 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-61-cyclical-figurate-numbers.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3a91000cf542c50febc
-title: 'Problem 61: Cyclical figurate numbers'
+title: 'Problema 61: numeri figurati ciclici'
 challengeType: 1
 forumTopicId: 302173
 dashedName: problem-61-cyclical-figurate-numbers
@@ -8,52 +8,52 @@ dashedName: problem-61-cyclical-figurate-numbers
 
 # --description--
 
-Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:
+I numeri triangolari, quadrati, pentagonali, esagonali, eptagonali e ottagonali sono tutti numeri figurati (poligonali) e sono generati dalle seguenti formule:
 
-| Type of Number | Formula                       | Sequence              |
+| Tipo di numero | Formula                       | Sequenza              |
 | -------------- | ----------------------------- | --------------------- |
-| Triangle       | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
-| Square         | $P_4(n) = n^2$                | 1, 4, 9, 16, 25, ...  |
-| Pentagonal     | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
-| Hexagonal      | $P_6(n) = n(2n−1)$            | 1, 6, 15, 28, 45, ... |
-| Heptagonal     | $P_7(n) = \frac{n(5n−3)}{2}$ | 1, 7, 18, 34, 55, ... |
-| Octagonal      | $P_8(n) = n(3n−2)$            | 1, 8, 21, 40, 65, ... |
+| Triangolare    | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
+| Quadrato       | $P_4(n) = n^2$                | 1, 4, 9, 16, 25, ...  |
+| Pentagonale    | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
+| Esagonale      | $P_6(n) = n(2n−1)$            | 1, 6, 15, 28, 45, ... |
+| Eptagonale     | $P_7(n) = \frac{n(5n−3)}{2}$ | 1, 7, 18, 34, 55, ... |
+| Ottagonale     | $P_8(n) = n(3n−2)$            | 1, 8, 21, 40, 65, ... |
 
-The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.
+L'insieme ordinato dei numeri a 4 cifre: 8128, 2882, 8281, ha tre interessanti proprietà.
 
-1. The set is cyclic, in that the last two digits of each number is the first two digits of the next number (including the last number with the first).
-2. Each polygonal type: triangle ($P_3(127) = 8128$), square ($P_4(91) = 8281$), and pentagonal ($P_5(44) = 2882$), is represented by a different number in the set.
-3. This is the only set of 4-digit numbers with this property.
+1. L'insieme è ciclico, in quanto le ultime due cifre di ogni numero sono le prime due cifre del seguente (incluso l'ultimo numero con il primo).
+2. Ogni tipo poligonale: triangolare ($P_3(127) = 8128$), quadrato ($P_4(91) = 8281$), e pentagonale ($P_5(44) = 2882$), è rappresentato da un diverso numero nell'insieme.
+3. Questo è l'unico insieme di numeri a quattro cifre con questa proprietà.
 
-Find the sum of all numbers in ordered sets of `n` cyclic 4-digit numbers for which each of the $P_3$ to $P_{n + 2}$ polygonal types, is represented by a different number in the set.
+Trova la somma di tutti i numeri in insiemi ordinati di `n` numeri ciclici a quattro cifre per cui ognuno dei tipi poligonali da $P_3$ a $P_{n + 2}$ è rappresentato da un diverso numero nell'insieme.
 
 # --hints--
 
-`cyclicalFigurateNums(3)` should return a number.
+`cyclicalFigurateNums(3)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof cyclicalFigurateNums(3) === 'number');
 ```
 
-`cyclicalFigurateNums(3)` should return `19291`.
+`cyclicalFigurateNums(3)` dovrebbe restituire `19291`.
 
 ```js
 assert.strictEqual(cyclicalFigurateNums(3), 19291);
 ```
 
-`cyclicalFigurateNums(4)` should return `28684`.
+`cyclicalFigurateNums(4)` dovrebbe restituire `28684`.
 
 ```js
 assert.strictEqual(cyclicalFigurateNums(4), 28684);
 ```
 
-`cyclicalFigurateNums(5)` should return `76255`.
+`cyclicalFigurateNums(5)` dovrebbe restituire `76255`.
 
 ```js
 assert.strictEqual(cyclicalFigurateNums(5), 76255);
 ```
 
-`cyclicalFigurateNums(6)` should return `28684`.
+`cyclicalFigurateNums(6)` dovrebbe restituire `28684`.
 
 ```js
 assert.strictEqual(cyclicalFigurateNums(6), 28684);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md
index a89d136f83c..6faf21d591c 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-62-cubic-permutations.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3aa1000cf542c50febd
-title: 'Problem 62: Cubic permutations'
+title: 'Problema 62: permutazioni cubiche'
 challengeType: 1
 forumTopicId: 302174
 dashedName: problem-62-cubic-permutations
@@ -8,37 +8,37 @@ dashedName: problem-62-cubic-permutations
 
 # --description--
 
-The cube, 41063625 ($345^3$), can be permuted to produce two other cubes: 56623104 ($384^3$) and 66430125 ($405^3$). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.
+Il cubo 41063625 ($345^3$), può essere permutato per produrre altri due cubi: 56623104 ($384^3$) e 66430125 ($405^3$). Infatti, 41063625 è il cubo più piccolo che ha esattamente tre permutazioni delle sue cifre che sono anch'esse dei cubi.
 
-Find the smallest cube for which exactly `n` permutations of its digits are cube.
+Trova il cubo più piccolo per il quale esattamente `n` permutazioni delle sue cifre sono dei cubi.
 
 # --hints--
 
-`cubicPermutations(2)` should return a number.
+`cubicPermutations(2)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof cubicPermutations(2) === 'number');
 ```
 
-`cubicPermutations(2)` should return `125`.
+`cubicPermutations(2)` dovrebbe restituire `125`.
 
 ```js
 assert.strictEqual(cubicPermutations(2), 125);
 ```
 
-`cubicPermutations(3)` should return `41063625`.
+`cubicPermutations(3)` dovrebbe restituire `41063625`.
 
 ```js
 assert.strictEqual(cubicPermutations(3), 41063625);
 ```
 
-`cubicPermutations(4)` should return `1006012008`.
+`cubicPermutations(4)` dovrebbe restituire `1006012008`.
 
 ```js
 assert.strictEqual(cubicPermutations(4), 1006012008);
 ```
 
-`cubicPermutations(5)` should return `127035954683`.
+`cubicPermutations(5)` dovrebbe restituire `127035954683`.
 
 ```js
 assert.strictEqual(cubicPermutations(5), 127035954683);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md
index 2c8b0bb8cd6..541d492c4d0 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-63-powerful-digit-counts.md
@@ -8,73 +8,73 @@ dashedName: problem-63-powerful-digit-counts
 
 # --description--
 
-The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.
+Il numero a 5 cifre, 16807 = 7<sup>5</sup>, è anche una quinta potenza. Analogamente, il numero a 9 cifre, 134217728 = 8<sup>9</sup>, è una nona potenza.
 
-Complete the function so that it returns how many positive integers are of length `n` and an `n`th power.
+Completa la funzione in modo che restituisca quanti interi positivi siano di lunghezza `n` e `n`-esima potenza.
 
 # --hints--
 
-`powerfulDigitCounts(1)` should return a number.
+`powerfulDigitCounts(1)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof powerfulDigitCounts(1) === 'number');
 ```
 
-`powerfulDigitCounts(1)` should return `9`.
+`powerfulDigitCounts(1)` dovrebbe restituire `9`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(1), 9);
 ```
 
-`powerfulDigitCounts(2)` should return `6`.
+`powerfulDigitCounts(2)` dovrebbe restituire `6`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(2), 6);
 ```
 
-`powerfulDigitCounts(3)` should return `5`.
+`powerfulDigitCounts(3)` dovrebbe restituire `5`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(3), 5);
 ```
 
-`powerfulDigitCounts(4)` should return `4`.
+`powerfulDigitCounts(4)` dovrebbe restituire `4`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(4), 4);
 ```
 
-`powerfulDigitCounts(5)` should return `3`.
+`powerfulDigitCounts(5)` dovrebbe restituire `3`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(5), 3);
 ```
 
-`powerfulDigitCounts(6)` should return `3`.
+`powerfulDigitCounts(6)` dovrebbe restituire `3`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(6), 3);
 ```
 
-`powerfulDigitCounts(7)` should return `2`.
+`powerfulDigitCounts(7)` dovrebbe restituire `2`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(7), 2);
 ```
 
-`powerfulDigitCounts(8)` should return `2`.
+`powerfulDigitCounts(8)` dovrebbe restituire `2`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(8), 2);
 ```
 
-`powerfulDigitCounts(10)` should return `2`.
+`powerfulDigitCounts(10)` dovrebbe restituire `2`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(10), 2);
 ```
 
-`powerfulDigitCounts(21)` should return `1`.
+`powerfulDigitCounts(21)` dovrebbe restituire `1`.
 
 ```js
 assert.strictEqual(powerfulDigitCounts(21), 1);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md
index a6acdfc610e..c0c03584a69 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-64-odd-period-square-roots.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3ac1000cf542c50febf
-title: 'Problem 64: Odd period square roots'
+title: 'Problema 64: radici quadrate con periodo dispari'
 challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
@@ -8,19 +8,19 @@ dashedName: problem-64-odd-period-square-roots
 
 # --description--
 
-All square roots are periodic when written as continued fractions and can be written in the form:
+Tutte le radici quadrate sono periodiche quando sono scritte come frazioni continue e possono essere scritte nella forma:
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-For example, let us consider $\\sqrt{23}$:
+Per esempio, consideriamo $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
-If we continue we would get the following expansion:
+Se continuiamo otterremmo questa espansione:
 
 $\\displaystyle \\quad \\quad \\sqrt{23}=4+\\frac 1 {1+\\frac 1 {3+ \\frac 1 {1+\\frac 1 {8+ \\dots}}}}$
 
-The process can be summarized as follows:
+Il processo può essere riassunto come segue:
 
 $\\quad \\quad a_0=4, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$
 
@@ -38,61 +38,61 @@ $\\quad \\quad a_6=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\
 
 $\\quad \\quad a_7=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} {7}=8+\\sqrt{23}-4$
 
-It can be seen that the sequence is repeating. For conciseness, we use the notation $\\sqrt{23}=\[4;(1,3,1,8)]$, to indicate that the block (1,3,1,8) repeats indefinitely.
+Si può vedere che la sequenza si ripete. Per brevità usiamo la notazione $\\sqrt{23}=\[4;(1,3,1,8)]$, per indicare che il blocco (1,3,1,8) si ripete indefinitamente.
 
-The first ten continued fraction representations of (irrational) square roots are:
+Le prime dieci rappresentazioni come frazioni continue delle radici quadrate (irrazionali) sono:
 
-$\\quad \\quad \\sqrt{2}=\[1;(2)]$, period = 1
+$\\quad \\quad \\sqrt{2}=\[1;(2)]$, periodo = 1
 
-$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, period = 2
+$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, periodo = 2
 
-$\\quad \\quad \\sqrt{5}=\[2;(4)]$, period = 1
+$\\quad \\quad \\sqrt{5}=\[2;(4)]$, periodo = 1
 
-$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, period = 2
+$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, periodo = 2
 
-$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, period = 4
+$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, periodo = 4
 
-$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, period = 2
+$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, periodo = 2
 
-$\\quad \\quad \\sqrt{10}=\[3;(6)]$, period = 1
+$\\quad \\quad \\sqrt{10}=\[3;(6)]$, periodo = 1
 
-$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, period = 2
+$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, periodo = 2
 
-$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, period = 2
+$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, periodo = 2
 
-$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, period = 5
+$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, periodo = 5
 
-Exactly four continued fractions, for $N \\le 13$, have an odd period.
+Esattamente quattro frazioni continue per $N \\le 13$, hanno un periodo dispari.
 
-How many continued fractions for $N \\le n$ have an odd period?
+Quante frazioni continue hanno un periodo dispari per $N \\le n$?
 
 # --hints--
 
-`oddPeriodSqrts(13)` should return a number.
+`oddPeriodSqrts(13)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof oddPeriodSqrts(13) === 'number');
 ```
 
-`oddPeriodSqrts(500)` should return `83`.
+`oddPeriodSqrts(500)` dovrebbe restituire `83`.
 
 ```js
 assert.strictEqual(oddPeriodSqrts(500), 83);
 ```
 
-`oddPeriodSqrts(1000)` should return `152`.
+`oddPeriodSqrts(1000)` dovrebbe restituire `152`.
 
 ```js
 assert.strictEqual(oddPeriodSqrts(1000), 152);
 ```
 
-`oddPeriodSqrts(5000)` should return `690`.
+`oddPeriodSqrts(5000)` dovrebbe restituire `690`.
 
 ```js
 assert.strictEqual(oddPeriodSqrts(5000), 690);
 ```
 
-`oddPeriodSqrts(10000)` should return `1322`.
+`oddPeriodSqrts(10000)` dovrebbe restituire `1322`.
 
 ```js
 assert.strictEqual(oddPeriodSqrts(10000), 1322);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md
index 9aa62302442..5577d0d89e7 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-65-convergents-of-e.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3ad1000cf542c50fec0
-title: 'Problem 65: Convergents of e'
+title: 'Problema 65: convergenti di e'
 challengeType: 1
 forumTopicId: 302177
 dashedName: problem-65-convergents-of-e
@@ -8,59 +8,59 @@ dashedName: problem-65-convergents-of-e
 
 # --description--
 
-The square root of 2 can be written as an infinite continued fraction.
+La radice quadrata di 2 può essere scritta come una frazione continua infinita.
 
 $\\sqrt{2} = 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + ...}}}}$
 
-The infinite continued fraction can be written, $\\sqrt{2} = \[1; (2)]$ indicates that 2 repeats *ad infinitum*. In a similar way, $\\sqrt{23} = \[4; (1, 3, 1, 8)]$. It turns out that the sequence of partial values of continued fractions for square roots provide the best rational approximations. Let us consider the convergents for $\\sqrt{2}$.
+La frazione continuata infinita può essere scritta, $\\sqrt{2} = \[1; (2)]$ indica che il 2 si ripete *all'infinito*. In modo simile, $\\sqrt{23} = \[4; (1, 3, 1, 8)]$. La sequenza di valori parziali di frazioni continue delle radici quadrate fornisce l'approssimazione razionale migliore. Consideriamo le convergenze per $\\sqrt{2}$.
 
 $1 + \\dfrac{1}{2} = \\dfrac{3}{2}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2}} = \\dfrac{7}{5}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}} = \\dfrac{17}{12}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}}} = \\dfrac{41}{29}$
 
-Hence the sequence of the first ten convergents for $\\sqrt{2}$ are:
+Quindi la sequenza delle prime dieci convergenze per $\\sqrt{2}$ è:
 
 $1, \\dfrac{3}{2}, \\dfrac{7}{5}, \\dfrac{17}{12}, \\dfrac{41}{29}, \\dfrac{99}{70}, \\dfrac{239}{169}, \\dfrac{577}{408}, \\dfrac{1393}{985}, \\dfrac{3363}{2378}, ...$
 
-What is most surprising is that the important mathematical constant, $e = \[2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ... , 1, 2k, 1, ...]$. The first ten terms in the sequence of convergents for `e` are:
+What is most surprising is that the important mathematical constant, $e = \[2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ... , 1, 2k, 1, ...]$. I primi dieci termini della sequenza convergente di `e` sono:
 
 $2, 3, \\dfrac{8}{3}, \\dfrac{11}{4}, \\dfrac{19}{7}, \\dfrac{87}{32}, \\dfrac{106}{39}, \\dfrac{193}{71}, \\dfrac{1264}{465}, \\dfrac{1457}{536}, ...$
 
-The sum of digits in the numerator of the 10<sup>th</sup> convergent is $1 + 4 + 5 + 7 = 17$.
+La somma delle cifre del numeratore del 10<sup>o</sup> convergente è $1 + 4 + 5 + 7 = 17$.
 
-Find the sum of digits in the numerator of the `n`<sup>th</sup> convergent of the continued fraction for `e`.
+Trova la somma delle cifre nel numeratore per l'`n`-esimo convergente della frazione continuata di `e`.
 
 # --hints--
 
-`convergentsOfE(10)` should return a number.
+`convergentsOfE(10)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof convergentsOfE(10) === 'number');
 ```
 
-`convergentsOfE(10)` should return `17`.
+`convergentsOfE(10)` dovrebbe restituire `17`.
 
 ```js
 assert.strictEqual(convergentsOfE(10), 17);
 ```
 
-`convergentsOfE(30)` should return `53`.
+`convergentsOfE(30)` dovrebbe restituire `53`.
 
 ```js
 assert.strictEqual(convergentsOfE(30), 53);
 ```
 
-`convergentsOfE(50)` should return `91`.
+`convergentsOfE(50)` dovrebbe restituire `91`.
 
 ```js
 assert.strictEqual(convergentsOfE(50), 91);
 ```
 
-`convergentsOfE(70)` should return `169`.
+`convergentsOfE(70)` dovrebbe restituire `169`.
 
 ```js
 assert.strictEqual(convergentsOfE(70), 169);
 ```
 
-`convergentsOfE(100)` should return `272`.
+`convergentsOfE(100)` dovrebbe restituire `272`.
 
 ```js
 assert.strictEqual(convergentsOfE(100), 272);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md
index 9e01ce1b0c5..f2f54836eaf 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-66-diophantine-equation.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3ae1000cf542c50fec1
-title: 'Problem 66: Diophantine equation'
+title: 'Problema 66: equazione diofantina'
 challengeType: 1
 forumTopicId: 302178
 dashedName: problem-66-diophantine-equation
@@ -8,15 +8,15 @@ dashedName: problem-66-diophantine-equation
 
 # --description--
 
-Consider quadratic Diophantine equations of the form:
+Considera l'equazione quadratica diofantina nella forma:
 
 <div style='text-align: center;'>x<sup>2</sup> – Dy<sup>2</sup> = 1</div>
 
-For example, when D=13, the minimal solution in x is 649<sup>2</sup> – 13×180<sup>2</sup> = 1.
+Per esempio, quando D=13, la soluzione minimale in x è 649<sup>2</sup> – 13×180<sup>2</sup> = 1.
 
-It can be assumed that there are no solutions in positive integers when D is square.
+Si può assumere che non ci sono soluzioni con numeri interi positivi quando D è un quadrato.
 
-By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the following:
+Trovando la soluzione minimale in x per D = {2, 3, 5, 6, 7}, otteniamo quanto segue:
 
 <div style='margin-left: 2em;'>
   3<sup>2</sup> – 2×2<sup>2</sup> = 1<br>
@@ -26,43 +26,43 @@ By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the followi
   8<sup>2</sup> – 7×3<sup>2</sup> = 1<br>
 </div>
 
-Hence, by considering minimal solutions in `x` for D ≤ 7, the largest `x` is obtained when D=5.
+Quindi, considerando soluzioni minimali per `x` quando D ≤ 7, la `x` più grande si ottiene quando D=5.
 
-Find the value of D ≤ `n` in minimal solutions of `x` for which the largest value of `x` is obtained.
+Trova il valore di D ≤ `n` in soluzioni minimali di `x` per cui viene ottenuto il valore più grande di `x`.
 
 # --hints--
 
-`diophantineEquation(7)` should return a number.
+`diophantineEquation(7)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof diophantineEquation(7) === 'number');
 ```
 
-`diophantineEquation(7)` should return `5`.
+`diophantineEquation(7)` dovrebbe restituire `5`.
 
 ```js
 assert.strictEqual(diophantineEquation(7), 5);
 ```
 
-`diophantineEquation(100)` should return `61`.
+`diophantineEquation(100)` dovrebbe restituire `61`.
 
 ```js
 assert.strictEqual(diophantineEquation(100), 61);
 ```
 
-`diophantineEquation(409)` should return `409`.
+`diophantineEquation(409)` dovrebbe restituire `409`.
 
 ```js
 assert.strictEqual(diophantineEquation(409), 409);
 ```
 
-`diophantineEquation(500)` should return `421`.
+`diophantineEquation(500)` dovrebbe restituire `421`.
 
 ```js
 assert.strictEqual(diophantineEquation(500), 421);
 ```
 
-`diophantineEquation(1000)` should return `661`.
+`diophantineEquation(1000)` dovrebbe restituire `661`.
 
 ```js
 assert.strictEqual(diophantineEquation(1000), 661);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md
index c3aa2fb6e3b..4b5099a584a 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-67-maximum-path-sum-ii.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b01000cf542c50fec2
-title: 'Problem 67: Maximum path sum II'
+title: 'Problema 67: somma massima del percorso II'
 challengeType: 1
 forumTopicId: 302179
 dashedName: problem-67-maximum-path-sum-ii
@@ -8,7 +8,7 @@ dashedName: problem-67-maximum-path-sum-ii
 
 # --description--
 
-By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
+Cominciando dalla parte superiore del triangolo sottostante e spostandosi verso i numeri adiacenti sulla riga sottostante, il totale massimo dall'alto al basso è 23.
 
 <div style='text-align: center;'>
   <strong style='color: red;'>3</strong><br>
@@ -17,27 +17,27 @@ By starting at the top of the triangle below and moving to adjacent numbers on t
   8 5 <strong style='color: red;'>9</strong> 3
 </div>
 
-That is, 3 + 7 + 4 + 9 = 23.
+Cioè, 3 + 7 + 4 + 9 = 23.
 
-Find the maximum total from top to bottom in `numTriangle`, a 2D array defined in the background containing a triangle with one-hundred rows.
+Trova il totale massimo da cima a fondo in `numTriangle`, un array 2D definito dietro le quinte contenente un triangolo con cento righe.
 
-**Note:** This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 2<sup>99</sup> altogether! If you could check one trillion (10<sup>12</sup>) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)
+**Nota:** questa è una versione molto più difficile del problema 18. Non è possibile provare ogni percorso per risolvere questo problema, ce ne sono 2<sup>99</sup> in tutto! Se tu potessi controllare mille miliardi (10<sup>12</sup>) di percorsi ogni secondo ci vorrebbero dieci milioni di anni per controllarli tutti. C'è un algoritmo efficiente per risolverlo. ;o)
 
 # --hints--
 
-`maximumPathSumII(testTriangle)` should return a number.
+`maximumPathSumII(testTriangle)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof maximumPathSumII(_testTriangle) === 'number');
 ```
 
-`maximumPathSumII(testTriangle)` should return 23.
+`maximumPathSumII(testTriangle)` dovrebbe restituire 23.
 
 ```js
 assert.strictEqual(maximumPathSumII(_testTriangle), 23);
 ```
 
-`maximumPathSumII(numTriangle)` should return 7273.
+`maximumPathSumII(numTriangle)` dovrebbe restituire 7273.
 
 ```js
 assert.strictEqual(maximumPathSumII(_numTriangle), 7273);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md
index 7d8984cc7f8..ff091cabe36 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-68-magic-5-gon-ring.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b01000cf542c50fec3
-title: 'Problem 68: Magic 5-gon ring'
+title: 'Problema 68: anello pentagonale magico'
 challengeType: 1
 forumTopicId: 302180
 dashedName: problem-68-magic-5-gon-ring
@@ -8,13 +8,13 @@ dashedName: problem-68-magic-5-gon-ring
 
 # --description--
 
-Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.
+Considera il seguente anello trigonale "magico", riempito con i numeri da 1 a 6, e con ogni riga che somma a nove.
 
-<img class="img-responsive center-block" alt="a completed example of a 3-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="un esempio completo di un anello trigonale" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;" />
 
-Working **clockwise**, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.
+Lavorando in **senso orario** e iniziando dal gruppo di tre con il nodo esterno numericamente più piccolo (4, 3, 2 in questo esempio), ogni soluzione può essere descritta in modo univoco. Per esempio, la soluzione sopra può essere descritta dal set: 4,3,2; 6,2,1; 5,1,3.
 
-It is possible to complete the ring with four different totals: 9, 10, 11, and 12. There are eight solutions in total.
+È possibile completare l'anello con quattro somme diverse: 9, 10, 11, e 12. Ci sono otto soluzioni in totale.
 
 <div style='text-align: center;'>
 
@@ -31,21 +31,21 @@ It is possible to complete the ring with four different totals: 9, 10, 11, and 1
 
 </div>
 
-By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513.
+Concatenando ogni gruppo è possibile formare stringhe a 9 cifre; la stringa più grande per un anello trigonale è 432621513.
 
-Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum **16-digit** string for a "magic" 5-gon ring?
+Usando i numeri da 1 a 10, a seconda dell'arrangiamento, è possibile formare stringhe a 16 e 17 cifre. Qual è la stringa più grande a **16 cifre** per un anello pentagonale "magico"?
 
-<img class="img-responsive center-block" alt="a blank diagram of a 5-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="un diagramma vuoto di un anello pentagonale" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;" />
 
 # --hints--
 
-`magic5GonRing()` should return a number.
+`magic5GonRing()` dovrebbe restituire un numero.
 
 ```js
 assert(typeof magic5GonRing() === 'number');
 ```
 
-`magic5GonRing()` should return 6531031914842725.
+`magic5GonRing()` dovrebbe restituire 6531031914842725.
 
 ```js
 assert.strictEqual(magic5GonRing(), 6531031914842725);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md
index e57b133fbe7..91ed9da1947 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-69-totient-maximum.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b11000cf542c50fec4
-title: 'Problem 69: Totient maximum'
+title: 'Problema 69: toziente massimo'
 challengeType: 1
 forumTopicId: 302181
 dashedName: problem-69-totient-maximum
@@ -8,7 +8,7 @@ dashedName: problem-69-totient-maximum
 
 # --description--
 
-Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is used to determine the number of numbers less than `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, ${\phi}(9) = 6$.
+La funzione toziente di Eulero, ${\phi}(n)$ (a volte chiamata funzione phi), viene utilizzata per determinare il numero di numeri inferiori a `n` che sono relativamente primi a `n`. Ad esempio 1, 2, 4, 5, 7 e 8, sono tutti minori di nove e relativamente primi a nove, quindi ${\phi}(9) = 6$.
 
 <div style='margin-left: 4em;'>
 
@@ -26,37 +26,37 @@ Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is us
 
 </div>
 
-It can be seen that `n` = 6 produces a maximum $\displaystyle\frac{n}{{\phi}(n)}$ for `n` ≤ 10.
+Si può vedere che `n` = 6 produce un massimo di $\displaystyle\frac{n}{{\phi}(n)}$ per `n` ≤ 10.
 
-Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ is a maximum.
+Trova il valore di `n` ≤ `limit` per il quale $\displaystyle\frac{n}{{\phi(n)}}$ è un massimo.
 
 # --hints--
 
-`totientMaximum(10)` should return a number.
+`totientMaximum(10)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof totientMaximum(10) === 'number');
 ```
 
-`totientMaximum(10)` should return `6`.
+`totientMaximum(10)` dovrebbe restituire `6`.
 
 ```js
 assert.strictEqual(totientMaximum(10), 6);
 ```
 
-`totientMaximum(10000)` should return `2310`.
+`totientMaximum(10000)` dovrebbe restituire `2310`.
 
 ```js
 assert.strictEqual(totientMaximum(10000), 2310);
 ```
 
-`totientMaximum(500000)` should return `30030`.
+`totientMaximum(500000)` dovrebbe restituire `30030`.
 
 ```js
 assert.strictEqual(totientMaximum(500000), 30030);
 ```
 
-`totientMaximum(1000000)` should return `510510`.
+`totientMaximum(1000000)` dovrebbe restituire `510510`.
 
 ```js
 assert.strictEqual(totientMaximum(1000000), 510510);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md
index 1328f1ca1e7..f0e693a564b 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-70-totient-permutation.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b21000cf542c50fec5
-title: 'Problem 70: Totient permutation'
+title: 'Problema 70: permutazione toziente'
 challengeType: 1
 forumTopicId: 302183
 dashedName: problem-70-totient-permutation
@@ -8,39 +8,39 @@ dashedName: problem-70-totient-permutation
 
 # --description--
 
-Euler's Totient function, ${\phi}(n)$ (sometimes called the phi function), is used to determine the number of positive numbers less than or equal to `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, ${\phi}(9) = 6$. The number 1 is considered to be relatively prime to every positive number, so ${\phi}(1) = 1$.
+La funzione toziente di Eulero, ${\phi}(n)$ (a volte chiamata funzione phi), viene utilizzata per determinare il numero di numeri positivi minori o uguali a `n` che sono relativamente primi a `n`. Ad esempio 1, 2, 4, 5, 7 e 8, sono tutti minori di nove e relativamente primi a nove, quindi ${\phi}(9) = 6$. Il numero 1 è considerato relativamente primo di ogni numero positivo, quindi ${\phi}(1) = 1$.
 
-Interestingly, ${\phi}(87109) = 79180$, and it can be seen that 87109 is a permutation of 79180.
+È interessante notare che ${\phi}(87109) = 79180$, e si può vedere che 87109 è una permutazione di 79180.
 
-Find the value of `n`, 1 &lt; `n` &lt; `limit`, for which ${\phi}(n)$ is a permutation of `n` and the ratio $\displaystyle\frac{n}{{\phi}(n)}$ produces a minimum.
+Trova il valore di `n`, 1 &lt; `n` &lt; `limit`, per cui ${\phi}(n)$ è una permutazione di `n` e il rapporto $\displaystyle\frac{n}{{\phi}(n)}$ produce un minimo.
 
 # --hints--
 
-`totientPermutation(10000)` should return a number.
+`totientPermutation(10000)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof totientPermutation(10000) === 'number');
 ```
 
-`totientPermutation(10000)` should return `4435`.
+`totientPermutation(10000)` dovrebbe restituire `4435`.
 
 ```js
 assert.strictEqual(totientPermutation(10000), 4435);
 ```
 
-`totientPermutation(100000)` should return `75841`.
+`totientPermutation(100000)` dovrebbe restituire `75841`.
 
 ```js
 assert.strictEqual(totientPermutation(100000), 75841);
 ```
 
-`totientPermutation(500000)` should return `474883`.
+`totientPermutation(500000)` dovrebbe restituire `474883`.
 
 ```js
 assert.strictEqual(totientPermutation(500000), 474883);
 ```
 
-`totientPermutation(10000000)` should return `8319823`.
+`totientPermutation(10000000)` dovrebbe restituire `8319823`.
 
 ```js
 assert.strictEqual(totientPermutation(10000000), 8319823);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md
index 267a17669b0..3fcf95a6bce 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-71-ordered-fractions.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b31000cf542c50fec6
-title: 'Problem 71: Ordered fractions'
+title: 'Problema 71: frazioni ordinate'
 challengeType: 1
 forumTopicId: 302184
 dashedName: problem-71-ordered-fractions
@@ -8,49 +8,49 @@ dashedName: problem-71-ordered-fractions
 
 # --description--
 
-Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `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` &lt; `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}, \frac{3}{8}, \frac{\textbf2}{\textbf5}, \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 $\frac{2}{5}$ is the fraction immediately to the left of $\frac{3}{7}$.
+Si può vedere che $\frac{2}{5}$ è la frazione immediatamente a sinistra di $\frac{3}{7}$.
 
-By listing the set of reduced proper fractions for `d` ≤ `limit` in ascending order of size, find the numerator of the fraction immediately to the left of $\frac{3}{7}$.
+Elencando la lista di frazioni proprie ridotte per `d` ≤ `limit` in ordine crescente, trova il numeratore della frazione immediatamente a sinistra di $\frac{3}{7}$.
 
 # --hints--
 
-`orderedFractions(8)` should return a number.
+`orderedFractions(8)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof orderedFractions(8) === 'number');
 ```
 
-`orderedFractions(8)` should return `2`.
+`orderedFractions(8)` dovrebbe restituire `2`.
 
 ```js
 assert.strictEqual(orderedFractions(8), 2);
 ```
 
-`orderedFractions(10)` should return `2`.
+`orderedFractions(10)` dovrebbe restituire `2`.
 
 ```js
 assert.strictEqual(orderedFractions(10), 2);
 ```
 
-`orderedFractions(9994)` should return `4283`.
+`orderedFractions(9994)` dovrebbe restituire `4283`.
 
 ```js
 assert.strictEqual(orderedFractions(9994), 4283);
 ```
 
-`orderedFractions(500000)` should return `214283`.
+`orderedFractions(500000)` dovrebbe restituire `214283`.
 
 ```js
 assert.strictEqual(orderedFractions(500000), 214283);
 ```
 
-`orderedFractions(1000000)` should return `428570`.
+`orderedFractions(1000000)` dovrebbe restituire `428570`.
 
 ```js
 assert.strictEqual(orderedFractions(1000000), 428570);
diff --git a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md
index dab392ae0ae..ac6dd52020e 100644
--- a/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md
+++ b/curriculum/challenges/italian/18-project-euler/project-euler-problems-1-to-100/problem-72-counting-fractions.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f3b41000cf542c50fec7
-title: 'Problem 72: Counting fractions'
+title: 'Problema 72: contando frazioni'
 challengeType: 1
 forumTopicId: 302185
 dashedName: problem-72-counting-fractions
@@ -8,43 +8,43 @@ dashedName: problem-72-counting-fractions
 
 # --description--
 
-Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `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` &lt; `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}, \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 `21` elements in this set.
+Possiamo vedere che ci sono `21` elementi in questo set.
 
-How many elements would be contained in the set of reduced proper fractions for `d` ≤ `limit`?
+Quanti elementi sarebbero contenuti nel set di frazioni proprie ridotte per `d` ≤ `limit`?
 
 # --hints--
 
-`countingFractions(8)` should return a number.
+`countingFractions(8)` dovrebbe restituire un numero.
 
 ```js
 assert(typeof countingFractions(8) === 'number');
 ```
 
-`countingFractions(8)` should return `21`.
+`countingFractions(8)` dovrebbe restituire `21`.
 
 ```js
 assert.strictEqual(countingFractions(8), 21);
 ```
 
-`countingFractions(20000)` should return `121590395`.
+`countingFractions(20000)` dovrebbe restituire `121590395`.
 
 ```js
 assert.strictEqual(countingFractions(20000), 121590395);
 ```
 
-`countingFractions(500000)` should return `75991039675`.
+`countingFractions(500000)` dovrebbe restituire `75991039675`.
 
 ```js
 assert.strictEqual(countingFractions(500000), 75991039675);
 ```
 
-`countingFractions(1000000)` should return `303963552391`.
+`countingFractions(1000000)` dovrebbe restituire `303963552391`.
 
 ```js
 assert.strictEqual(countingFractions(1000000), 303963552391);
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
index caacff8c826..7802442e7e9 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -21,8 +21,8 @@ Complete a função usando as regras abaixo para modificar o objeto passado para
 
 -   A função precisa sempre retornar todo o objeto `records`.
 -   Se `value` for uma string vazia, remova a propriedade `prop` recebida do álbum.
--   If `prop` isn't `tracks` and `value` isn't an empty string, assign the `value` to that album's `prop`.
--   If `prop` is `tracks` and value isn't an empty string, add the `value` to the end of the album's `tracks` array. You need to create this array first if the album does not have a `tracks` property.
+-   Se `prop` não for `tracks` e `value` não for uma string vazia, atribua `value` à `prop` daquele álbum.
+-   Se `prop` for `tracks` e o valor não for uma string vazia, adicione o `value` ao final do array existente de `tracks` do álbum. Você precisa criar esse array primeiro se o álbum não tiver uma propriedade `tracks`.
 
 **Observação:** uma cópia do objeto `recordCollection` é usada para testes. Você não deve modificar diretamente o objeto `recordCollection`.
 
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index 5ffef1f8575..8bfdc2640b0 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -35,7 +35,7 @@ Você deve adicionar um ponto de divisão de `40%` a `@keyframes wave`.
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].some(css => css?.keyText === '40%'));
 ```
 
-You should have 4 waypoints in your keyframe.
+Deve haver 4 waypoints no keyframe.
 
 ```js
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].length === 4);
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index 0e45163e382..184b65b8fe6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -35,7 +35,7 @@ assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(ru
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].some(css => css?.keyText === '40%'));
 ```
 
-You should have 4 waypoints in your keyframe.
+Ви повинні мати 4 шляхові точки у ключовому кадрі.
 
 ```js
 assert([...[...new __helpers.CSSHelp(document).getCSSRules('keyframes')].find(rule => rule?.name === 'wave')?.cssRules].length === 4);
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 46ca662678d..290495491fb 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -25,7 +25,7 @@ assert($('input[type="checkbox"]')[0]);
 assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
-The text `Loving` should be wrapped in a `label` element.
+Текст `Loving` повинен бути обернутим в елемент `label`.
 
 ```js
 const checkboxInputElem = $('input[type="checkbox"]')[0];
@@ -71,7 +71,7 @@ const labelElem = document.querySelector('label[for="loving"]');
 assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```
 
-There should be a space between your checkbox and your new `label` element.
+Між прапорцем та новим елементом `label` повинен бути пробіл.
 
 ```js
 assert.match(code, />\s+<label\s+for\s*=\s*('|")loving/);
diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-a-data-graph-explorer-project/build-a-data-graph-explorer.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-a-data-graph-explorer-project/build-a-data-graph-explorer.md
index eb315cbe0bf..b6001597adb 100644
--- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-a-data-graph-explorer-project/build-a-data-graph-explorer.md
+++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-a-data-graph-explorer-project/build-a-data-graph-explorer.md
@@ -1,6 +1,6 @@
 ---
 id: 63d8402e39c73468b059cd43
-title: "Build a Data Graph Explorer"
+title: "Створіть дослідник графіку даних"
 challengeType: 10
 dashedName: build-a-data-graph-explorer
 ---
@@ -15,16 +15,16 @@ dashedName: build-a-data-graph-explorer
 
 У цьому завданні за допомогою Python потрібно створити багатофункціональний калькулятор, який приймає вхідні дані та виконує наступне:
 
-- Get a .csv file in three ways
-  - uploading it from the local computer
-  - getting a url from user input
-  - putting the url in the code
-- Use the Pandas library to save the .csv as a dataframe
-- Print headings and the first two rows
-- Store the column names as a list
-- Choose one or two columns and convert the data to Numpy arrays
-- Display data as a scatter plot or a line graph
-- Be able to do this for different column combinations, and interpret the graphs
+- може отримати файл .csv трьома способами
+  - завантажити з локального комп’ютера
+  - отримати URL-адресу із вводу користувача
+  - ввести URL-адресу в коді
+- використовує бібліотеку Pandas, щоб зберегти .csv як dataframe
+- друкує заголовки та перші два рядки
+- зберігає назви стовпців як список
+- вибирає один чи два стовпці та перетворює дані у масиви Numpy
+- відображає дані у вигляді точкової або лінійної діаграми
+- може обробляти різні комбінації стовпців та інтерпретувати графіки
 
 Як тільки закінчите, введіть посилання на загальнодоступний блокнот Colab на вашому гугл-диску.
 
diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-three-math-games-project/build-three-math-games.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-three-math-games-project/build-three-math-games.md
index a3c278c0ae8..aeb995b955f 100644
--- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-three-math-games-project/build-three-math-games.md
+++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/build-three-math-games-project/build-three-math-games.md
@@ -1,6 +1,6 @@
 ---
 id: 63d8401039c73468b059cd41
-title: "Build Three Math Games"
+title: "Створіть три математичні ігри"
 challengeType: 10
 dashedName: build-three-math-games
 ---
@@ -15,15 +15,15 @@ dashedName: build-three-math-games
 
 У цьому завданні за допомогою Python потрібно створити три математичні ігри, які виконують наступне:
 
-- Scatter plot game
-  - Randomly generate points on a graph and the player has to input the (x,y) coordinates
-  - For added difficulty, make the graph larger
-- Algebra practice game
-  - Generate one-step and two-step problems with random integer values and the player has to input the answer
-  - Use positive and negative values. For added difficulty, make the numbers larger
-- Projectile game
-  - Display a "wall" with random height and location. Player has to move sliders to adjust a parabolic path to clear the wall
-  - For added difficulty, make a second level where players enter a, b, and c without sliders
+- Гра «Точкова діаграма»
+  - Випадково генерує точки на графіку, а гравець повинен ввести координати (x, y)
+  - Щоб гра була складнішою, зробіть графік більшим
+- Гра «Практика алгебри»
+  - Створіть приклади з однією та двома діями, а гравець повинен ввести відповідь
+  - Використайте додатні та від’ємні значення. Щоб гра була складнішою, зробіть числа більшими
+- Гра «Метальний об’єкт»
+  - Зобразіть «стіну» з випадковою висотою та розташуванням. Гравець повинен перетягнути повзунки так, щоб змінити параболічну траєкторію та очистити стіну
+  - Щоб гра була складнішою, створіть другий рівень, де гравець вводить a, b та c без повзунків
 
 Як тільки закінчите, введіть посилання на загальнодоступний блокнот Colab на вашому гугл-диску.
 
diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems-of-equations-extra.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems-of-equations-extra.md
index 076a12baf1c..eb27d81ad76 100644
--- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems-of-equations-extra.md
+++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems-of-equations-extra.md
@@ -1,6 +1,6 @@
 ---
 id: 6331d276b51aeedd1a2bd64d
-title: "Graphing Systems of Equations: Extra"
+title: "Побудова графіку систем рівнянь: додатково"
 challengeType: 15
 videoId: q8ad1tTFqns
 dashedName: graphing-systems-of-equations-extra
@@ -8,31 +8,31 @@ dashedName: graphing-systems-of-equations-extra
 
 # --description--
 
-This next video will give you a deeper dive into what you can do with graphing systems of equations, graphing inequalities, and shading above or below the line. You will also see how to download the graph to your computer or your Google Drive.
+Наступне відео детальніше пояснить те, що ви можете робити з графічними системами рівнянь, графічними нерівностями та затіненням над/під лінією. Ви також побачите, як завантажити графік на свій комп’ютер чи гугл-диск.
 
-Here is the <a href="https://colab.research.google.com/drive/1m5oG62NzUHRzBghGCPRfr1SzvbywRWPV?usp=sharing" target="_blank" rel="noopener noreferrer nofollow">Colab notebook used in this video.</a>
+Ось <a href="https://colab.research.google.com/drive/1m5oG62NzUHRzBghGCPRfr1SzvbywRWPV?usp=sharing" target="_blank" rel="noopener noreferrer nofollow">блокнот Colab для цього відео.</a>
 
 # --question--
 
 ## --text--
 
-If you want to create an interactive plot with a slider to zoom in and out, where does most of the graphing code appear?
+Ви хочете створити інтерактивний графік з повзунком для збільшення/зменшення масштабу. Де розміститься більша частина коду графіку?
 
 ## --answers--
 
-Within the interactive() function
+У межах функції interactive()
 
 ---
 
-In the slider
+У повзунці
 
 ---
 
-Within the function that the interactive() calls
+У межах функції, яку викликає interactive()
 
 ---
 
-Before all of the functions
+Перед усіма функціями
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems.md b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems.md
index ce4d9d07df6..17f51fcd583 100644
--- a/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems.md
+++ b/curriculum/challenges/ukrainian/17-college-algebra-with-python/learn-how-to-graph-systems-of-equations/graphing-systems.md
@@ -1,6 +1,6 @@
 ---
 id: 6331d27db51aeedd1a2bd64e
-title: "Graphing Systems"
+title: "Побудова графіку систем рівнянь"
 challengeType: 15
 videoId: FxSIFR4zsrE
 dashedName: graphing-systems
@@ -8,35 +8,35 @@ dashedName: graphing-systems
 
 # --description--
 
-This first video will show you how to graph systems of equations with with written math, then code.
+Перше відео покаже, як побудувати графік системи рівнянь письмово, а потім за допомогою коду.
 
-Here is the <a href="https://colab.research.google.com/drive/1N1JEZJctODxsntROnmg0VqMSHXYdIlFD?usp=sharing" target="_blank" rel="noopener noreferrer nofollow">Colab notebook used in this video.</a>
+Ось <a href="https://colab.research.google.com/drive/1N1JEZJctODxsntROnmg0VqMSHXYdIlFD?usp=sharing" target="_blank" rel="noopener noreferrer nofollow">блокнот Colab для цього відео.</a>
 
 # --question--
 
 ## --assignment--
 
-Add code from the video to the algebra notebook you are building, and test it with different functions.
+Додайте код з відео до свого блокнота та проведіть над ним тести з різними функціями.
 
 ## --text--
 
-The numpy `linspace()` function takes three arguments to create an array. Which of the following arguments does it not take?
+Функція `linspace()` у numpy приймає три аргументи для створення масиву. Який з перелічених аргументів вона не приймає?
 
 ## --answers--
 
-Minimum value
+Мінімальне значення
 
 ---
 
-Maximum value
+Максимальне значення
 
 ---
 
-Number of items in the array
+Кількість елементів у масиві
 
 ---
 
-Formula to generate each item
+Формула для генерації кожного елемента
 
 ## --video-solution--
 
diff --git a/curriculum/dictionaries/chinese-traditional/comments.json b/curriculum/dictionaries/chinese-traditional/comments.json
index d78d1f4f99b..4b265fb2523 100644
--- a/curriculum/dictionaries/chinese-traditional/comments.json
+++ b/curriculum/dictionaries/chinese-traditional/comments.json
@@ -66,7 +66,7 @@
   "cvh4x7": "只修改這一行下面的代碼",
   "lvmnm7": "打開一個新的選項卡，顯示貓的圖片",
   "avpx79": "打開你的瀏覽器控制檯。",
-  "0b5ps6": "Padding between the SVG boundary and the plot",
+  "0b5ps6": "SVG 邊界和繪圖之間的填充",
   "uemoej": "將 n 個 0 推入當前行以創建列",
   "lm86nf": "將當前行（已有 n 個 0）推送到數組",
   "qscelx": "可從 Redux 對象獲得 Redux 方法",
diff --git a/curriculum/dictionaries/chinese/comments.json b/curriculum/dictionaries/chinese/comments.json
index 6d27abffca6..f18a1233eb1 100644
--- a/curriculum/dictionaries/chinese/comments.json
+++ b/curriculum/dictionaries/chinese/comments.json
@@ -66,7 +66,7 @@
   "cvh4x7": "只修改这一行下面的代码",
   "lvmnm7": "打开一个新的选项卡，显示猫的图片",
   "avpx79": "打开你的浏览器控制台。",
-  "0b5ps6": "Padding between the SVG boundary and the plot",
+  "0b5ps6": "SVG 边界和绘图之间的填充",
   "uemoej": "将 n 个 0 推入当前行以创建列",
   "lm86nf": "将当前行（已有 n 个 0）推送到数组",
   "qscelx": "可从 Redux 对象获得 Redux 方法",