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

14
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
View File

@ -1,6 +1,6 @@
---
id: 5900f37d1000cf542c50fe8f
title: 'Problem 16: Power digit sum'
title: 'Problema 16: Somma delle cifre della potenza'
challengeType: 5
forumTopicId: 301791
dashedName: problem-16-power-digit-sum
@ -8,31 +8,31 @@ dashedName: problem-16-power-digit-sum
# --description--
2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
2<sup>15</sup> = 32768 e la somma delle sue cifre è 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2<sup><code>exponent</code></sup>?
Qual'è la somma delle cifre del numero 2<sup><code>exponent</code></sup>?
# --hints--
`powerDigitSum(15)` should return a number.
`powerDigitSum(15)` dovrebbe restituire un numero.
```js
assert(typeof powerDigitSum(15) === 'number');
```
`powerDigitSum(15)` should return 26.
`powerDigitSum(15)` dovrebbe restituire 26.
```js
assert.strictEqual(powerDigitSum(15), 26);
```
`powerDigitSum(128)` should return 166.
`powerDigitSum(128)` dovrebbe restituire 166.
```js
assert.strictEqual(powerDigitSum(128), 166);
```
`powerDigitSum(1000)` should return 1366.
`powerDigitSum(1000)` dovrebbe restituire 1366.
```js
assert.strictEqual(powerDigitSum(1000), 1366);