136 lines
1.2 KiB
Markdown
136 lines
1.2 KiB
Markdown
---
|
|
id: 5
|
|
localeTitle: 5900f4021000cf542c50ff14
|
|
challengeType: 5
|
|
title: 'Problem 148: Exploring Pascal"s triangle'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
Podemos verificar fácilmente que ninguna de las entradas en las primeras siete filas del triángulo de Pascal son divisibles entre 7:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1
|
|
|
|
|
|
|
|
1
|
|
|
|
3
|
|
|
|
3
|
|
|
|
1
|
|
|
|
|
|
1
|
|
|
|
4
|
|
|
|
6
|
|
|
|
4
|
|
|
|
1
|
|
|
|
1
|
|
|
|
5
|
|
|
|
10
|
|
|
|
10
|
|
|
|
5
|
|
|
|
1
|
|
1
|
|
|
|
6
|
|
|
|
15
|
|
|
|
20
|
|
|
|
15
|
|
|
|
6
|
|
|
|
1
|
|
Sin embargo, si revisamos las primeras cien filas, encontraremos que solo 2361 de las 5050 entradas no son divisibles por 7.
|
|
|
|
Encuentre el número de entradas que no son divisibles por 7 en las primeras mil millones (109) filas del triángulo de Pascal.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler148()</code> debe devolver 2129970655314432.
|
|
testString: 'assert.strictEqual(euler148(), 2129970655314432, "<code>euler148()</code> should return 2129970655314432.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler148() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler148();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|