gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,learn): processed translations (#45165)

Browse Source
This commit is contained in:
camperbot
2022-02-19 12:56:08 +05:30
committed by GitHub
parent 8138a07d52
commit ba14990876
134 changed files with 1540 additions and 1511 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
View File

@ -1,6 +1,6 @@
---
id: 5900f38a1000cf542c50fe9d
title: 'Problem 30: Digit n powers'
title: 'Problema 30: Potenze delle cifre'
challengeType: 5
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, esso non è 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);