2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f49b1000cf542c50ffae
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 303: Multiples with small digits'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 303: Múltiplos con dígitos pequeños'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Para un entero positivo n, defina f (n) como el mínimo positivo múltiplo de n que, escrito en base 10, usa solo dígitos ≤ 2. Por lo tanto, f (2) = 2, f (3) = 12, f (7) = 21, f (42) = 210, f (89) = 1121222. También, . < p > Encontrar . < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler303()</ code > debe devolver 1111981904675169.
testString: 'assert.strictEqual(euler303(), 1111981904675169, "< code > euler303()< / code > should return 1111981904675169.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler303() {
// Good luck!
return true;
}
euler303();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >