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

This commit is contained in:
camperbot
2022-03-04 19:46:29 +05:30
committed by GitHub
parent e24c8abc7f
commit 3d3972f2dd
113 changed files with 1394 additions and 1111 deletions

View File

@ -1,6 +1,6 @@
---
id: 5900f51e1000cf542c510030
title: 'Problem 432: Totient sum'
title: 'Problema 432: Somma di tozienti'
challengeType: 5
forumTopicId: 302103
dashedName: problem-432-totient-sum
@ -8,18 +8,18 @@ dashedName: problem-432-totient-sum
# --description--
Let S(n,m) = φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
Sia $S(n, m) = \sum φ(n × i)$ per $1 ≤ i ≤ m$. ($φ$ è la funzione toziente di Eulero)
You are given that S(510510,106 )= 45480596821125120.
Ti è dato che $S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120$.
Find S(510510,1011). Give the last 9 digits of your answer.
Trova $S(510\\,510, {10}^{11})$. Dai le ultime 9 cifre della tua risposta.
# --hints--
`euler432()` should return 754862080.
`totientSum()` dovrebbe restituire `754862080`.
```js
assert.strictEqual(euler432(), 754862080);
assert.strictEqual(totientSum(), 754862080);
```
# --seed--
@ -27,12 +27,12 @@ assert.strictEqual(euler432(), 754862080);
## --seed-contents--
```js
function euler432() {
function totientSum() {
return true;
}
euler432();
totientSum();
```
# --solutions--