freeCodeCamp/problem-455-powers-with-trailing-digits.spanish.md at 3f328b73dcc1145e9bc2f74e40ebae31272ef527

Files

Beau Carnes 0d53170798 docs: add rest of Spanish docs for project Euler

2018-10-08 13:51:51 -04:00

1.1 KiB

Raw Blame History

id, localeTitle, challengeType, title

id	localeTitle	challengeType	title
5	5900f5331000cf542c510046	5	Problem 455: Powers With Trailing Digits

Description

Sea f (n) el mayor entero positivo x menor que 109, de modo que los últimos 9 dígitos de nx formen el número x (incluidos los ceros a la izquierda), o cero si no existe tal entero.

Por ejemplo:

f (4) = 411728896 (4411728896 = ... 490411728896) f (10) = 0 f (157) = 743757 (157743757 = ... 567000743757) Σf (n), 2 ≤ n ≤ 103 = 442530011399 Encuentre Σf (n), 2 ≤ n ≤ 106.

Instructions

Tests

tests:
  - text: <code>euler455()</code> debe devolver 450186511399999.
    testString: 'assert.strictEqual(euler455(), 450186511399999, "<code>euler455()</code> should return 450186511399999.");'

Challenge Seed

function euler455() {
  // Good luck!
  return true;
}

euler455();

Solution

// solution required

1.1 KiB Raw Blame History