<section id="description">
<p>Let f(n) be the largest positive integer x less than 109 such that the last 9 digits of nx form the number x (including leading zeros), or zero if no such integer exists.</p><p>For example:</p>
<p>f(4) = 411728896 (4411728896 = ...490411728896)
f(10) = 0
f(157) = 743757 (157743757 = ...567000743757)
Σf(n), 2 ≤ n ≤ 103 = 442530011399
Find Σf(n), 2 ≤ n ≤ 106.</p>
</section>

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

euler455();


index

Проблема 455: Силы с отстающими цифрами

Problem 455: Powers With Trailing Digits

<code>euler455()</code> should return 450186511399999.