66 lines
1.1 KiB
Markdown
66 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f50f1000cf542c510021
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 418: Factorisation triples'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Sea n un entero positivo. Un triple entero (a, b, c) se llama triple de factorización de n si: 1 ≤ a ≤ b ≤ c
|
||
|
|
a · b · c = n.
|
||
|
|
|
||
|
|
Defina f (n) como a + b + c para la factorización triple (a, b, c) de n que minimiza c / a. Se puede demostrar que este triple es único.
|
||
|
|
|
||
|
|
|
||
|
|
Por ejemplo, f (165) = 19, f (100100) = 142 y f (20!) = 4034872.
|
||
|
|
|
||
|
|
|
||
|
|
Encuentre f (43!).
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler418()</code> debe devolver 1177163565297340400.
|
||
|
|
testString: 'assert.strictEqual(euler418(), 1177163565297340400, "<code>euler418()</code> should return 1177163565297340400.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler418() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler418();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|