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

fix(curriculum): clean-up Project Euler 241-260 (#42879)

Browse Source 
* fix: clean-up Project Euler 241-260

* fix: typo

* Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-16 12:21:45 +02:00
committed by GitHub
parent b2059684ef
commit 67de105117
20 changed files with 272 additions and 154 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -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}.
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}.
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)].
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)]$.
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].
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]$.
How many odd-triplets are there with n ≤ 1012 ?
How many odd-triplets are there with $n ≤ {10}^{12}$?
# --hints--
`euler242()` should return 997104142249036700.
`oddTriplets()` should return `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--