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

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

Browse Source
This commit is contained in:
camperbot
2022-03-01 00:52:39 +05:30
committed by GitHub
parent b8667061a1
commit 18e5be9efa
91 changed files with 1112 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
View File

@ -1,6 +1,6 @@
---
id: 5900f45f1000cf542c50ff71
title: 'Problem 242: Odd Triplets'
title: 'Problema 242: Triplette Dispari'
challengeType: 5
forumTopicId: 301889
dashedName: problem-242-odd-triplets
@ -8,20 +8,20 @@ dashedName: problem-242-odd-triplets
# --description--
Given the set {1,2,...,n}, we define f(n,k) as the number of its k-element subsets with an odd sum of elements. For example, f(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
Dato il set {1,2,..., $n$}, definiamo $f(n, k)$ come il numero dei suoi sottoinsiemi di elementi $k$ con una somma dispari di elementi. Per esempio, $f(5,3) = 4$, dal momento che il set {1,2,3,4,5} ha quattro sottoinsiemi di 3 elementi con una somma dispari di elementi, cioè: {1,2,4}, {1,3,5}, {2,3,4} e {2,4,5}.
When all three values n, k and f(n,k) are odd, we say that they make an odd-triplet \[n,k,f(n,k)].
Quando tutti e tre i valori $n$, $k$ e $f(n, k)$ sono dispari, diciamo che essi formano una tripletta dispari $[n, k, f(n, k)]$.
There are exactly five odd-triplets with n ≤ 10, namely: \[1,1,f(1,1) = 1], \[5,1,f(5,1) = 3], \[5,5,f(5,5) = 1], \[9,1,f(9,1) = 5] and \[9,9,f(9,9) = 1].
Ci sono esattamente cinque triplette dispari con $n ≤ 10$, cioè: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $ [5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ e $[9, 9, f(9, 9) = 1]$.
How many odd-triplets are there with n ≤ 1012 ?
Quante triplette dispari ci sono con $n ≤ {10}^{12}$?
# --hints--
`euler242()` should return 997104142249036700.
`oddTriplets()` dovrebbe restituire `997104142249036700`.
```js
assert.strictEqual(euler242(), 997104142249036700);
assert.strictEqual(oddTriplets(), 997104142249036700);
```
# --seed--
@ -29,12 +29,12 @@ assert.strictEqual(euler242(), 997104142249036700);
## --seed-contents--
```js
function euler242() {
function oddTriplets() {
return true;
}
euler242();
oddTriplets();
```
# --solutions--