60 lines
1.2 KiB
Markdown
60 lines
1.2 KiB
Markdown
|
---
|
||
|
id: 5
|
||
|
localeTitle: 5900f3b61000cf542c50fec8
|
||
|
challengeType: 5
|
||
|
title: 'Problem 73: Counting fractions in a range'
|
||
|
---
|
||
|
|
||
|
## Description
|
||
|
<section id='description'>
|
||
|
Considera la fracción, n / d, donde n y d son enteros positivos. Si n <d and HCF(n,d)=1, it is called a reduced proper fraction.<code> 0 Si enumeramos el conjunto de fracciones adecuadas reducidas para d ≤ 8 en orden ascendente de tamaño, obtenemos:
|
||
|
1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1 / 3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
|
||
|
Se puede ver que hay 3 fracciones entre 1/3 y 1/2.
|
||
|
¿Cuántas fracciones hay entre 1/3 y 1/2 en el conjunto ordenado de fracciones apropiadas reducidas para d ≤ 12,000?
|
||
|
</section>
|
||
|
|
||
|
## Instructions
|
||
|
<section id='instructions'>
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Tests
|
||
|
<section id='tests'>
|
||
|
|
||
|
```yml
|
||
|
tests:
|
||
|
- text: <code>euler73()</code> debe devolver 7295372.
|
||
|
testString: 'assert.strictEqual(euler73(), 7295372, "<code>euler73()</code> should return 7295372.");'
|
||
|
|
||
|
```
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Challenge Seed
|
||
|
<section id='challengeSeed'>
|
||
|
|
||
|
<div id='js-seed'>
|
||
|
|
||
|
```js
|
||
|
function euler73() {
|
||
|
// Good luck!
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
euler73();
|
||
|
```
|
||
|
|
||
|
</div>
|
||
|
|
||
|
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Solution
|
||
|
<section id='solution'>
|
||
|
|
||
|
```js
|
||
|
// solution required
|
||
|
```
|
||
|
</section>
|